Pages that link to "Item:Q1199516"
From MaRDI portal
The following pages link to On tightening cover induced inequalities (Q1199516):
Displaying 14 items.
- Some of my favorite integer programming applications at IBM (Q537591) (← links)
- A conditional logic approach for strengthening mixed 0-1 linear programs (Q817194) (← links)
- Logical processing for integer programming (Q817209) (← links)
- Knapsack polytopes: a survey (Q827125) (← links)
- \(O(n \log n)\) procedures for tightening cover inequalities (Q1124826) (← links)
- On tightening 0-1 programs based on extensions of pure 0-1 knapsack and subset-sum problems (Q1265899) (← links)
- On using an automatic scheme for obtaining the convex hull defining inequalities of a Weismantel 0-1 knapsack constraint (Q1304779) (← links)
- On the Dietrich-Escudero approach for solving the \(0-1\) knapsack problem with a \(0-1\) objective function (Q1328610) (← links)
- Obtaining clique, cover and coefficient reduction inequalities as Chvatal-Gomory inequalities and Gomory fractional cuts (Q1328648) (← links)
- Partial cover and complete cover inequalities (Q1331885) (← links)
- Efficient reformulation for 0-1 programs -- methods and computational results (Q1803672) (← links)
- \(O(n)\) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates (Q1804563) (← links)
- A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems (Q1866008) (← links)
- Two-set inequalities for the binary knapsack polyhedra (Q6670502) (← links)
