So sánh phương pháp
Xem các phương pháp đã chọn cạnh nhau; những hàng khác biệt được làm nổi bật.
| Lập trình nguyên (Integer Programming× | Phân tích Khu vực Dịch vụ× | |
|---|---|---|
| Lĩnh vực≠ | Tối ưu hóa | Phân tích không gian |
| Họ | Process / pipeline | Process / pipeline |
| Năm ra đời≠ | 1958 | 2001 |
| Người khởi xướng≠ | Ralph Gomory (cutting planes, 1958); land-and-doig branch-and-bound (1960) | Harvey Miller & Shih-Lung Shaw |
| Loại≠ | Mathematical optimisation — exact combinatorial method | Network GIS pipeline |
| Công trình gốc≠ | Wolsey, L.A. (1998). Integer Programming. Wiley. ISBN: 9780471283669 | Miller, H. J., & Shaw, S.-L. (2001). Geographic Information Systems for Transportation: Principles and Applications. Oxford University Press. ISBN: 978-0-19-512394-4 |
| Tên gọi khác≠ | IP, MIP, mixed-integer programming, mixed-integer linear programming | Isochrone Analysis, Network Catchment Area Analysis, Travel-Time Polygon Analysis, Hizmet Alanı Analizi |
| Liên quan≠ | 4 | 3 |
| Tóm tắt≠ | Integer programming (IP), also called mixed-integer programming (MIP) when only some variables are restricted to whole numbers, is a branch of mathematical optimisation in which some or all decision variables must take integer or binary values. Building on linear programming, it was formalised through Ralph Gomory's cutting-plane method (1958) and the Land-and-Doig branch-and-bound algorithm (1960), and it has since become the standard exact framework for scheduling, assignment, routing, and resource-allocation problems. | Service Area Analysis delineates the geographic region reachable from one or more origin facilities within a specified travel cost — typically time, distance, or generalized impedance — by traversing a real road or transit network. It is widely used by urban planners, public health officials, logistics managers, and emergency response coordinators who need to understand actual accessibility rather than simple straight-line buffers. |
| ScholarGateBộ dữ liệu ↗ |
|
|