Facility siting and integer-friendly programming
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 428255
- Application of the facility location problem to the problem of locating concentrators on an FAA microwave system
- The location of ambivalent facilities: Use of a quadratic zero-one programming algorithm
- A combined approach to solve binary multicriteria problems
- Note—Multi-Activity Facility Design and Location Problems
Cites work
- A Dual-Based Procedure for Uncapacitated Facility Location
- A Selection Problem of Shared Fixed Costs and Network Flows
- Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
- scientific article; zbMATH DE number 3891096 (Why is no real title available?)
- scientific article; zbMATH DE number 3550467 (Why is no real title available?)
- Integer Programming: Methods, Uses, Computations
- Multiobjective programming and planning
- The capacitated standard response fire protection siting problem: Deterministic and probabilistic models
- The Maximum Availability Location Problem
- The p-Median and Its Linear Programming Relaxation: An Approach to Large Problems
Cited in
(40)- 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
- Heuristic concentration and tabu search: A head to head comparison
- A branch and bound algorithm for mixed zero-one multiple objective linear programming
- A multi-objective model for locating fire stations
- A service logistics model for simultaneous siting of facilities and multiple levels of equipment
- Location, scheduling, design and integer programming
- 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
- Integer programming for urban design
- Location analysis: a synthesis and survey
- Network distance characteristics that affect computational effort in \(p\)-median location problems
- Facility location with increasing production costs
- Service allocation equity in location coverage analytics
- The complete vertex \(p\)-center problem
- 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
- A local relaxation approach for the siting of electrical substations
- An aggressive reduction scheme for the simple plant location problem
- Locating repair shops in a stochastic environment
- A linear-size zero-one programming model for the minimum spanning tree problem in planar graphs
- Location modeling for municipal solid waste facilities
- Maximizing the minimum cover probability by emergency facilities
- Optimal shrinking of the distribution chain: the facilities delocation decision
- Covering Problems
- Siting and sizing of facilities under probabilistic demands
- Hierarchical location-allocation models for congested systems
- A generalized model for locating facilities on a network with flow-based demand
- Variable neighborhood search: the power of change and simplicity
- Presolving and cutting planes for the generalized maximal covering location problem
- The classical p-median problem as a surrogate model in hub location
- Fifty years of location theory -- a selective review
- Facility location models for distribution system design
- An improved IP formulation for the uncapacitated facility location problem: capitalizing on objective function structure
- 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
- Generalized coverage: new developments in covering location models
This page was built for publication: Facility siting and integer-friendly programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1261377)
