An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual

DOI10.1007/s10479-005-3454-xzbMath1091.90045OpenAlexW2034635100MaRDI QIDQ817197

Gérard Plateau, Anass Nagih, Babacar Thiongane

Publication date: 7 March 2006

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-005-3454-x

zbMATH Keywords

Lagrangean relaxationlinear relaxation0-1 knapsack problemadapted step size

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Boolean programming (90C09)

Related Items (3)

Comparison of bundle and classical column generation ⋮ Reoptimization in Lagrangian methods for the \(0\)-\(1\) quadratic knapsack problem ⋮ Analyse de sensibilité pour les problèmes linéaires en variables 0-1

Uses Software

• CPLEX
• Algorithm 37

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parametric-objective integer programming using knapsack facets and Gomory cutting planes
• Parameterisation algorithms for the integer linear programs in binary variables
• A reoptimization algorithm for the shortest path problem with time windows
• Lagrangean decomposition for integer nonlinear programming with linear constraints
• Algorithm 37. Algorithm for the solution of the 0-1 single Knapsack problem
• Calculation of stability radii for combinatorial optimization problems
• An exact search for the solution of the surrogate dual of the 0-1 bidimensional knapsack problem
• Advances in sensitivity analysis and parametric programming
• An algorithm for the multiparametric 0--1-integer linear programming problem relative to the objective function
• The multiparametric 0-1-integer linear programming problem: A unified approach
• Some concepts of stability analysis in combinatorial optimization
• Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem
• Parametric methods in integer linear programming
• Three methods for postoptimal analysis in integer linear programming
• Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
• Sensitivity Analysis for Branch and Bound Integer Programming
• Complexity of some parametric integer and network programming problems
• Parametric Combinatorial Computing and a Problem of Program Module Distribution
• Lagrangean decomposition: A model yielding stronger lagrangean bounds
• Lagrangean decomposition for integer programming : theory and applications
• An Algorithm for Large Zero-One Knapsack Problems
• Technical Note—Searchability of the Composite and Multiple Surrogate Dual Functions
• Lagrangean Decomposition In Integer Linear Programming: A New Scheme
• Postoptimality analysis in integer programming by implicit enumeration: The mixed integer case
• Some Easy Postoptimality Analysis for Zero-One Programming
• Computing Partitions with Applications to the Knapsack Problem
• Exceptional Paper—Parametric and Postoptimality Analysis in Integer Linear Programming
• A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
• Analyse de sensibilité pour les problèmes linéaires en variables 0-1

This page was built for publication: An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual