Pages that link to "Item:Q429688"

The following pages link to A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: facet-defining inequalities by sequential lifting (Q429688):

Displaying 9 items.

• A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: strong valid inequalities by sequence-independent lifting (Q429687) (← links)
• Knapsack polytopes: a survey (Q827125) (← links)
• A polyhedral study on 0-1 knapsack problems with set packing constraints (Q1785756) (← links)
• Optimization algorithms for the disjunctively constrained knapsack problem (Q1797814) (← links)
• On cutting planes for cardinality-constrained linear programs (Q2330656) (← links)
• Cover by disjoint cliques cuts for the knapsack problem with conflicting items (Q2670441) (← links)
• Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON (Q4637830) (← links)
• Lifting convex inequalities for bipartite bilinear programs (Q5918426) (← links)
• Lifting convex inequalities for bipartite bilinear programs (Q5925639) (← links)