The multidimensional knapsack problem: structure and algorithms
From MaRDI portal
Recommendations
- The core concept for the Multidimensional Knapsack problem
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects
- CORAL: an exact algorithm for the multidimensional knapsack problem
- Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem
- The multidimensional 0-1 knapsack problem: an overview.
Cited in
(60)- On the multiperiod binary knapsack problem
- The multidimensional 0-1 knapsack problem: an overview.
- Generalized average shadow prices and bottlenecks
- Bi-dimensional knapsack problems with one soft constraint
- The core concept for the Multidimensional Knapsack problem
- Two-stage solution-based tabu search for the multidemand multidimensional knapsack 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
- Improved LP-based algorithms for the closest string problem
- Dichotomous binary differential evolution for knapsack problems
- Multi-constrained matroidal knapsack problems
- A memetic Lagrangian heuristic for the 0-1 multidimensional knapsack problem
- The multiple multidimensional knapsack with family-split penalties
- Revisiting surrogate relaxation for the multidimensional knapsack problem
- On the exact separation of cover inequalities of maximum-depth
- Multistage knapsack
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- The fractional multidimensional knapsack problem: solution and uniqueness
- On the complexity of separation from the knapsack polytope
- A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem
- Inbound and outbound flow integration for cross-docking operations
- A binary differential search algorithm for the 0-1 multidimensional knapsack problem
- Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems
- Integrating workload smoothing and inventory reduction in three intermodal logistics platforms of a European car manufacturer
- Some new results on multi-dimension Knapsack problem
- Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls
- A variable neighborhood search algorithm for an integrated physician planning and scheduling problem
- CORAL: an exact algorithm for the multidimensional knapsack problem
- A ``reduce and solve approach for the multiple-choice multidimensional knapsack problem
- An approximate dynamic programming approach to multidimensional knapsack problems
- The effects of coefficient correlation structure in two-dimensional knapsack problems on solution procedure performance
- Decomposition based hybrid metaheuristics
- Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems
- Robust efficiency measures for linear knapsack problem variants
- Improving problem reduction for 0-1 multidimensional knapsack problems with valid inequalities
- scientific article; zbMATH DE number 3900493 (Why is no real title available?)
- A Modified Binary Particle Swarm Optimization for Knapsack Problems
- scientific article; zbMATH DE number 719668 (Why is no real title available?)
- Essential particle swarm optimization queen with tabu search for MKP resolution
- An Iterated Dual Substitution Approach for Binary Integer Programming Problems Under the Min-Max Regret Criterion
- Canonical duality-triality theory: unified understanding for modeling, problems, and NP-hardness in global optimization of multi-scale systems
- A Core-Based Exact Algorithm for the Multidimensional Multiple Choice Knapsack Problem
- Approximate and exact merging of knapsack constraints with cover inequalities
- Identifying redundancy in multi-dimensional knapsack constraints based on surrogate constraints
- Integrating Symmetry, Dominance, and Bound-and-Bound in a Multiple Knapsack Solver
- The minmax multidimensional knapsack problem with application to a chance‐constrained problem
- Statistical mechanics analysis of generalized multi-dimensional knapsack problems
- The basic train makeup problem in shunting yards
- When to use Integer Programming Software to solve large multi-demand multidimensional knapsack problems: a guide for operations research practitioners
- Pseudo-polynomial algorithms for solving the knapsack problem with dependencies between items
- On the complexity of separating cutting planes for the knapsack polytope
- Optimizing a binary integer program by identifying its optimal core problem -- a new optimization concept applied to the multidimensional knapsack problem
- An improved version of a core based algorithm for the multi-objective multi-dimensional knapsack problem: a computational study and comparison with meta-heuristics
- Computational experience with a core-based reduction procedure for the 2-knapsack problem
- Hard multidimensional multiple choice knapsack problems, an empirical study
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects
- A randomized heuristic repair for the multidimensional knapsack problem
- Solving large 0-1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm
- Alternating control tree search for knapsack/covering problems
- Kernel search: a general heuristic for the multi-dimensional knapsack problem
This page was built for publication: The multidimensional knapsack problem: structure and algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2899058)
