Improved convergent heuristics for the 0-1 multidimensional knapsack problem
From MaRDI portal
(Redirected from Publication:542002)
Recommendations
- An Improved Heuristic for Multidimensional 0-1 Knapsack Problems
- Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem
- Improved results on the 0--1 multidimensional knapsack problem
- Heuristics for the 0-1 multidimensional knapsack problem
- Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem
- A heuristic algorithm for the multidimensional zero-one knapsack problem
- scientific article; zbMATH DE number 1054949
- A heuristic solution procedure for the multiconstraint zero-one knapsack problem
- An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem
- Problem reduction heuristic for the 0-1 multidimensional knapsack problem
Cites work
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 1054947 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- scientific article; zbMATH DE number 1416629 (Why is no real title available?)
- scientific article; zbMATH DE number 2209664 (Why is no real title available?)
- A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
- A survey of very large-scale neighborhood search techniques
- An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem
- An efficient tabu search approach for the 0-1 multidimensional knapsack problem
- An expanding-core algorithm for the exact 0-1 knapsack problem
- Canonical Cuts on the Unit Hypercube
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Improved results on the 0--1 multidimensional knapsack problem
- Local branching
- New convergent heuristics for 0-1 mixed integer programming
- Sac à dos multidimensionnel en variables 0-1 : encadrement de la somme des variables à l'optimum
- Surrogate Constraint Duality in Mathematical Programming
- Surrogate Dual Multiplier Search Procedures in Integer Programming
- Tabu search: global intensification using dynamic programming
- The core concept for the Multidimensional Knapsack problem
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects
- The multidimensional 0-1 knapsack problem: an overview.
- Une approche hybride pour le sac à dos multidimensionnel en variables 0–1
- Variable neighborhood search: Principles and applications
- Zero-one programming with many variables and few constraints
Cited in
(20)- A memetic Lagrangian heuristic for the 0-1 multidimensional knapsack problem
- Minimum cost delivery of multi-item orders in e-commerce logistics
- Mathematical programming based heuristics for the 0--1 MIP: a survey
- A partheno-genetic algorithm for dynamic 0-1 multidimensional Knapsack problem
- A quantum particle swarm optimization for the 0-1 generalized knapsack sharing problem
- Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems
- An Improved Heuristic for Multidimensional 0-1 Knapsack Problems
- Hybrid approaches for the two-scenario max-min knapsack problem
- Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design
- CORAL: an exact algorithm for the multidimensional knapsack problem
- Searching for a cycle with maximum coverage in undirected graphs
- Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem
- Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem
- 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
- On convergence of scatter search and star paths with directional rounding for 0--1 mixed integer programs
- Corrigendum to: ``Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems
- New convergent heuristics for 0-1 mixed integer programming
- Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem
- Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method
This page was built for publication: Improved convergent heuristics 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 Q542002)
