On the Weber facility location problem with limited distances and side constraints

DOI10.1007/s11590-012-0538-9zbMath1294.90033OpenAlexW2051095135MaRDI QIDQ2448124

Daniel Aloise, Leo Liberti, Isaac F. Fernandes, Pierre Hansen, Dario José Aloise

Publication date: 30 April 2014

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-012-0538-9

zbMATH Keywords

global optimizationdecompositionfacility locationreformulation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Continuous location (90B85)

Related Items

Location-based techniques for the synergy approximation in combinatorial transportation auctions, Extensions to the Weber problem, A distance-limited continuous location-allocation problem for spatial planning of decentralized systems, Kantorovich–Rubinstein Distance Minimization: Application to Location Problems

Uses Software

• Bonmin
• NEOS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An improved column generation algorithm for minimum sum-of-squares clustering
• An algorithmic framework for convex mixed integer nonlinear programs
• Generalized coverage: new developments in covering location models
• Heuristic solution of the multisource Weber problem as a \(p\)-median problem
• Accelerating convergence in the Fermat-Weber location problem
• A polyhedral branch-and-cut approach to global optimization
• The gradual covering problem
• The Maximal Covering Location Problem with Capacities on Total Workload
• Locational analysis: highlights of growth to maturity
• Branching and bounds tighteningtechniques for non-convex MINLP
• Reformulations in Mathematical Programming: Definitions and Systematics
• The Facility Location Problem with Limited Distances
• On the Continuous Fermat-Weber Problem