Pages that link to "Item:Q1117840"
From MaRDI portal
The following pages link to Layering strategies for creating exploitable structure in linear and integer programs (Q1117840):
Displayed 17 items.
- Use of Lagrangian decomposition in supply chain planning (Q409926) (← links)
- An homage to Joseph-Louis Lagrange and Pierre Huard (Q537596) (← links)
- A survey of dynamic network flows (Q917417) (← links)
- Reconstructing (0,1)-matrices from projections using integer programming (Q1001203) (← links)
- Using scenario trees and progressive hedging for stochastic inventory routing problems (Q1044243) (← links)
- An improved bounding procedure for the constrained assignment problem (Q1184442) (← links)
- An application of Lagrangean decomposition to the capacitated multi-item lot sizing problem (Q1260745) (← links)
- Tabu search for nonlinear and parametric optimization (with links to genetic algorithms) (Q1327232) (← links)
- Constraint aggregation principle in convex optimization (Q1356049) (← links)
- Polyhedral analysis and decompositions for capacitated plant location-type problems (Q1383369) (← links)
- Column generation applied to linear programs in course registration (Q1390289) (← links)
- Future paths for integer programming and links to artificial intelligence (Q1821034) (← links)
- An application-oriented guide for designing Lagrangean dual ascent algorithms (Q1824554) (← links)
- Lagrangean relaxation. (With comments and rejoinder). (Q1876461) (← links)
- Lagrangean decomposition: A model yielding stronger lagrangean bounds (Q3780005) (← links)
- Consistency Cuts for Dantzig-Wolfe Reformulations (Q5058051) (← links)
- A Lagrangian relaxation approach to an electricity system investment model with a high temporal resolution (Q6201541) (← links)