Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems

DOI10.1016/J.EJOR.2019.09.016MaRDI QIDQ2282492zbMATH OpenOpenAlexFDO

Authors Thomas Setzer, Sebastian M. Blanc

Publication date 8 January 2020

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2019.09.016

zbMATH Keywords

dimension reductionconstraint generationmultidimensional knapsack problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• The multidimensional knapsack problem: structure and algorithms
• Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem
• CORAL: an exact algorithm for the multidimensional knapsack problem
• Improved results on the 0--1 multidimensional knapsack problem
• A ``reduce and solve approach for the multiple-choice multidimensional knapsack problem

Cites work

• scientific article; zbMATH DE number 3850828 (Why is no real title available?)
• scientific article; zbMATH DE number 1054947 (Why is no real title available?)
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
• A bound and bound algorithm for the zero-one multiple knapsack problem
• A branch-and-bound algorithm for hard multiple knapsack problems
• A genetic algorithm for the multidimensional knapsack problem
• A multi-level search strategy for the 0-1 multidimensional knapsack problem
• A multidimensional knapsack model for asset-backed securitization
• A randomized algorithm for fixed-dimensional linear programming
• A survey of effective heuristics and their application to a variety of knapsack problems
• An Algorithm for Large Zero-One Knapsack Problems
• CORAL: an exact algorithm for the multidimensional knapsack problem
• Discrete dynamic programming and capital allocation
• Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
• Geometric characterizations of centroids of simplices
• Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem
• Improved results on the 0--1 multidimensional knapsack problem
• Kernel search: a general heuristic for the multi-dimensional knapsack problem
• New convergent heuristics for 0-1 mixed integer programming
• On the Geometry of the n-Dimensional Simplex
• Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem
• The Theory and Computation of Knapsack Functions
• The knapsack problem: A survey
• The multidimensional 0-1 knapsack problem: an overview.
• The multidimensional knapsack problem: structure and algorithms
• Using matrix approximation for high-dimensional discrete optimization problems: server consolidation based on cyclic time-series data

Cited in

(1)

• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems

Describes a project that uses

Uses Software

• OR-Library

This page was built for publication: Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems

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