Global optimization algorithm for capacitated multi-facility continuous location-allocation problems

DOI10.1007/s10898-018-0621-6zbMath1405.90085OpenAlexW2789658433MaRDI QIDQ1668802

Francisco Trespalacios, Ignacio E. Grossmann, Cristiana L. Lara

Publication date: 29 August 2018

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-018-0621-6

zbMATH Keywords

nonconvex optimizationWeber problemmixed integer nonlinear programminglocation-allocation problemgeneralized disjunctive programming

Mathematics Subject Classification ID

Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Discrete location and assignment (90B80)

Related Items

Spatiotemporal Data Set for Out-of-Hospital Cardiac Arrests ⋮ A goal programming model for two-stage COVID19 test sampling centers location-allocation problem ⋮ Planar multifacility location problems with tree structure and finite dominating sets ⋮ Branch-and-price for a class of nonconvex mixed-integer nonlinear programs

Uses Software

• SCIP
• CPLEX
• ANTIGONE

Cites Work

• Unnamed Item
• A continuation approach for the capacitated multi-facility weber problem based on nonlinear SOCP reformulation
• The fixed charge problem. I: A new heuristic method
• A polyhedral branch-and-cut approach to global optimization
• ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
• New heuristic methods for the capacitated multi-facility Weber problem
• Global Optimization Procedures for the Capacitated Euclidean and l_p Distance Multifacility Location-Allocation Problems
• NP-Hard, Capacitated, Balanced p-Median Problems on a Chain Graph with a Continuum of Link Demands
• A squared-euclidean distance location-allocation problem
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• The Transportation-Location Problem
• Benchmarking optimization software with performance profiles.