Pages that link to "Item:Q3780005"
From MaRDI portal
The following pages link to Lagrangean decomposition: A model yielding stronger lagrangean bounds (Q3780005):
Displaying 17 items.
- The Multicommodity Multilevel Bottleneck Assignment Problem (Q3439124) (← links)
- COLLABORATIVE PLANNING IN SUPPLY CHAINS BY LAGRANGIAN RELAXATION AND GENETIC ALGORITHMS (Q3528990) (← links)
- Challenges in Enterprise Wide Optimization for the Process Industries (Q3638498) (← links)
- Modeling and Managing Uncertainty in Process Planning and Scheduling (Q3638500) (← links)
- Designing a minimal spanning tree network subject to a budget constraint (Q3799839) (← links)
- Heuristics for the multi-resource generalized assignment problem (Q4544217) (← links)
- A CONVEX SUBMODEL WITH APPLICATION TO SYSTEM DESIGN (Q4650616) (← links)
- Consistency Cuts for Dantzig-Wolfe Reformulations (Q5058051) (← links)
- Coordination between strategic forest management and tactical logistic and production planning in the forestry supply chain (Q5175836) (← links)
- The multi-hour service system design problem (Q5925868) (← links)
- Polyhedral results and stronger Lagrangean bounds for stable spanning trees (Q6110626) (← links)
- Scalable timing-aware network design via Lagrangian decomposition (Q6112744) (← links)
- Refinement of Lagrangian bounds in optimization problems (Q6122370) (← links)
- Inexact penalty decomposition methods for optimization problems with geometric constraints (Q6133301) (← links)
- A Lagrangian relaxation approach to an electricity system investment model with a high temporal resolution (Q6201541) (← links)
- Experimentation with Benders decomposition for solving the two-timescale stochastic generation capacity expansion problem (Q6491325) (← links)
- A comparison of alternative models for solving a non-linear single plant hydro unit commitment problem (Q6561239) (← links)
