Constructive Duality in Integer Programming
From MaRDI portal
Publication:4054817
DOI10.1137/0127003zbMath0299.90010OpenAlexW2008936465MaRDI QIDQ4054817
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
Related Items
Efficient group cuts for integer programs, A direct dual method for the mixed plant location problem with some side constraints, Generalized dynamic programming methods in integer programming, Improved integer programming bounds using intersections of corner polyhedra, Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method, A dual algorithm for the one-machine scheduling problem, Strong duality for a special class of integer programs, Subadditive duality in multiobjective integer linear programming, Towards strong duality in integer programming, Convergent Lagrangian and domain cut method for nonlinear knapsack problems, Cutting-plane theory: Algebraic methods, AUGMENTED LAGRANGEAN RELAXATIONS IN GENERAL MIXED INTEGER PROGRAMMING, On duality for Boolean programming, Experimental comparison of algorithms for the problem of the maximum set of pairwise incomparable vertices in a digraph, Analyse de sensibilité pour les problèmes linéaires en variables 0-1, Distance confined path problem and separable integer programming, An exact search for the solution of the surrogate dual of the 0-1 bidimensional knapsack problem, Validation of subgradient optimization
