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

 Access to full text

 Full (PDF)

1. [1] E. Balas, An additive algorithm for solving linear programs with zero-one variables. Oper. Res. 13 (1965) 517-546. Zbl0194.19903MR183535
2. [2] D.E Bell and J.F Shapiro, A convergent duality theory for integer programming. Oper. Res. 1 (1977) 467-477. Zbl0355.90051MR444000
3. [3] C. Blair, Sensitivity analysis for knapsack problems: a negative result. Discrete Appl. Math. 81 (1998) 133-139. Zbl0895.90155MR1492006
4. [4] P.J. Carstensen, Complexity of some parametric integer and network programming problems. Math. Program. 26 (1983) 64-75. Zbl0585.90065MR696727
5. [5] N. Chakravarti and A.P.M. Wagelmans, Calculation of stability radius for combinatorial optimization problems. Oper. Res. Lett. 23 (1999) 1-7. Zbl0954.90037MR1664225
6. [6] W. Cook, A.M.H. Gerards, A. Schrijver and E. Tardos, Sensitivity theorems in integer linear programming. Math. Program. 34 (1986) 251-264. Zbl0648.90055MR839604
7. [7] A. Crema, An algorithm for the multiparametric 0-1 integer linear programming problem relative to the objective function. Eur. J. Oper. Res. 125 (2000) 18-24. Zbl0972.90049MR1783192
8. [8] A. Crema, The multiparametric 0-1 integer linear programming problem: A unified approach. Eur. J. Oper. Res. 139 (2002) 511-520. Zbl1017.90064MR1893597
9. [9] M. Desrochers and F. Soumis, A reoptimization algorithm for the shortest path problem with time windows. Eur. J. Oper. Res. 35 (1988) 242-254. Zbl0677.90080MR939070
10. [10] M.L. Fisher, W.D. Northup and J.F. Shapiro, Using duality to solve discrete optimization problems: Theory and computational experience. Math. Prog. Study 3 (1975) 56-94. Zbl0367.90087MR444006
11. [11] M.L. Fisher and J.F. Shapiro, Constructive duality in integer programming. SIAM J. Appl. Math. 27 (1974) 31-52. Zbl0299.90010MR351446
12. [12] T. Gal and H.J. Greenberg, Advances in sensitivity analysis and parametric programming. Kluwer Academic Publishers, Boston–Dordrecht–London (1997). Zbl0881.00025
13. [13] R.S Garfinkel and G.L. Nemhauser, Integer programming. Wiley, New York (1972). Zbl0259.90022MR381688
14. [14] A.M. Geoffrion and K. Nauss, Parametric and postoptimality analysis in integer linear programming. Manage. Sci. 23 (1977) 453-466. Zbl0358.90041
15. [15] E.N. Gordeev, The complexity of stability study in discrete optimization problems. Cybernetics questions 133, computer center of the USSR academy of sciences, Moscow (1989) 41–77 (en russe). Zbl0701.90077
16. [16] E.N. Gordeev, Solution stability in a shortest path problem. Discrete Math. 1 (1989) 45-56 (en russe). MR1044234
17. [17] H.J. Greenberg, An annoted bibliography for post-solution analysis in mixed integer programming and combinatorial optimization, in Advances in Computational and Stochastic Optimization, Logic Programming and Heuristic Search, edited by D.L. Woodruff. Kluwer Academic Publishers, Boston, MA (1998) http://carbon.cudenver.edu/ hgreenbe/aboutme/pubrec.html Zbl0914.90204MR1602329
18. [18] D. Gusfield, Sensitivity analysis for combinatorial optimization. Memo. No. UCB/ERL M80/22, Electronics Research Laboratory, Univ. of California, Berkeley, California (1980). Zbl0449.05014
19. [19] D. Gusfield, Parametric combinatorial computing and a problem of program module distribution. J. Association for Computing Machinery 30 (1983) 551-563. Zbl0628.68035MR709832
20. [20] S.V. Hoesel and A. Wagelmans, Sensitivity analysis of the economic lot-sizing problem. Discrete Appl. Math. 45 (1993) 291-312. Zbl0790.90028MR1236732
21. [21] S.V. Hoesel and A. Wagelmans, On the complexity of postoptimality analysis of 0/1 programs. Discrete Appl. Math. 91 (1999) 251-263. Zbl0917.90250MR1670187
22. [22] S. Holm and D. Klein, Three methods for postoptimal analysis in integer linear programming. Math. Prog. Study 21 (1984) 97-109. Zbl0543.90083MR751245
23. [23] L. Jenkins, Parametric-objective integer programming using knapsack facets and Gomory cutting planes. Eur. J. Oper. Res. 31 (1987) 102-109. Zbl0624.90072MR894602
24. [24] L. Jenkins, Parametric methods in integer linear programming. Ann. Oper. Res. 27 (1990) 77-96. Zbl0718.90088MR1088988
25. [25] D. Klein and S. Holm, Discrete right hand-side parametrization for linear integer programs. Eur. J. Oper. Res. 2 (1978) 50-53. Zbl0384.90090
26. [26] D. Klein and S. Holm, Integer programming postoptimal analysis with cutting planes. Manage. Sci. 25 (1979) 64-72. Zbl0442.90067MR530939
27. [27] M.Y. Kovalyev and Y.N Sotskov, $ϵ$-approximate solution stability of boolean linear form minimization. Vesti Akad. Navuk BSSR, Ser. Fiz.-Mat. Navuk 2 2 (1990) 111-116 1990 (en russe). Zbl0699.49030
28. [28] V.K. Leontev, Stability in traveling salesman problem. At. i Mat. Fiz. 15 (1975) 1298-1309 (en russe). MR406446
29. [29] V.K. Leontev, Stability in combinatorial choice problems. Dokl. Akad. Nauk SSSR 1 (1976) 23-25 (en russe). Zbl0356.90043MR401489
30. [30] V.K. Leontev, Stability in linear discrete problems. Cybernet. Probl. 35 (1979) 169-184 (en russe). Zbl0439.93040MR539891
31. [31] M. Libura, Sensitivity analysis for integer knapsack problem. Archiwum Automatyki i Telemechanik 22 (1977) 313-322 (en polonais). Zbl0365.90097MR456461
32. [32] M. Libura, Optimality conditions and sensitivity analysis for combinatorial optimization problems. Control Cybernet. 25 (1996) 1165-1180. Zbl0865.90110MR1454711
33. [33] M. Libura, E.S. Van der Poort, G. Sierksma and J.A.A. Van der Veen, Stability aspects of the traveling salesman problem based on $k$-best solutions. Discrete Appl. Math. 87 (1998) 159-185. Zbl0910.90264MR1650435
34. [34] E. Loukakis and A.P. Muhlemann, Parametrisation algorithms for the integer linear programs in binary variables. Eur. J. Oper. Res. 17 (1984) 104-115. Zbl0542.90063MR749142
35. [35] K. Nauss, Parametric integer programming. Ph.D. thesis, Western Management Science Institute, UCLA (1975). Zbl0453.90054
36. [36] C.J. Piper and A. Zoltners, Implicit enumeration based algorithms for post-optimising zero-one programs. Naval Res. Logist. Quarterly 22 (1975) 791-809. Zbl0354.90057MR434461
37. [37] C.J. Piper and A. Zoltners, Some easy postoptimality analysis for zero-one programming. Manage. Sci. 22 (1976) 759-765. Zbl0325.90048
38. [38] G.M. Roodman, Postoptimality analysis in zero-one programming by implicit enumeration. Naval Res. Logist. Quarterly 19 (1972) 435-447. Zbl0262.90047MR316089
39. [39] G.M. Roodman, Postoptimality analysis in zero-one programming by implicit enumeration. The mixed integer case. Naval Res. Logist. Quarterly 21 (1974) 595-607. Zbl0304.90078MR368756
40. [40] L. Schrage and L. Wolsey, Sensitivity analysis for branch and bound integer programming. Oper. Res. 33 (1985) 1008-1023. Zbl0583.90074MR806917
41. [41] J.F. Shapiro, Generalized lagrange multipliers in integer programming. Oper. Res. 19 (1971) 68-76. Zbl0226.90031MR275877
42. [42] Y.N. Sotskov, Stability of an optimal schedule. Eur. J. Oper. Res. 55 (1991) 91-102. Zbl0755.90048
43. [43] Y.N Sotskov, The stability of the appoximate boolean minimization of a linear form. USSR Comput. Math. Math. Phys. 33 (1993) 699-707. Zbl0799.90110MR1218872
44. [44] Y.N. Sotskov, V.K. Leontev and E.N. Gordeev, Some concepts of stability analysis in combinatorial optimization. Discrete Appl. Math. 58 (1995) 169-190. Zbl0833.90098MR1331170
45. [45] Y.N Sotskov, A.P.M. Wagelmans and F. Werner, On the calculation of the stability radius of an optimal or an approximate schedule. Ann. Oper. Res. 83 (1998) 213-252. Zbl0911.90222MR1661683
46. [46] R.E. Tarjan, Sensitivity analysis of minimum spanning trees and shortest path trees. Inform. Proc. Lett. 14 (1982) 30-33. MR654072
47. [47] B. Thiongane, Réoptimisation dans le dual lagrangien du biknapsack en variables 0-1. Thèse de Doctorat en Informatique, Université de Paris 13 (2003). 
48. [48] B. Thiongane, A. Nagih and G. Plateau, Adapted step size in a 0-1 biknapsack lagrangean dual solving algorithm. En révision pour Ann. Oper. Res. (2002). Zbl1091.90045
49. [49] B. Thiongane, A. Nagih, and G. Plateau, Lagrangean heuristics combined with reoptimization for the 0-1 biknapsack problem. En révision pour Discrete Appl. Math. (2002). Zbl1111.90096
50. [50] A.P.M Wagelmans, Sensitivity analysis in combinatorial optimization. Ph.D. thesis, Eramsus University, Rotterdam (1990). 
51. [51] P. Winter, Steiner problem in networks : A survey. Networks 17 (1987) 129-167. Zbl0646.90028MR883025