A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem
From MaRDI portal
Publication:439503
DOI10.1016/j.ejor.2011.11.011zbMath1244.90163OpenAlexW2069994399MaRDI QIDQ439503
Yourim Yoon, Yong-Hyuk Kim, Byung-Ro Moon
Publication date: 16 August 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2011.11.011
integer programmingLagrangian method\(0\)-\(1\) multidimensional knapsack problemLagrangian capacity
Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Boolean programming (90C09)
Related Items (3)
Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ Solving large-scale multidimensional knapsack problems with a new binary harmony search algorithm ⋮ A memetic Lagrangian heuristic for the 0-1 multidimensional knapsack problem
Uses Software
Cites Work
- Improved convergent heuristics for the 0-1 multidimensional knapsack problem
- Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search
- A heuristic algorithm for the multidimensional zero-one knapsack problem
- Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects
- On separating cover inequalities for the multidimensional knapsack problem
- MOTGA: a multiobjective Tchebycheff based genetic algorithm for the multidimensional knapsack problem
- Scatter search for the 0-1 multidimensional knapsack problem
- Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem
- A multi-level search strategy for the 0-1 multidimensional knapsack problem
- An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem
- Heuristics for the 0-1 multidimensional knapsack problem
- LP relaxation of the two dimensional knapsack problem with box and GUB constraints
- A genetic algorithm for the multidimensional knapsack problem
- An exact search for the solution of the surrogate dual of the 0-1 bidimensional knapsack problem
- An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem
- The 0-1 bidimensional knapsack problem: Toward an efficient high-level primitive tool
- The multidimensional 0-1 knapsack problem: an overview.
- Approximation algorithms for knapsack problems with cardinality constraints
- An efficient tabu search approach for the 0-1 multidimensional knapsack problem
- Problem reduction heuristic for the \(0\)-\(1\) multidimensional knapsack problem
- Improved results on the 0--1 multidimensional knapsack problem
- Tight oscillations tabu search for multidimensional knapsack problems with generalized upper bound constraints
- Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions
- Obtaining test problems via Internet
- New convergent heuristics for 0-1 mixed integer programming
- Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem
- Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem
- A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem
- Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem
- A new ant colony optimization algorithm for the multidimensional Knapsack problem
- An Exact Algorithm for the Two-Constraint 0–1 Knapsack Problem
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- A heuristic solution procedure for the multiconstraint zero-one knapsack problem
- An $0 (n^3)$ worst case bounded special $LP$ knapsack $(0-1)$ with two constraints
- Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
- Some relationships between lagrangian and surrogate duality in integer programming
- Technical Note—Searchability of the Composite and Multiple Surrogate Dual Functions
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Tabu Search—Part I
- Approximate Algorithms for the 0/1 Knapsack Problem
- A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
- A Survey of Lagrangean Techniques for Discrete Optimization
- Generalized Penalty-Function Concepts in Mathematical Optimization
- On The Strength Of Relaxations Of Multidimensional Knapsack Problems
- Some Experiences On Solving Multiconstraint Zero-One Knapsack Problems With Genetic Algorithms
- A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
- Surrogate Constraints
- Extensions of Lagrange Multipliers in Nonlinear Programming
- Surrogate Mathematical Programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem
