Location problems

DOI10.1016/0167-6377(85)90010-0zbMath0572.90022OpenAlexW2211267191MaRDI QIDQ1062596

P. M. Dearing

Publication date: 1985

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(85)90010-0

zbMATH Keywords

worst-case boundsfacility locationNP-hardnessp-centerplant locationfacility network problemspolynomial-time heuristics

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Integer programming (90C10) Inventory, storage, reservoirs (90B05) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items

Models for petroleum field exploitation, On the exact solution of large-scale simple plant location problems, A note on the m-center problem with rectilinear distances, On worst-case aggregation analysis for network location problems, Solving the simple plant location problem by genetic algorithm, Lagrangean heuristics for location problems, Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A simple heuristic for the p-centre problem
• Domination, independent domination, and duality in strongly chordal graphs
• Optimal packing and covering in the plane are NP-complete
• Locational analysis
• The simple plant location problem: Survey and synthesis
• Solving covering problems and the uncapacitated plant location problem on trees
• On the Complexity of Some Common Geometric Location Problems
• On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets
• On the Uncapacitated Plant Location Problem. II: Facets and Lifting Theorems
• State of the Art—Location on Networks: A Survey. Part I: The p-Center and p-Median Problems
• State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure
• Totally-Balanced and Greedy Matrices
• Solving Large-Scale Zero-One Linear Programming Problems
• Fractional vertices, cuts and facets of the simple plant location problem
• Some facets of the simple plant location polytope