Pages that link to "Item:Q829120"

The following pages link to On the complexity of sequentially lifting cover inequalities for the knapsack polytope (Q829120):

Displaying 10 items.

• A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: facet-defining inequalities by sequential lifting (Q429688) (← links)
• On separating cover inequalities for the multidimensional knapsack problem (Q858283) (← links)
• Convex hulls of superincreasing knapsacks and lexicographic orderings (Q908302) (← links)
• The complexity of lifted inequalities for the knapsack problem (Q1201098) (← links)
• The complexity of cover inequality separation (Q1306471) (← links)
• Lift-and-project methods for set cover and knapsack (Q1799231) (← links)
• Simple lifted cover inequalities and hard knapsack problems (Q2581317) (← links)
• Lifting the knapsack cover inequalities for the knapsack polytope (Q2661529) (← links)
• Lifting for the integer knapsack cover polyhedron (Q6102182) (← links)
• Two-set inequalities for the binary knapsack polyhedra (Q6670502) (← links)