Pages that link to "Item:Q920004"
From MaRDI portal
The following pages link to A method for solving to optimality uncapacitated location problems (Q920004):
Displaying 31 items.
- An exact cooperative method for the uncapacitated facility location problem (Q495932) (← links)
- An improved IP formulation for the uncapacitated facility location problem: capitalizing on objective function structure (Q816402) (← links)
- A hybrid multistart heuristic for the uncapacitated facility location problem (Q858329) (← links)
- On a class of subadditive duals for the uncapacitated facility location problem (Q902981) (← links)
- A projection method for the uncapacitated facility location problem (Q918404) (← links)
- Solving to optimality the uncapacitated fixed-charge network flow problem (Q1265864) (← links)
- Massively parallel analog tabu search using neural networks applied to simple plant location problems (Q1268165) (← links)
- Exact sequential choice of locations in a network (Q1290143) (← links)
- Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem (Q1290717) (← links)
- Algorithms for a multi-level network optimization problem (Q1307817) (← links)
- Uncapacitated facility location: General solution procedure and computational experience (Q1333489) (← links)
- A heuristic for large-size \(p\)-median location problems with application to school location (Q1339149) (← links)
- An improved branch \& bound method for the uncapacitated competitive location problem (Q1413748) (← links)
- An exact method for the two-echelon, single-source, capacitated facility location problem (Q1572966) (← links)
- A hierarchical model for the location of perinatal facilities in the municipality of Rio de Janeiro (Q1600932) (← links)
- Solving the bilevel facility location problem under preferences by a Stackelberg-evolutionary algorithm (Q1718374) (← links)
- Location analysis: a synthesis and survey (Q1776950) (← links)
- Lagrangean heuristics for location problems (Q1804069) (← links)
- Exact solution methods for uncapacitated location problems with convex transportation costs (Q1809831) (← links)
- An application of a Lagrangian-type relaxation for the uncapacitated facility location problem (Q2257610) (← links)
- Capacitated facility location problem with general setup cost (Q2496021) (← links)
- An aggressive reduction scheme for the simple plant location problem (Q2514768) (← links)
- Experiments with primal - dual decomposition and subgradient methods for the uncapacitatied facility location problem (Q2743665) (← links)
- Solving a class of two-dimensional uncapacitated location-allocation problems by dynamic programming (Q2770100) (← links)
- Using logic-based Benders decomposition to solve the capacity- and distance-constrained plant location problem (Q2815453) (← links)
- Solving large-scale uncapacitated facility location problems with evolutionary simulated annealing (Q3430250) (← links)
- The Location of Public Schools: Evaluation of Practical Experiences (Q4368596) (← links)
- Lagrangean Relaxation-Based Techniques for Solving Facility Location Problems (Q5506732) (← links)
- Affinity propagation and uncapacitated facility location problems (Q5964469) (← links)
- Matheuristics: survey and synthesis (Q6056873) (← links)
- RAMP experiments in solving the uncapacitated facility location problem (Q6496425) (← links)