Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem
From MaRDI portal
Recommendations
- New convergent heuristics for 0-1 mixed integer programming
- Heuristics for the 0-1 multidimensional knapsack problem
- Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem
- A ``reduce and solve approach for the multiple-choice multidimensional knapsack problem
- Heuristic algorithms for the multiple-choice multidimensional knapsack problem
Cites work
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 3614502 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (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 Shrinking Boundary Algorithm for Discrete System Models
- A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems
- A best first search exact algorithm for the multiple-choice multidimensional knapsack problem
- A column generation method for the multiple-choice multi-dimensional knapsack problem
- A grasp-knapsack hybrid for a nurse-scheduling problem
- A multi-level search strategy for the 0-1 multidimensional knapsack problem
- A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem
- A survey of effective heuristics and their application to a variety of knapsack problems
- An Exact Algorithm for the Multiple-Choice Multidimensional Knapsack Based on the Core
- An algorithm for the solution of the 0-1 knapsack problem
- Budgeting with bounded multiple-choice constraints.
- Canonical Cuts on the Unit Hypercube
- Efficient algorithms for the capacitated concentrator location problem
- Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Hard multidimensional multiple choice knapsack problems, an empirical study
- Heuristic algorithms for the multiple-choice multidimensional knapsack problem
- Heuristics for determining the number of warehouses for storing non-compatible products
- Hybrid algorithms for the multiple-choice multi-dimensional knapsack problem
- Improved convergent heuristics for the 0-1 multidimensional knapsack problem
- Local branching
- New convergent heuristics for 0-1 mixed integer programming
- New greedy heuristics for the multiple-choice multi-dimensional knapsack problem
- Parametric tabu-search for mixed integer programs
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem
- Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search
- Surrogate Constraint Duality in Mathematical Programming
- Surrogate Constraints
- The Traveling-Salesman Problem and Minimum Spanning Trees
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects
- The traveling-salesman problem and minimum spanning trees: Part II
- Une approche hybride pour le sac à dos multidimensionnel en variables 0–1
- Variable neighborhood decomposition search
- Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs
Cited in
(8)- Relaxations and heuristics for the multiple non-linear separable knapsack problem
- A ``reduce and solve approach for the multiple-choice multidimensional knapsack problem
- A Core-Based Exact Algorithm for the Multidimensional Multiple Choice Knapsack Problem
- A two-phase kernel search variant for the multidimensional multiple-choice knapsack problem
- An iterative pseudo-gap enumeration approach for the multidimensional multiple-choice knapsack problem
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- A fuzzy multidimensional multiple-choice knapsack model for project portfolio selection using an evolutionary algorithm
- New convergent heuristics for 0-1 mixed integer programming
This page was built for publication: Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1761941)
