Pages that link to "Item:Q1265899"

The following pages link to On tightening 0-1 programs based on extensions of pure 0-1 knapsack and subset-sum problems (Q1265899):

Displayed 10 items.

• A conditional logic approach for strengthening mixed 0-1 linear programs (Q817194) ‎ (← links)
• Logical processing for integer programming (Q817209) ‎ (← links)
• Coefficient strengthening: a tool for reformulating mixed-integer programs (Q847848) ‎ (← links)
• A column generation heuristic for a dynamic generalized assignment problem (Q1010279) ‎ (← links)
• On surrogating 0-1 knapsack constraints (Q1304781) ‎ (← links)
• \(O(n)\) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates (Q1804563) ‎ (← links)
• On identifying dominant cliques. (Q1811147) ‎ (← links)
• On using clique overlapping for detecting knapsack constraint redundancy and infeasibility in 0-1 mixed integer programs (Q1814812) ‎ (← links)
• A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems (Q1866008) ‎ (← links)
• A note for tightening 0-1 models (Q5937145) ‎ (← links)