Pages that link to "Item:Q4895625"

The following pages link to Solving Multiple Knapsack Problems by Cutting Planes (Q4895625):

Displaying 27 items.

• A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: facet-defining inequalities by sequential lifting (Q429688) (← links)
• Branch-and-cut-and-price for capacitated connected facility location (Q662139) (← links)
• Cutting planes in integer and mixed integer programming (Q697578) (← links)
• Knapsack polytopes: a survey (Q827125) (← links)
• LP based heuristics for the multiple knapsack problem with assignment restrictions (Q863573) (← links)
• Cutting plane algorithms for \(0-1\) programming based on cardinality cuts (Q976440) (← links)
• The node capacitated graph partitioning problem: A computational study (Q1290618) (← links)
• The complexity of cover inequality separation (Q1306471) (← links)
• Polynomial time approximation schemes for class-constrained packing problems (Q1348737) (← links)
• Upper bounds and algorithms for the maximum cardinality bin packing problem. (Q1399594) (← links)
• An effective hybrid approach to the two-stage capacitated facility location problem (Q1713740) (← links)
• Valid inequalities for the multi-dimensional multiple-choice 0-1 knapsack problem (Q1751116) (← links)
• Mathematical models and decomposition methods for the multiple knapsack problem (Q1755383) (← links)
• A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems (Q1866008) (← links)
• A cut-and-solve based algorithm for the single-source capacitated facility location problem (Q1926885) (← links)
• A moment based metric for 2-D and 3-D packing (Q1971998) (← links)
• The multiple multidimensional knapsack with family-split penalties (Q2029273) (← links)
• On the complexity of separation from the knapsack polytope (Q2164691) (← links)
• Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem (Q2462108) (← links)
• Projection results for vehicle routing (Q2583125) (← links)
• Separation algorithms for 0-1 knapsack polytopes (Q2638369) (← links)
• Multi-cover inequalities for totally-ordered multiple knapsack sets: theory and computation (Q2689829) (← links)
• A continuous approch for globally solving linearly constrained quadratic (Q2767579) (← links)
• Cover inequalities for robust knapsack sets-Application to the robust bandwidth packing problem (Q2892146) (← links)
• Probabilistic Model of Ant Colony Optimization for Multiple Knapsack Problem (Q3616856) (← links)
• An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating (Q5139608) (← links)
• A decomposition approach for multidimensional knapsacks with family‐split penalties (Q6195028) (← links)