On tightening 0-1 programs based on extensions of pure 0-1 knapsack and subset-sum problems
From MaRDI portal
Publication:1265899
DOI10.1023/A:1018973511339zbMath0910.90214MaRDI QIDQ1265899
Paolo Toth, Silvano Martello, Laureano Fernando Escudero Bueno
Publication date: 8 November 1998
Published in: Annals of Operations Research (Search for Journal in Brave)
lifting; covers; cliques; knapsack constraints; probing; variable upper bounds; 0-1 knapsack; automatic tightening of general 0-1 programs; coefficient reduction and increasing; subset-sum problems; variable covers
Related Items
A note for tightening 0-1 models, A conditional logic approach for strengthening mixed 0-1 linear programs, Logical processing for integer programming, Coefficient strengthening: a tool for reformulating mixed-integer programs, A column generation heuristic for a dynamic generalized assignment problem, On surrogating 0-1 knapsack constraints, \(O(n)\) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates, On identifying dominant cliques., On using clique overlapping for detecting knapsack constraint redundancy and infeasibility in 0-1 mixed integer programs, A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems
