Solving Multiple Knapsack Problems by Cutting Planes
From MaRDI portal
Publication:4895625
DOI10.1137/S1052623493254455zbMath0856.90082OpenAlexW2031595762MaRDI QIDQ4895625
Alexander Martin, Robert Weismantel, Carlos E. Ferreira
Publication date: 3 February 1997
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1052623493254455
branch and cutcutting plane algorithmmultiple knapsack problemlayout of electronic circuitsdesign of main frame computers
Related Items
Knapsack polytopes: a survey, Cover inequalities for robust knapsack sets-Application to the robust bandwidth packing problem, Polynomial time approximation schemes for class-constrained packing problems, Separation algorithms for 0-1 knapsack polytopes, LP based heuristics for the multiple knapsack problem with assignment restrictions, On the complexity of separation from the knapsack polytope, A cut-and-solve based algorithm for the single-source capacitated facility location problem, Upper bounds and algorithms for the maximum cardinality bin packing problem., Multi-cover inequalities for totally-ordered multiple knapsack sets: theory and computation, A decomposition approach for multidimensional knapsacks with family‐split penalties, A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: facet-defining inequalities by sequential lifting, An effective hybrid approach to the two-stage capacitated facility location problem, An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating, A moment based metric for 2-D and 3-D packing, Branch-and-cut-and-price for capacitated connected facility location, Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem, Valid inequalities for the multi-dimensional multiple-choice 0-1 knapsack problem, Mathematical models and decomposition methods for the multiple knapsack problem, Cutting planes in integer and mixed integer programming, A continuous approch for globally solving linearly constrained quadratic, Cutting plane algorithms for \(0-1\) programming based on cardinality cuts, The multiple multidimensional knapsack with family-split penalties, Probabilistic Model of Ant Colony Optimization for Multiple Knapsack Problem, The node capacitated graph partitioning problem: A computational study, The complexity of cover inequality separation, Projection results for vehicle routing, A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems
