Generalized Lagrange Multipliers in Integer Programming
From MaRDI portal
Publication:5633834
DOI10.1287/opre.19.1.68zbMath0226.90031OpenAlexW2091914899MaRDI QIDQ5633834
Publication date: 1971
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/48029
Related Items (10)
Solving \(0/1\) integer programs with enumeration cutting planes ⋮ Computational experience with a group theoretic integer programming algorithm ⋮ Reverse bridge theorem under constraint partition ⋮ Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes ⋮ Ordering scheduling problem in manufacturing systems ⋮ An extension of Hu's group minimization algorithm ⋮ Cutting-plane theory: Algebraic methods ⋮ Analyse de sensibilité pour les problèmes linéaires en variables 0-1 ⋮ Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems ⋮ The singly constrained assignment problem: A Lagrangian relaxation heuristic algorithm
This page was built for publication: Generalized Lagrange Multipliers in Integer Programming
