Pages that link to "Item:Q1762067"
From MaRDI portal
The following pages link to Fast bounding procedures for large instances of the simple plant location problem (Q1762067):
Displaying 13 items.
- An exact cooperative method for the uncapacitated facility location problem (Q495932) (← links)
- On a class of subadditive duals for the uncapacitated facility location problem (Q902981) (← links)
- On the exact solution of large-scale simple plant location problems (Q1121152) (← links)
- Upper and lower bounds for the two-level simple plant location problem (Q1290136) (← links)
- Branch and peg algorithms for the simple plant location problem. (Q1423442) (← links)
- Branch and peg algorithms for the simple plant location problem (Q1765536) (← links)
- An improved Lagrangian relaxation and dual ascent approach to facility location problems (Q1789574) (← links)
- An application of a Lagrangian-type relaxation for the uncapacitated facility location problem (Q2257610) (← links)
- An aggressive reduction scheme for the simple plant location problem (Q2514768) (← links)
- Approximation Algorithms for Generalized Plant Location (Q2849962) (← links)
- (Q3153223) (← links)
- Optimal algorithms for some inverse uncapacitated facility location problems on networks (Q5043849) (← links)
- Matheuristics: survey and synthesis (Q6056873) (← links)