A theoretical and empirical investigation on the Lagrangian capacities of the 0-1 multidimensional knapsack problem
From MaRDI portal
Publication:439503
Recommendations
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects
- Sac à dos multidimensionnel en variables 0-1 : encadrement de la somme des variables à l'optimum
- Publication:3487140
- On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra
- Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem
- Some new results on multi-dimension Knapsack problem
- A new Lagrangian based branch and bound algorithm for the 0-1 knapsack problem
- A Note on Approximation Schemes for Multidimensional Knapsack Problems
- On The Strength Of Relaxations Of Multidimensional Knapsack Problems
- Improved results on 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 3470175 (Why is no real title available?)
- scientific article; zbMATH DE number 3614502 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1349588 (Why is no real title available?)
- scientific article; zbMATH DE number 1054947 (Why is no real title available?)
- scientific article; zbMATH DE number 1054950 (Why is no real title available?)
- scientific article; zbMATH DE number 1114000 (Why is no real title available?)
- scientific article; zbMATH DE number 1182767 (Why is no real title available?)
- scientific article; zbMATH DE number 1487974 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- scientific article; zbMATH DE number 4121754 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- scientific article; zbMATH DE number 1445306 (Why is no real title available?)
- scientific article; zbMATH DE number 3281211 (Why is no real title available?)
- A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
- A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
- A Survey of Lagrangean Techniques for Discrete Optimization
- A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem
- A genetic algorithm for the multidimensional knapsack problem
- A heuristic algorithm for the multidimensional zero-one knapsack problem
- A heuristic solution procedure for the multiconstraint zero-one knapsack problem
- A multi-level search strategy for the 0-1 multidimensional knapsack problem
- A new ant colony optimization algorithm for the multidimensional Knapsack problem
- An $0 (n^3)$ worst case bounded special $LP$ knapsack $(0-1)$ with two constraints
- An Exact Algorithm for the Two-Constraint 0–1 Knapsack Problem
- An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem
- An efficient tabu search approach for the 0-1 multidimensional knapsack problem
- An exact search for the solution of the surrogate dual of the 0-1 bidimensional knapsack problem
- An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem
- Approximate Algorithms for the 0/1 Knapsack Problem
- Approximation algorithms for knapsack problems with cardinality constraints
- Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses
- Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- Extensions of Lagrange Multipliers in Nonlinear Programming
- Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem
- Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
- Generalized Penalty-Function Concepts in Mathematical Optimization
- Heuristics for the 0-1 multidimensional knapsack problem
- Improved convergent heuristics for the 0-1 multidimensional knapsack problem
- Improved results on the 0--1 multidimensional knapsack problem
- LP relaxation of the two dimensional knapsack problem with box and GUB constraints
- Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem
- Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem
- MOTGA: a multiobjective Tchebycheff based genetic algorithm for the multidimensional knapsack problem
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- New convergent heuristics for 0-1 mixed integer programming
- Obtaining test problems via Internet
- On The Strength Of Relaxations Of Multidimensional Knapsack Problems
- On separating cover inequalities for the multidimensional knapsack problem
- Problem reduction heuristic for the \(0\)-\(1\) multidimensional knapsack problem
- Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem
- Scatter search for the 0-1 multidimensional knapsack problem
- Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search
- Some Experiences On Solving Multiconstraint Zero-One Knapsack Problems With Genetic Algorithms
- Some relationships between lagrangian and surrogate duality in integer programming
- Surrogate Constraints
- Surrogate Mathematical Programming
- Tabu Search—Part I
- Technical Note—Searchability of the Composite and Multiple Surrogate Dual Functions
- The 0-1 bidimensional knapsack problem: Toward an efficient high-level primitive tool
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects
- The multidimensional 0-1 knapsack problem: an overview.
- Tight oscillations tabu search for multidimensional knapsack problems with generalized upper bound constraints
Cited in
(3)
This page was built for publication: A theoretical and empirical investigation on the Lagrangian capacities of 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 Q439503)
