Constructive Duality in Integer Programming

DOI10.1137/0127003MaRDI QIDQ4054817zbMATH OpenOpenAlexFDO

Authors Marshall L. Fisher, Jeremy F. Shapiro

Publication date 1974

Published in SIAM Journal on Applied Mathematics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Integer programming (90C10)

Cited in

(18)

• Generalized dynamic programming methods in integer programming
• Strong duality for a special class of integer programs
• A dual algorithm for the one-machine scheduling problem
• Efficient group cuts for integer programs
• Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method
• Convergent Lagrangian and domain cut method for nonlinear knapsack problems
• Improved integer programming bounds using intersections of corner polyhedra
• Subadditive duality in multiobjective integer linear programming
• On duality for Boolean programming
• Cutting-plane theory: Algebraic methods
• An exact search for the solution of the surrogate dual of the 0-1 bidimensional knapsack problem
• A direct dual method for the mixed plant location problem with some side constraints
• AUGMENTED LAGRANGEAN RELAXATIONS IN GENERAL MIXED INTEGER PROGRAMMING
• Experimental comparison of algorithms for the problem of the maximum set of pairwise incomparable vertices in a digraph
• Distance confined path problem and separable integer programming
• Analyse de sensibilité pour les problèmes linéaires en variables 0-1
• Towards strong duality in integer programming
• Validation of subgradient optimization

This page was built for publication: Constructive Duality in Integer Programming

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