Surrogate Constraints in Integer Programming

DOI10.1080/02522667.1991.10699064zbMath0738.90056OpenAlexW2324533234MaRDI QIDQ3976935

Hasan Pirkul, Fred Glover, Bezalel Gavish

Publication date: 25 June 1992

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02522667.1991.10699064

zbMATH Keywords

multiple constraint knapsack problemssurrogate constraint multipliers

Mathematics Subject Classification ID

Integer programming (90C10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Zero duality gap in surrogate constraint optimization: a concise review of models, Surrogate constraint normalization for the set covering problem, Zero duality gap in integer programming: \(P\)-norm surrogate constraint method, A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems, Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems

Cites Work

• Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
• A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
• Surrogate Mathematical Programming