A multi-level search strategy for the 0-1 multidimensional knapsack problem
From MaRDI portal
Publication:968116
DOI10.1016/J.DAM.2009.08.007zbMATH Open1185.90170OpenAlexW2034850884MaRDI QIDQ968116FDOQ968116
Authors: Sylvain Boussier, Michel Vasquez, Yannick Vimont, Saïd Hanafi, Philippe 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
Recommendations
- Improved results on the 0--1 multidimensional knapsack problem
- Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem
- CORAL: an exact algorithm for the multidimensional knapsack problem
- Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem
- Adaptive memory search for multidemand multidimensional knapsack problems
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Boolean programming (90C09)
Cites Work
- Title not available (Why is that?)
- Improved results on the 0--1 multidimensional knapsack problem
- 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
- A genetic algorithm for the multidimensional knapsack problem
- The multidimensional 0-1 knapsack problem: an overview.
- The Theory and Computation of Knapsack Functions
- Heuristic algorithms for the multiple knapsack problem
- Title not available (Why is that?)
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects
- A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
- Une approche hybride pour le sac à dos multidimensionnel en variables 0–1
- Resolution search and dynamic branch-and-bound
- Resolution search
- An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- An algorithm for the solution of the 0-1 knapsack problem
- Pivot and Complement–A Heuristic for 0-1 Programming
- Integer Programming and Combinatorial Optimization
- A Shrinking Boundary Algorithm for Discrete System Models
Cited In (33)
- Adaptive memory search for multidemand multidimensional knapsack problems
- A partheno-genetic algorithm for dynamic 0-1 multidimensional Knapsack problem
- Memory and Learning in Metaheuristics
- Computational experience with a core-based reduction procedure for the 2-knapsack problem
- An iterated ``hyperplane exploration approach for the quadratic knapsack problem
- Generalized resolution search
- A ``reduce and solve approach for the multiple-choice multidimensional knapsack problem
- Capacity allocation problem with random demands for the rail container carrier
- Hybrid approaches for the two-scenario max-min knapsack problem
- A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem
- Bi-dimensional knapsack problems with one soft constraint
- Kernel search: a general heuristic for the multi-dimensional knapsack problem
- Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems
- Approximate and exact merging of knapsack constraints with cover inequalities
- Complexity indices for the multidimensional knapsack problem
- CORAL: an exact algorithm for the multidimensional knapsack problem
- An iterative pseudo-gap enumeration approach for the multidimensional multiple-choice knapsack problem
- Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem
- Improving problem reduction for 0-1 multidimensional knapsack problems with valid inequalities
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem
- A binary differential search algorithm for the 0-1 multidimensional knapsack problem
- 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
- Une approche hybride pour le sac à dos multidimensionnel en variables 0–1
- Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem
- Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem
- Matheuristic fixed set search applied to the multidimensional knapsack problem and the knapsack problem with forfeit sets
- Two-set inequalities for the binary knapsack polyhedra
- A heuristic approach for allocation of data to RFID tags: a data allocation knapsack problem (DAKP)
- Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem
- A new exact approach for the 0-1 collapsing knapsack problem
- A memetic Lagrangian heuristic for the 0-1 multidimensional knapsack problem
Uses Software
This page was built for publication: A multi-level search strategy for the 0-1 multidimensional knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968116)
