Improved convergent heuristics for the 0-1 multidimensional knapsack problem
From MaRDI portal
Publication:542002
DOI10.1007/s10479-009-0546-zzbMath1215.90045OpenAlexW2066635774MaRDI QIDQ542002
Christophe Wilbaut, Saïd Hanafi
Publication date: 8 June 2011
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-009-0546-z
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Boolean programming (90C09)
Related Items
New convergent heuristics for 0-1 mixed integer programming ⋮ Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ Hybrid approaches for the two-scenario max-min knapsack problem ⋮ Searching for a cycle with maximum coverage in undirected graphs ⋮ Mathematical programming based heuristics for the 0--1 MIP: a survey ⋮ Minimum cost delivery of multi-item orders in e-commerce logistics ⋮ Corrigendum to: ``Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems ⋮ 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 ⋮ Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design ⋮ A quantum particle swarm optimization for the 0-1 generalized knapsack sharing problem ⋮ Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method ⋮ 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 Partheno-Genetic Algorithm for Dynamic 0-1 Multidimensional Knapsack Problem ⋮ CORAL: An Exact Algorithm for the Multidimensional Knapsack Problem ⋮ On convergence of scatter search and star paths with directional rounding for 0--1 mixed integer programs ⋮ Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A survey of very large-scale neighborhood search techniques
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects
- Zero-one programming with many variables and few constraints
- An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem
- An expanding-core algorithm for the exact \(0-1\) knapsack problem
- Local branching
- The multidimensional 0-1 knapsack problem: an overview.
- An efficient tabu search approach for the 0-1 multidimensional knapsack problem
- The core concept for the Multidimensional Knapsack problem
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Improved results on the 0--1 multidimensional knapsack problem
- New convergent heuristics for 0-1 mixed integer programming
- Surrogate Dual Multiplier Search Procedures in Integer Programming
- Surrogate Constraint Duality in Mathematical Programming
- Sac à dos multidimensionnel en variables 0-1 : encadrement de la somme des variables à l'optimum
- Une approche hybride pour le sac à dos multidimensionnel en variables 0–1
- A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
- Canonical Cuts on the Unit Hypercube
- Variable neighborhood search: Principles and applications
This page was built for publication: Improved convergent heuristics for the 0-1 multidimensional knapsack problem
