Surrogate duality in a branch-and-bound procedure for integer programming

DOI10.1016/0377-2217(88)90176-2zbMath0638.90072OpenAlexW2012394102MaRDI QIDQ1099783

Sanjiv Sarin, Mark H. Karwan, Ronald L. Rardin

Publication date: 1988

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(88)90176-2

zbMATH Keywords

branch-and-boundLagrangean search methodsmulticonstraint knapsack problemssurrogate dual multiplierssurrogate dual values

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10)

Related Items

An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem, A computational evaluation of two subgradient search methods, A trust region method for the solution of the surrogate dual in integer programming, A solution procedure for general knapsack problems with a few constraints, On zero duality gap in surrogate constraint optimization: the case of rational-valued functions of constraints, Zero duality gap in surrogate constraint optimization: a concise review of models, Surrogate gradient algorithm for Lagrangian relaxation, On generalized surrogate duality in mixed-integer nonlinear programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Surrogate Dual Multiplier Search Procedures in Integer Programming
• Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
• Some relationships between lagrangian and surrogate duality in integer programming
• New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem
• Calculating surrogate constraints
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Surrogate Constraint Duality in Mathematical Programming
• Technical Note—An Implementation of Surrogate Constraint Duality
• A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
• An Improved Implicit Enumeration Approach for Integer Programming
• An Additive Algorithm for Solving Linear Programs with Zero-One Variables
• Surrogate Mathematical Programming