Integer linear programming models for grid-based light post location problem
From MaRDI portal
Publication:1926907
DOI10.1016/j.ejor.2012.04.032zbMath1253.90139OpenAlexW2037106620MaRDI QIDQ1926907
Andrew Mah, John Doucette, Md. Noor-E-Alam
Publication date: 29 December 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2012.04.032
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The discrete facility location problem with balanced allocation of customers
- On optimization algorithms for the reservoir oil well placement problem
- Generalized coverage: new developments in covering location models
- The rectilinear distance Weber problem in the presence of a probabilistic line barrier
- A location-allocation heuristic for the capacitated multi-facility Weber problem with probabilistic customer locations
- Location and layout planning. A survey
- Solution approaches to hub location problems
- A tabu search with slope scaling for the multicommodity capacitated location problem with balancing requirements
- Single-source capacitated multi-facility Weber problem-an iterative two phase heuristic algorithm
- Solving large-scale maximum expected covering location problems by genetic algorithms: a comparative study
- A hierarchical location model for public facility planning
- Approximating the two-level facility location problem via a quasi-greedy approach
- NP-Hard, Capacitated, Balanced p-Median Problems on a Chain Graph with a Continuum of Link Demands
- Location-Allocation Problems
- A Lagrangean heuristic for the plant location problem with multiple facilities in the same site
- An Always-Convergent Numerical Scheme for a Random Locational Equilibrium Problem
This page was built for publication: Integer linear programming models for grid-based light post location problem
