Facility siting and integer-friendly programming
From MaRDI portal
Publication:1261377
DOI10.1016/0377-2217(93)90329-LzbMath0776.90047OpenAlexW2072803333MaRDI QIDQ1261377
Publication date: 16 September 1993
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(93)90329-l
branch-and-boundinteger linear programminglocation analysismulti-objective zero-one programmingfacility siting on networks
Programming involving graphs or networks (90C35) Integer programming (90C10) Multi-objective and goal programming (90C29) Linear programming (90C05) Discrete location and assignment (90B80)
Related Items (33)
A service logistics model for simultaneous siting of facilities and multiple levels of equipment ⋮ Logistics distribution centers location problem and algorithm under fuzzy environment ⋮ BEAMR: an exact and approximate model for the \(p\)-median problem ⋮ Optimal reserve site selection with distance requirements ⋮ Location modeling for municipal solid waste facilities ⋮ A note on duality gap in the simple plant location problem ⋮ Locating landfills--optimization vs. reality ⋮ The directional \(p\)-median problem: definition, complexity, and algorithms ⋮ A generalized model for locating facilities on a network with flow-based demand ⋮ Variable neighborhood search: the power of change and simplicity ⋮ Location models for airline hubs behaving as \(M/D/c\) queues. ⋮ Benders decomposition for very large scale partial set covering and maximal covering location problems ⋮ The complete vertex \(p\)-center problem ⋮ Maximizing the minimum cover probability by emergency facilities ⋮ Generalized coverage: new developments in covering location models ⋮ Facility location models for distribution system design ⋮ A linear-size zero?one programming model for the minimum spanning tree problem in planar graphs ⋮ Location analysis: a synthesis and survey ⋮ Hierarchical location-allocation models for congested systems ⋮ An aggressive reduction scheme for the simple plant location problem ⋮ Integer-friendly formulations for the \(r\)-separation problem ⋮ Heuristic concentration: Two stage solution construction ⋮ Solving the plant location problem on a line by linear programming ⋮ Optimal shrinking of the distribution chain: the facilities delocation decision ⋮ Heuristic concentration and tabu search: A head to head comparison ⋮ Service allocation equity in location coverage analytics ⋮ A branch and bound algorithm for mixed zero-one multiple objective linear programming ⋮ Network distance characteristics that affect computational effort in \(p\)-median location problems ⋮ Covering Problems ⋮ A multi-objective model for locating fire stations ⋮ Locating repair shops in a stochastic environment ⋮ Facility location with increasing production costs ⋮ An improved IP formulation for the uncapacitated facility location problem: capitalizing on objective function structure
Cites Work
- Unnamed Item
- Unnamed Item
- The capacitated standard response fire protection siting problem: Deterministic and probabilistic models
- Multiobjective programming and planning
- Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
- The p-Median and Its Linear Programming Relaxation: An Approach to Large Problems
- A Dual-Based Procedure for Uncapacitated Facility Location
- The Maximum Availability Location Problem
- Integer Programming: Methods, Uses, Computations
- A Selection Problem of Shared Fixed Costs and Network Flows
This page was built for publication: Facility siting and integer-friendly programming
