Pages that link to "Item:Q1261377"
From MaRDI portal
The following pages link to Facility siting and integer-friendly programming (Q1261377):
Displayed 33 items.
- Location modeling for municipal solid waste facilities (Q337671) (← links)
- Maximizing the minimum cover probability by emergency facilities (Q512997) (← links)
- A generalized model for locating facilities on a network with flow-based demand (Q613557) (← links)
- Facility location models for distribution system design (Q707128) (← links)
- An improved IP formulation for the uncapacitated facility location problem: capitalizing on objective function structure (Q816402) (← links)
- A note on duality gap in the simple plant location problem (Q858326) (← links)
- Locating landfills--optimization vs. reality (Q864021) (← links)
- The directional \(p\)-median problem: definition, complexity, and algorithms (Q864030) (← links)
- Generalized coverage: new developments in covering location models (Q976025) (← links)
- Integer-friendly formulations for the \(r\)-separation problem (Q1268268) (← links)
- Heuristic concentration: Two stage solution construction (Q1278583) (← links)
- Solving the plant location problem on a line by linear programming (Q1284603) (← links)
- Heuristic concentration and tabu search: A head to head comparison (Q1291635) (← links)
- A branch and bound algorithm for mixed zero-one multiple objective linear programming (Q1296117) (← links)
- A multi-objective model for locating fire stations (Q1303572) (← links)
- A service logistics model for simultaneous siting of facilities and multiple levels of equipment (Q1342332) (← links)
- Location models for airline hubs behaving as \(M/D/c\) queues. (Q1423443) (← links)
- Benders decomposition for very large scale partial set covering and maximal covering location problems (Q1719620) (← links)
- Location analysis: a synthesis and survey (Q1776950) (← links)
- Network distance characteristics that affect computational effort in \(p\)-median location problems (Q1841151) (← links)
- Facility location with increasing production costs (Q1869420) (← links)
- Service allocation equity in location coverage analytics (Q2083924) (← links)
- The complete vertex \(p\)-center problem (Q2219518) (← links)
- Logistics distribution centers location problem and algorithm under fuzzy environment (Q2381618) (← links)
- BEAMR: an exact and approximate model for the \(p\)-median problem (Q2384887) (← links)
- Optimal reserve site selection with distance requirements (Q2384898) (← links)
- An aggressive reduction scheme for the simple plant location problem (Q2514768) (← links)
- Locating repair shops in a stochastic environment (Q2581600) (← links)
- A linear-size zero?one programming model for the minimum spanning tree problem in planar graphs (Q2782732) (← links)
- Optimal shrinking of the distribution chain: the facilities delocation decision (Q5494701) (← links)
- Covering Problems (Q5506721) (← links)
- Hierarchical location-allocation models for congested systems (Q5954837) (← links)
- Variable neighborhood search: the power of change and simplicity (Q6164603) (← links)
