A Convergent Duality Theory for Integer Programming
From MaRDI portal
Publication:4161087
DOI10.1287/opre.25.3.419zbMath0381.90079MaRDI QIDQ4161087
David E. Bell, Jeremy F. Shapiro
Publication date: 1977
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.25.3.419
Related Items
Multiple cost coefficients sensitivity theorems of integer linear optimization, Non-standard approaches to integer programming, A transformation of hard (equality constrained) knapsack problems into constrained shortest path problems, Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method, Convergent Lagrangian and domain cut method for nonlinear knapsack problems, Symmetric duality for disjunctive programming with absolute value functionals, Constructive dual methods for discrete programming, Convergent duality for the traveling salesman problem, Theoretical challenges towards cutting-plane selection, A nonlinear Lagrangian dual for integer programming, Towards strong duality in integer programming, Generalized nonlinear Lagrangian formulation for bounded integer programming, Subadditive duality in multiobjective integer linear programming, Distance confined path problem and separable integer programming, Metodos Duales y algoritmos hibridos para problemas de «Set Partitioning», Efficient group cuts for integer programs, Integer programming duality: Price functions and sensitivity analysis