Compară metode
Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.
| Programarea cu variabile întregi× | Modele de localizare-alocare× | |
|---|---|---|
| Domeniu≠ | Optimizare | Analiză spațială |
| Familie | Process / pipeline | Process / pipeline |
| Anul apariției≠ | 1958 | 1963 |
| Autorul original≠ | Ralph Gomory (cutting planes, 1958); land-and-doig branch-and-bound (1960) | Leon Cooper; S. L. Hakimi |
| Tip≠ | Mathematical optimisation — exact combinatorial method | Spatial facility-location optimization |
| Sursa seminală≠ | Wolsey, L.A. (1998). Integer Programming. Wiley. ISBN: 9780471283669 | Cooper, L. (1963). Location-allocation problems. Operations Research, 11(3), 331–343. DOI ↗ |
| Denumiri alternative≠ | IP, MIP, mixed-integer programming, mixed-integer linear programming | facility location, p-median problem, maximal covering location problem, yer-tahsis modelleri |
| Înrudite | 4 | 4 |
| Rezumat≠ | 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. | Location-allocation models decide where to place a set of facilities and simultaneously assign demand points to them so as to optimize an objective such as total travel cost, worst-case distance, or population covered. Rooted in the operations-research work of Cooper (1963) and Hakimi (1964) and central to network GIS, they answer questions like where to site warehouses, hospitals, fire stations, or schools to best serve a spatially distributed population. |
| ScholarGateSet de date ↗ |
|
|