Generalized Lagrange Multipliers in Integer Programming

DOI10.1287/OPRE.19.1.68MaRDI QIDQ5633834zbMATH OpenOpenAlexFDO

Authors Jeremy F. Shapiro

Publication date 1971

Published in Operations Research (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/1721.1/48029

Mathematics Subject Classification ID

Integer programming (90C10)

Cited in

(10)

• An extension of Hu's group minimization algorithm
• Cutting-plane theory: Algebraic methods
• The singly constrained assignment problem: A Lagrangian relaxation heuristic algorithm
• Solving \(0/1\) integer programs with enumeration cutting planes
• Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems
• Reverse bridge theorem under constraint partition
• Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes
• Ordering scheduling problem in manufacturing systems
• Analyse de sensibilité pour les problèmes linéaires en variables 0-1
• Computational experience with a group theoretic integer programming algorithm

This page was built for publication: Generalized Lagrange Multipliers in Integer Programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5633834)