Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem
From MaRDI portal
Publication:2433806
DOI10.1016/j.dam.2005.04.013zbMath1111.90096OpenAlexW2070179217MaRDI QIDQ2433806
Gérard Plateau, Anass Nagih, Babacar Thiongane
Publication date: 30 October 2006
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2005.04.013
Related Items
Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems, A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem, A theory and algorithms for combinatorial reoptimization, Reoptimization in Lagrangian methods for the \(0\)-\(1\) quadratic knapsack problem, Shift-and-merge technique for the DP solution of the time-constrained backpacker problem, Analyse de sensibilité pour les problèmes linéaires en variables 0-1, An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual
Uses Software
Cites Work
- Convergence of a generalized subgradient method for nondifferentiable convex optimization
- Heuristics and reduction methods for multiple constraints 0-1 linear programming problems
- Heuristic algorithms for the multiple knapsack problem
- On the choice of step size in subgradient optimization
- An algorithm for the solution of the 0-1 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
- 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
- A generalization of Polyak's convergence result for subgradient optimization
- An $0 (n^3)$ worst case bounded special $LP$ knapsack $(0-1)$ with two constraints
- An Algorithm for Large Zero-One Knapsack Problems
- Technical Note—Searchability of the Composite and Multiple Surrogate Dual Functions
- A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
- Validation of subgradient optimization
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
