A multi-level search strategy for the 0-1 multidimensional knapsack problem
From MaRDI portal
Publication:968116
DOI10.1016/j.dam.2009.08.007zbMath1185.90170OpenAlexW2034850884MaRDI QIDQ968116
Yannick Vimont, Sylvain Boussier, Saïd Hanafi, Michel Vasquez, Philippe Yves Paul Michelon
Publication date: 5 May 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/197839
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Boolean programming (90C09)
Related Items (28)
A ``reduce and solve approach for the multiple-choice multidimensional knapsack problem ⋮ Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ Hybrid approaches for the two-scenario max-min knapsack problem ⋮ An iterated ``hyperplane exploration approach for the quadratic knapsack problem ⋮ Bi-dimensional knapsack problems with one soft constraint ⋮ Improving problem reduction for 0-1 multidimensional knapsack problems with valid inequalities ⋮ Corrigendum to: ``Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems ⋮ A new discrete electromagnetism-based meta-heuristic for solving the multidimensional knapsack problem using genetic operators ⋮ A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem ⋮ Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem ⋮ Generalized resolution search ⋮ Capacity allocation problem with random demands for the rail container carrier ⋮ A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem ⋮ A memetic Lagrangian heuristic for the 0-1 multidimensional knapsack problem ⋮ Approximate and exact merging of knapsack constraints with cover inequalities ⋮ An iterative pseudo-gap enumeration approach for the multidimensional multiple-choice knapsack problem ⋮ A new exact approach for the 0-1 collapsing knapsack problem ⋮ Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem ⋮ Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem ⋮ A heuristic approach for allocation of data to RFID tags: a data allocation knapsack problem (DAKP) ⋮ Kernel search: a general heuristic for the multi-dimensional knapsack problem ⋮ Computational experience with a core-based reduction procedure for the 2-knapsack problem ⋮ A binary differential search algorithm for the 0-1 multidimensional knapsack problem ⋮ Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems ⋮ A Partheno-Genetic Algorithm for Dynamic 0-1 Multidimensional Knapsack Problem ⋮ Complexity indices for the multidimensional knapsack problem ⋮ CORAL: An Exact Algorithm for the Multidimensional Knapsack Problem ⋮ Memory and Learning in Metaheuristics
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Resolution search
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects
- Heuristic algorithms for the multiple knapsack problem
- An algorithm for the solution of the 0-1 knapsack problem
- A genetic algorithm for the multidimensional knapsack problem
- An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem
- The multidimensional 0-1 knapsack problem: an overview.
- Improved results on the 0--1 multidimensional knapsack problem
- Resolution search and dynamic branch-and-bound
- New convergent heuristics for 0-1 mixed integer programming
- Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem
- Constraint-Propagation-Based Cutting Planes: An Application to the Resource-Constrained Project Scheduling Problem
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- Pivot and Complement–A Heuristic for 0-1 Programming
- A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
- Une approche hybride pour le sac à dos multidimensionnel en variables 0–1
- The Theory and Computation of Knapsack Functions
- A Shrinking Boundary Algorithm for Discrete System Models
- Integer Programming and Combinatorial Optimization
This page was built for publication: A multi-level search strategy for the 0-1 multidimensional knapsack problem
