A new approach to the multiple obnoxious facility location problem based on combinatorial and continuous tools
From MaRDI portal
Publication:6492453
DOI10.1007/S11590-024-02096-YMaRDI QIDQ6492453
Publication date: 25 April 2024
Published in: Optimization Letters (Search for Journal in Brave)
Cites Work
- Facility location models for distribution system design
- Solving circle packing problems by global optimization: numerical results and industrial applications
- Capacitated facility location: Separation algorithms and computational experience
- Packing up to 50 equal circles in a square
- Discrete facility location and routing of obnoxious activities.
- Packing equal circles in a square: A deterministic global optimization approach
- A survey of healthcare facility location
- The simple plant location problem: Survey and synthesis
- Extremely non-convex optimization problems: the case of the multiple obnoxious facilities location
- Voronoi Diagrams and Delaunay Triangulations
- New Methods in Mathematical Programming—On Varying All the Parameters in a Linear-Programming Problem and Sequential Solution of a Linear-Programming Problem
- Obnoxious Facility Location on Graphs
- A New Verified Optimization Technique for the "Packing Circles in a Unit Square" Problems
- Integer Programming: Methods, Uses, Computations
- Solving nonconvex nonlinear programs with reverse convex constraints by sequential linear programming
This page was built for publication: A new approach to the multiple obnoxious facility location problem based on combinatorial and continuous tools
