Pages that link to "Item:Q3869083"

The following pages link to (1,k)-configurations and facets for packing problems (Q3869083):

Displaying 33 items.

• A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: facet-defining inequalities by sequential lifting (Q429688) (← links)
• The precedence constrained knapsack problem: separating maximally violated inequalities (Q494425) (← links)
• Minimal covers, minimal sets and canonical facets of the posynomial knapsack polytope (Q761350) (← links)
• Cover and pack inequalities for (mixed) integer programming (Q817174) (← links)
• Knapsack polytopes: a survey (Q827125) (← links)
• Sequence independent lifting for mixed knapsack problems with GUB constraints (Q896279) (← links)
• Convex hulls of superincreasing knapsacks and lexicographic orderings (Q908302) (← links)
• The generalized assignment problem: Valid inequalities and facets (Q909579) (← links)
• Facet defining inequalities for the dichotomous knapsack problem (Q911989) (← links)
• The submodular knapsack polytope (Q1040079) (← links)
• Valid inequalities for mixed 0-1 programs (Q1076609) (← links)
• Facets of the knapsack polytope derived from disjoint and overlapping index configurations (Q1103523) (← links)
• Facets and lifting procedures for the set covering polytope (Q1123808) (← links)
• A note on the knapsack problem with special ordered sets (Q1168894) (← links)
• A characterization of knapsacks with the max-flow--min-cut property (Q1197887) (← links)
• The maximum clique problem (Q1318271) (← links)
• The multidimensional 0-1 knapsack problem: an overview. (Q1428041) (← links)
• A polyhedral study on 0-1 knapsack problems with set packing constraints (Q1785756) (← links)
• A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems (Q1866008) (← links)
• A new extended formulation of the generalized assignment problem and some associated valid inequalities (Q2009013) (← links)
• A new extended formulation with valid inequalities for the capacitated concentrator location problem (Q2029271) (← links)
• Multi-cover inequalities for totally-ordered multiple knapsack sets (Q2061876) (← links)
• On the complexity of separation from the knapsack polytope (Q2164691) (← links)
• Separation algorithms for 0-1 knapsack polytopes (Q2638369) (← links)
• Multi-cover inequalities for totally-ordered multiple knapsack sets: theory and computation (Q2689829) (← links)
• Valid inequalities, cutting planes and integrality of the knapsack polytope (Q3101539) (← links)
• Some integer programs arising in the design of main frame computers (Q3135915) (← links)
• Polyhedral techniques in combinatorial optimization I: Theory (Q4715790) (← links)
• On facet-inducing inequalities for combinatorial polytopes (Q5374012) (← links)
• Classical cuts for mixed-integer programming and branch-and-cut (Q5896802) (← links)
• Discrete relaxations of combinatorial programs (Q5946814) (← links)
• New classes of facets for complementarity knapsack problems (Q6585265) (← links)
• On the complexity of separating cutting planes for the knapsack polytope (Q6589743) (← links)