Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes
From MaRDI portal
Publication:1972019
DOI10.1016/S0377-2217(99)00056-9zbMath0949.90067MaRDI QIDQ1972019
Publication date: 23 March 2000
Published in: European Journal of Operational Research (Search for Journal in Brave)
Related Items
Stage- and scenario-wise Fenchel decomposition for stochastic mixed 0-1 programs with special structure ⋮ Fenchel decomposition for stochastic mixed-integer programming ⋮ Integer set reduction for stochastic mixed-integer programming ⋮ Lagrangian relaxation of the generic materials and operations planning model
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient cuts in Lagrangean `relax-and-cut' schemes
- MINTO, a Mixed INTeger Optimizer
- Generating cuts from surrogate constraint analysis for zero-one and multiple choice programming
- Incorporating facet-inducing inequalities into graphical-construct-based Lagrangian relaxation methodologies
- Solving Large-Scale Zero-One Linear Programming Problems
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- Using Surrogate Constraints in a Lagrangian Relaxation Approach to Set-Covering Problems
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- A Survey of Lagrangean Techniques for Discrete Optimization
- Generating Fenchel Cutting Planes for Knapsack Polyhedra
- Fenchel Cutting Planes for Integer Programs
- Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
- Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
- Polyhedral techniques in combinatorial optimization I: Theory
- Validation of subgradient optimization
- On the Convergence of Fenchel Cutting Planes in Mixed-Integer Programming
- Generalized Lagrange Multipliers in Integer Programming
