A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem
type: Item
instance of: scholarly article
title: A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem
zbMATH Open document ID: 1244.90163
author: Yourim Yoon
author: Yong-Hyuk Kim
author: Byung-Ro Moon
published in: European Journal of Operational Research
publication date: 2012-08-16T00:00:00Z
Mathematics Subject Classification ID: 90C09
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6066854
zbMATH Keywords: integer programming
zbMATH Keywords: \(0\)-\(1\) multidimensional knapsack problem
zbMATH Keywords: Lagrangian method
zbMATH Keywords: Lagrangian capacity
describes a project that uses: MOTGA
describes a project that uses: OR-Library
describes a project that uses: Knapsack
MaRDI profile type: Publication
full work available at URL: j.ejor.2011.11.011
OpenAlex ID: W2069994399
cites work: MOTGA: a multiobjective Tchebycheff based genetic algorithm for the multidimensional knapsack problem
cites work: LP relaxation of the two dimensional knapsack problem with box and GUB constraints
cites work: A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem
cites work: Q4735035
cites work: Obtaining test problems via Internet
cites work: On separating cover inequalities for the multidimensional knapsack problem
cites work: Generalized Penalty-Function Concepts in Mathematical Optimization
cites work: A multi-level search strategy for the 0-1 multidimensional knapsack problem
cites work: Heuristics for the 0-1 multidimensional knapsack problem
cites work: An $0 (n^3)$ worst case bounded special $LP$ knapsack $(0-1)$ with two constraints
cites work: Approximation algorithms for knapsack problems with cardinality constraints
cites work: Q4952619
cites work: A genetic algorithm for the multidimensional knapsack problem
cites work: On The Strength Of Relaxations Of Multidimensional Knapsack Problems
cites work: Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems
cites work: Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem
cites work: The multidimensional 0-1 knapsack problem: an overview.
cites work: The multidimensional 0-1 knapsack problem -- bounds and computational aspects
cites work: An exact search for the solution of the surrogate dual of the 0-1 bidimensional knapsack problem
cites work: An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem
cites work: The 0-1 bidimensional knapsack problem: Toward an efficient high-level primitive tool
cites work: Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses
cites work: Q4198056
cites work: Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
cites work: Q4178782
cites work: A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
cites work: Surrogate Constraints
cites work: Tabu Search—Part I
cites work: Q4350063
cites work: Q4692508
cites work: Extensions of Lagrange Multipliers in Nonlinear Programming
cites work: Surrogate Mathematical Programming
cites work: An efficient tabu search approach for the 0-1 multidimensional knapsack problem
cites work: Scatter search for the 0-1 multidimensional knapsack problem
cites work: Improved convergent heuristics for the 0-1 multidimensional knapsack problem
cites work: Problem reduction heuristic for the \(0\)-\(1\) multidimensional knapsack problem
cites work: Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem
cites work: Some relationships between lagrangian and surrogate duality in integer programming
cites work: Technical Note—Searchability of the Composite and Multiple Surrogate Dual Functions
cites work: Q4400850
cites work: Q4821303
cites work: A new ant colony optimization algorithm for the multidimensional Knapsack problem
cites work: Tight oscillations tabu search for multidimensional knapsack problems with generalized upper bound constraints
cites work: Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search
cites work: Q4350067
cites work: Q5566063
cites work: A heuristic algorithm for the multidimensional zero-one knapsack problem
cites work: Q3993418
cites work: An Exact Algorithm for the Two-Constraint 0–1 Knapsack Problem
cites work: Q4265265
cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
cites work: Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions
cites work: A heuristic solution procedure for the multiconstraint zero-one knapsack problem
cites work: Approximate Algorithms for the 0/1 Knapsack Problem
cites work: A Survey of Lagrangean Techniques for Discrete Optimization

A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem (cites work)
cites work: A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem

A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem (cites work)
cites work: Some Experiences On Solving Multiconstraint Zero-One Knapsack Problems With Genetic Algorithms

A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem (cites work)
cites work: Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem

A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem (cites work)
cites work: Improved results on the 0--1 multidimensional knapsack problem

A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem (cites work)
cites work: Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem

A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem (cites work)
cites work: Q4375766

A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem (cites work)
cites work: Q4495103

A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem (cites work)
cites work: New convergent heuristics for 0-1 mixed integer programming

A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem (cites work)
cites work: An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem

A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem (cites work)
cites work: Q4054818

A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem (DOI)
DOI: 10.1016/J.EJOR.2011.11.011

A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem (Recommended article)
Recommended article: The multidimensional 0-1 knapsack problem -- bounds and computational aspects
Similarity Score: 0.90671706
Recommender Run: Recommender Run 3

A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem (Recommended article)
Recommended article: Sac à dos multidimensionnel en variables 0-1 : encadrement de la somme des variables à l'optimum
Similarity Score: 0.8962522
Recommender Run: Recommender Run 3

A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem (Recommended article)
Recommended article: Q3487140
Similarity Score: 0.8893068
Recommender Run: Recommender Run 3

A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem (Recommended article)
Recommended article: On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra
Similarity Score: 0.8833159
Recommender Run: Recommender Run 3

A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem (Recommended article)
Recommended article: Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem
Similarity Score: 0.8830129
Recommender Run: Recommender Run 3

A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem (Recommended article)
Recommended article: Some new results on multi-dimension Knapsack problem
Similarity Score: 0.88151383
Recommender Run: Recommender Run 3

A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem (Recommended article)
Recommended article: A new Lagrangian based branch and bound algorithm for the 0-1 knapsack problem
Similarity Score: 0.8807086
Recommender Run: Recommender Run 3

A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem (Recommended article)
Recommended article: A Note on Approximation Schemes for Multidimensional Knapsack Problems
Similarity Score: 0.8806962
Recommender Run: Recommender Run 3

A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem (Recommended article)
Recommended article: On The Strength Of Relaxations Of Multidimensional Knapsack Problems
Similarity Score: 0.88022655
Recommender Run: Recommender Run 3

A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem (Recommended article)
Recommended article: Improved results on the 0--1 multidimensional knapsack problem
Similarity Score: 0.878618
Recommender Run: Recommender Run 3