Pages that link to "Item:Q2640440"
From MaRDI portal
The following pages link to Lagrangean dual ascent algorithms for computing bounds in capacitated plant location problems (Q2640440):
Displaying 16 items.
- Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing (Q750288) (← links)
- A Lagrangean dual ascent algorithm for simple plant location problems (Q911446) (← links)
- Analysis of relaxations for the multi-item capacitated lot-sizing problem (Q922259) (← links)
- Lagrangean duals and exact solution to the capacitated \(p\)-center problem (Q1044136) (← links)
- Lagrangian dual ascent by generalized linear programming (Q1123118) (← links)
- An application of Lagrangean decomposition to the capacitated multi-item lot sizing problem (Q1260745) (← links)
- The capacitated distribution and waste disposal problem (Q1266619) (← links)
- Polyhedral analysis and decompositions for capacitated plant location-type problems (Q1383369) (← links)
- A multiperiod two-echelon multicommodity capacitated plant location problem (Q1569931) (← links)
- Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type (Q1809805) (← links)
- An application-oriented guide for designing Lagrangean dual ascent algorithms (Q1824554) (← links)
- Errata and comments on ``Approximation algorithms for the capacitated plant allocation problem'' (Q1919191) (← links)
- Dynamic supply chain design with inventory (Q2384884) (← links)
- Bounds for the single source modular capacitated plant location problem (Q2489136) (← links)
- Lagrangean decomposition: A model yielding stronger lagrangean bounds (Q3780005) (← links)
- RAMP experiments in solving the uncapacitated facility location problem (Q6496425) (← links)
