Layering strategies for creating exploitable structure in linear and integer programs
From MaRDI portal
Recommendations
- Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs
- Improved Lagrangean decomposition: An application to the generalized assignment problem
- scientific article; zbMATH DE number 1312984
- On some difficult linear programs coming from set partitioning
- A decomposition technique for mixed integer programming problems
Cites work
- scientific article; zbMATH DE number 3862960 (Why is no real title available?)
- scientific article; zbMATH DE number 3876888 (Why is no real title available?)
- scientific article; zbMATH DE number 3791942 (Why is no real title available?)
- scientific article; zbMATH DE number 3307136 (Why is no real title available?)
- A Lagrangean Relaxation Algorithm for the Two Duty Period Scheduling Problem
- A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees
- An Almost Linear-Time Algorithm for Graph Realization
- An efficient PQ-graph algorithm for solving the graph-realization problem
- Computational comparison of two solution procedures for allocation/processing networks
- Converting Linear Programs to Network Problems
- Extracting embedded generalized networks from linear programming problems
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- Optimal Multi-Level Lot Sizing for Requirements Planning Systems
- Surrogate Constraints
- Technical Note—Equivalence of the 0-1 Integer Programming Problem to Discrete Generalized and Pure Networks
- The equal flow problem
- Validation of subgradient optimization
Cited in
(19)- Constraint aggregation principle in convex optimization
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- An homage to Joseph-Louis Lagrange and Pierre Huard
- Column generation applied to linear programs in course registration
- Use of Lagrangian decomposition in supply chain planning
- An application-oriented guide for designing Lagrangean dual ascent algorithms
- Consistency cuts for Dantzig-Wolfe reformulations
- Polyhedral analysis and decompositions for capacitated plant location-type problems
- Future paths for integer programming and links to artificial intelligence
- Reconstructing (0,1)-matrices from projections using integer programming
- Lagrangean relaxation. (With comments and rejoinder).
- A Lagrangian relaxation approach to an electricity system investment model with a high temporal resolution
- An improved bounding procedure for the constrained assignment problem
- A survey of dynamic network flows
- Using scenario trees and progressive hedging for stochastic inventory routing problems
- Improved Lagrangean decomposition: An application to the generalized assignment problem
- Tabu search for nonlinear and parametric optimization (with links to genetic algorithms)
- An application of Lagrangean decomposition to the capacitated multi-item lot sizing problem
- A note on splitting of variables in integer programming models
This page was built for publication: Layering strategies for creating exploitable structure in linear and integer programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1117840)
