Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes
type: Item
instance of: scholarly article
title: Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes
zbMATH Open document ID: 0949.90067
DOI: 10.1016/S0377-2217(99)00056-9
author: Jesús Sáez
published in: European Journal of Operational Research
publication date: 2000-03-23T00:00:00Z
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 1423598
zbMATH Keywords: linear programming relaxations
zbMATH Keywords: Fenchel cutting planes
zbMATH Keywords: Lagrangean relaxation
describes a project that uses: LINDO
describes a project that uses: MIPLIB
describes a project that uses: CPLEX
describes a project that uses: MINTO
MaRDI profile type: Publication
cites work: Polyhedral techniques in combinatorial optimization I: Theory
cites work: Incorporating facet-inducing inequalities into graphical-construct-based Lagrangian relaxation methodologies
cites work: Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
cites work: Q4495496
cites work: Generating Fenchel Cutting Planes for Knapsack Polyhedra
cites work: Fenchel Cutting Planes for Integer Programs
cites work: On the Convergence of Fenchel Cutting Planes in Mixed-Integer Programming
cites work: Solving Large-Scale Zero-One Linear Programming Problems
cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems
cites work: Q4178782
cites work: Generating cuts from surrogate constraint analysis for zero-one and multiple choice programming
cites work: Efficient cuts in Lagrangean `relax-and-cut' schemes
cites work: Lagrangean decomposition: A model yielding stronger lagrangean bounds
cites work: Q5187226
cites work: Validation of subgradient optimization
cites work: Using Surrogate Constraints in a Lagrangian Relaxation Approach to Set-Covering Problems
cites work: Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
cites work: Q4231138
cites work: Q3993418
cites work: MINTO, a Mixed INTeger Optimizer
cites work: Q4040221
cites work: Q4040299
cites work: Generalized Lagrange Multipliers in Integer Programming
cites work: A Survey of Lagrangean Techniques for Discrete Optimization
cites work: Q3968756
cites work: Q3995531
cites work: Q3137910
description: scientific article; zbMATH DE number 1423598