An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual
type: Item
instance of: scholarly article
title: An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual
zbMATH Open document ID: 1091.90045
author: Babacar Thiongane
author: A. Nagih
author: Gérard Plateau
published in: Annals of Operations Research
publication date: 2006-03-07T00:00:00Z
Mathematics Subject Classification ID: 90C09
Mathematics Subject Classification ID: 90C46
zbMATH DE Number: 5009777
zbMATH Keywords: 0-1 knapsack problem
zbMATH Keywords: Lagrangean relaxation
zbMATH Keywords: linear relaxation
zbMATH Keywords: adapted step size
describes a project that uses: Algorithm 37
describes a project that uses: CPLEX
MaRDI profile type: Publication
full work available at URL: s10479-005-3454-x
OpenAlex ID: W2034635100
cites work: An Algorithm for Large Zero-One Knapsack Problems
cites work: Q4133397
cites work: Complexity of some parametric integer and network programming problems
cites work: Calculation of stability radii for combinatorial optimization problems
cites work: An algorithm for the multiparametric 0--1-integer linear programming problem relative to the objective function
cites work: The multiparametric 0-1-integer linear programming problem: A unified approach
cites work: A reoptimization algorithm for the shortest path problem with time windows
cites work: An exact search for the solution of the surrogate dual of the 0-1 bidimensional knapsack problem
cites work: Advances in sensitivity analysis and parametric programming
cites work: Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
cites work: Exceptional Paper—Parametric and Postoptimality Analysis in Integer Linear Programming
cites work: Q4377042
cites work: Lagrangean decomposition: A model yielding stronger lagrangean bounds
cites work: Lagrangean decomposition for integer programming : theory and applications
cites work: Q3895490
cites work: Parametric Combinatorial Computing and a Problem of Program Module Distribution
cites work: Three methods for postoptimal analysis in integer linear programming
cites work: Computing Partitions with Applications to the Knapsack Problem
cites work: Parametric-objective integer programming using knapsack facets and Gomory cutting planes
cites work: Parametric methods in integer linear programming
cites work: Technical Note—Searchability of the Composite and Multiple Surrogate Dual Functions
cites work: Q5688056
cites work: Parameterisation algorithms for the integer linear programs in binary variables
cites work: Algorithm 37. Algorithm for the solution of the 0-1 single Knapsack problem
cites work: Lagrangean decomposition for integer nonlinear programming with linear constraints
cites work: Q3901292
cites work: Some Easy Postoptimality Analysis for Zero-One Programming
cites work: Q3678962
cites work: Lagrangean Decomposition In Integer Linear Programming: A New Scheme
cites work: Postoptimality analysis in integer programming by implicit enumeration: The mixed integer case
cites work: Sensitivity Analysis for Branch and Bound Integer Programming
cites work: A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
cites work: Some concepts of stability analysis in combinatorial optimization
cites work: Analyse de sensibilité pour les problèmes linéaires en variables 0-1
cites work: Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem
DOI: 10.1007/S10479-005-3454-X
description: scientific article; zbMATH DE number 5009777