Solving Multiple Knapsack Problems by Cutting Planes

DOI10.1137/S1052623493254455MaRDI QIDQ4895625zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

branch and cutcutting plane algorithmmultiple knapsack problemlayout of electronic circuitsdesign of main frame computers

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10)

Recommendations

• scientific article; zbMATH DE number 833409
• An exact algorithm for the fixed-charge multiple knapsack problem
• Cutting planes for mixed-integer knapsack polyhedra
• A cutting plane method for knapsack polytope
• scientific article; zbMATH DE number 4055375

Cited in

(33)

• An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating
• A cutting plane method for knapsack polytope
• Multi-cover inequalities for totally-ordered multiple knapsack sets: theory and computation
• LP based heuristics for the multiple knapsack problem with assignment restrictions
• Cutting plane algorithms for \(0-1\) programming based on cardinality cuts
• Knapsack polytopes: a survey
• Valid inequalities for the multi-dimensional multiple-choice 0-1 knapsack problem
• A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: facet-defining inequalities by sequential lifting
• Probabilistic Model of Ant Colony Optimization for Multiple Knapsack Problem
• The complexity of cover inequality separation
• On the complexity of separating cutting planes for the knapsack polytope
• Mathematical models and decomposition methods for the multiple knapsack problem
• Polynomial time approximation schemes for class-constrained packing problems
• Upper bounds and algorithms for the maximum cardinality bin packing problem.
• A continuous approch for globally solving linearly constrained quadratic
• On the complexity of separation from the knapsack polytope
• The multiple multidimensional knapsack with family-split penalties
• scientific article; zbMATH DE number 719668 (Why is no real title available?)
• A decomposition approach for multidimensional knapsacks with family‐split penalties
• Global optimization and multi knapsack: a percolation algorithm.
• Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem
• A moment based metric for 2-D and 3-D packing
• Separation algorithms for 0-1 knapsack polytopes
• Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions
• A cut-and-solve based algorithm for the single-source capacitated facility location problem
• Branch-and-cut-and-price for capacitated connected facility location
• The node capacitated graph partitioning problem: A computational study
• Cutting planes in integer and mixed integer programming
• A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems
• An effective hybrid approach to the two-stage capacitated facility location problem
• scientific article; zbMATH DE number 833409 (Why is no real title available?)
• Cover inequalities for robust knapsack sets -- application to the robust bandwidth packing problem
• Projection results for vehicle routing

This page was built for publication: Solving Multiple Knapsack Problems by Cutting Planes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4895625)