On surrogating 0-1 knapsack constraints

DOI10.1007/BF02564717zbMath0957.90090MaRDI QIDQ1304781

M. Teresa Ortuño, Ma. Carmen Martínez, Laureano Fernando Escudero Bueno

Publication date: 23 November 1999

Published in: Top (Search for Journal in Brave)

zbMATH Keywords

complementary-slacknesssurrogate constraintsvalid cutstightening

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Boolean programming (90C09)

Uses Software

• MINTO

Cites Work

• Unnamed Item
• On tightening 0-1 programs based on extensions of pure 0-1 knapsack and subset-sum problems
• Obtaining clique, cover and coefficient reduction inequalities as Chvatal-Gomory inequalities and Gomory fractional cuts
• MINTO, a Mixed INTeger Optimizer
• Efficient reformulation for 0-1 programs -- methods and computational results
• Edmonds polytopes and a hierarchy of combinatorial problems
• Outline of an algorithm for integer solutions to linear programs
• Surrogate Constraint Duality in Mathematical Programming
• Preprocessing and Probing Techniques for Mixed Integer Programming Problems
• Surrogate Mathematical Programming