Analyse de sensibilité pour les problèmes linéaires en variables 0-1

Thiongane, Babacar; Nagih, Anass; Plateau, Gérard

doi:10.1051/ro:2004002

Cited by 5 publications

(1 citation statement)

References 39 publications

(48 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For integer programming, numerous works are devoted to sensitivity analysis (Geoffrion and Nauss, 1977;Gusfield, 1980;Holm and Klein, 1984;Schrage and Wolsey, 1985;Wagelmans, 1990;Sotskov, Leontev, and Gordeev, 1995;Libura, 1996;Gal and Greenberg, 1997;Greenberg, 1998;Chakravarti and Wagelmans, 1999;Thiongane, Nagih, and Plateau, 2003a) and parametrization (Nauss, 1975;Geoffrion and Nauss, 1977;Gusfield, 1983;Carstensen, 1983;Loukakis and Muhlemann, 1984;Jenkins, 1987bJenkins, , 1990Crema, 2000Crema, , 2002Thiongane, Nagih, and Plateau, 2003b) (an extended bibliography on sensitivity analysis and parametrization can be found at Greenberg's web site 1 ). However, only a few works exist in literature on integer programming reoptimization (Roodman, 1974;Nauss, 1975;Pipers and Zoltners, 1976;Thiongane, Nagih, and Plateau, 2003a) include a state of the art on reoptimization techniques for 0-1 linear problems).…”

Section: Introductionmentioning

confidence: 99%

An Adapted Step Size Algorithm for a 0-1 Biknapsack Lagrangean Dual

2005

Self Cite

View full text Add to dashboard Cite

This paper deals with a new algorithm for a 0-1 bidimensional knapsack Lagrangean dual which relaxes one of the two constraints. Classical iterative algorithms generate a sequence of multipliers which converges to an optimal one. In this way, these methods generate a sequence of 0-1 one-dimensional knapsack instances. Generally, the procedure for solving each instance is considered as a black box. We propose to design a new iterative scheme in which the computation of the step size takes into account the algorithmic efficiency of each instance. Our adapted step size iterative algorithm is compared favorably with several other algorithms for the 0-1 biknapsack Lagrangean dual over difficult instances for CPLEX 7.0. Notation(·): linear relaxation of a given integer problem (·), v(·): optimal value of a given problem (·), v(·): lower bound value of a given problem (·), ]a, b[: interval [a, b] without a and b.

show abstract

Section: Introductionmentioning

confidence: 99%

An Adapted Step Size Algorithm for a 0-1 Biknapsack Lagrangean Dual

2005

Self Cite

View full text Add to dashboard Cite

show abstract

0–1 Knapsack Problems

Plateau¹,

Nagih²

2013

Paradigms of Combinatorial Optimization

View full text Add to dashboard Cite

General Bibliography

2014

Paradigms of Combinatorial Optimization

View full text Add to dashboard Cite

Journal of Computer and System Sciences k ACM Symposium on Theory of Computing Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms O(log n/ log log n) Proceedings of the 21st ACM-SIAM Symposium on Discrete Algorithms Proc. of the 17th International Symposium on Theoretical Aspects of Computer Science Proceedings 10th Annual ACM-SIAM Symposium on Discrete Algorithms European J. of Operational Research L 1 Séminaire d'initiation à l'analyse Contribution to the Theory of Games

show abstract

Analyse de sensibilité pour les problèmes linéaires en variables 0-1

Abstract: This paper is a state of the art on sensitivity analysis for 0-1 linear programming problems. Several aspects are considered: history and forms of sensitivity analysis, application examples, complexity, optimality conditions, existing algorithms and approaches.

Cited by 5 publications

References 39 publications

An Adapted Step Size Algorithm for a 0-1 Biknapsack Lagrangean Dual

An Adapted Step Size Algorithm for a 0-1 Biknapsack Lagrangean Dual

0–1 Knapsack Problems

General Bibliography

Contact Info

Product

Resources

About