Pages that link to "Item:Q911446"
From MaRDI portal
The following pages link to A Lagrangean dual ascent algorithm for simple plant location problems (Q911446):
Displaying 26 items.
- Semi-Lagrangian relaxation applied to the uncapacitated facility location problem (Q434153) (← links)
- A simple tabu search for warehouse location (Q703910) (← links)
- Facility location models for distribution system design (Q707128) (← links)
- A note on duality gap in the simple plant location problem (Q858326) (← 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)
- On the exact solution of large-scale simple plant location problems (Q1121152) (← links)
- Lagrangian dual ascent by generalized linear programming (Q1123118) (← links)
- Massively parallel analog tabu search using neural networks applied to simple plant location problems (Q1268165) (← links)
- Upper and lower bounds for the two-level simple plant location problem (Q1290136) (← links)
- Lagrangean heuristics for location problems (Q1804069) (← links)
- An application-oriented guide for designing Lagrangean dual ascent algorithms (Q1824554) (← links)
- An application of a Lagrangian-type relaxation for the uncapacitated facility location problem (Q2257610) (← links)
- COAL: A new heuristic approach for solving the fixed charge problem - computational results (Q2277365) (← links)
- Two-phase semi-Lagrangian relaxation for solving the uncapacitated distribution centers location problem for B2C E-commerce (Q2419538) (← links)
- A simple filter-and-fan approach to the facility location problem (Q2489306) (← links)
- Capacitated facility location problem with general setup cost (Q2496021) (← links)
- Lagrangean dual ascent algorithms for computing bounds in capacitated plant location problems (Q2640440) (← links)
- Solving the simple plant location problem by genetic algorithm (Q2765605) (← links)
- (Q3153223) (← links)
- Solving large-scale uncapacitated facility location problems with evolutionary simulated annealing (Q3430250) (← links)
- Lagrangean decomposition: A model yielding stronger lagrangean bounds (Q3780005) (← links)
- FEASIBLE REGION REDUCTION CUTS FOR THE SIMPLE PLANT LOCATION PROBLEM (Q4347340) (← links)
- A Lagrangean heuristic for the plant location problem with multiple facilities in the same site (Q4405938) (← links)
- Lagrangean Relaxation-Based Techniques for Solving Facility Location Problems (Q5506732) (← links)
- Matheuristics: survey and synthesis (Q6056873) (← links)