{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,27]],"date-time":"2023-08-27T10:56:19Z","timestamp":1693133779145},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2005,10,1]],"date-time":"2005-10-01T00:00:00Z","timestamp":1128124800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2005,10]]},"DOI":"10.1007\/s10479-005-3454-x","type":"journal-article","created":{"date-parts":[[2005,9,15]],"date-time":"2005-09-15T22:31:07Z","timestamp":1126823467000},"page":"353-373","source":"Crossref","is-referenced-by-count":6,"title":["An Adapted Step Size Algorithm for a 0-1 Biknapsack Lagrangean Dual"],"prefix":"10.1007","volume":"139","author":[{"given":"Babacar","family":"Thiongane","sequence":"first","affiliation":[]},{"given":"Anass","family":"Nagih","sequence":"additional","affiliation":[]},{"given":"G\u00e9rard","family":"Plateau","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"5","key":"3454_CR1","doi-asserted-by":"crossref","first-page":"1130","DOI":"10.1287\/opre.28.5.1130","volume":"28","author":"E. Balas","year":"1980","unstructured":"Balas, E. and E. Zemel. (1980). \u201cAn Algorithm for Large Zero-One Knapsack Problems.\u201d Operations Research 28(5), 1130\u20131153.","journal-title":"Operations Research"},{"key":"3454_CR2","unstructured":"Bourgeois, Ph. and G. Plateau. (1992). \u201cSelected Algorithmic Tools for the Resolution of the 0-1 Knapsack Problem.\u201d EURO XII - TIMS XXXI Joint International Conference, Helsinki."},{"key":"3454_CR3","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/BFb0120697","volume":"3","author":"P.M. Camerini","year":"1975","unstructured":"Camerini, P.M., L. Fratta, and F. Maffioli. (1975). \u201cOn Improving Relaxation Methods by Modified Gradient Techniques.\u201d Mathematical Programming Study 3, 26\u201334.","journal-title":"Mathematical Programming Study"},{"key":"3454_CR4","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1007\/BF02591893","volume":"26","author":"P.J. Carstensen","year":"1983","unstructured":"Carstensen, P.J. (1983). \u201cComplexity of Some Parametric Integer and Network Programming Problems.\u201d Mathematical Programming 26, 64\u201375.","journal-title":"Mathematical Programming"},{"key":"3454_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0167-6377(98)00031-5","volume":"23","author":"N. Chakravarti","year":"1999","unstructured":"Chakravarti, N. and A.P.M. Wagelmans. (1999). \u201cCalculation of Stability Radius for Combinatorial Optimization Problems.\u201d Operations Research Letters 23, 1\u20137.","journal-title":"Operations Research Letters"},{"key":"3454_CR6","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/S0377-2217(99)00193-9","volume":"125","author":"A. Crema","year":"2000","unstructured":"Crema, A. (2000). \u201cAn Algorithm for the Multiparametric 0-1 Integer Linear Programming Problem Relative to the Objective Function.\u201d European Journal of Operational Research 125, 18\u201324.","journal-title":"European Journal of Operational Research"},{"key":"3454_CR7","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1016\/S0377-2217(01)00163-1","volume":"139","author":"A. Crema","year":"2002","unstructured":"Crema, A. (2002). \u201cThe Multiparametric 0-1 Integer Linear Programming Problem: A Unified Approach.\u201d European Journal of Operational Research 139, 511\u2013520.","journal-title":"European Journal of Operational Research"},{"key":"3454_CR8","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1016\/0377-2217(88)90034-3","volume":"35","author":"M. Desrochers","year":"1988","unstructured":"Desrochers, M. and F. Soumis. (1988). \u201cA Reoptimization Algorithm for the Shortest Path Problem with Time Windows.\u201d European Journal of Operational Research 35, 242\u2013254.","journal-title":"European Journal of Operational Research"},{"key":"3454_CR9","unstructured":"Fayard, D. and G. Plateau. (1979). \u201cContribution \u00e0 la r\u00e9solution Des Programmes Math\u00e9matiques En Nombres Entiers.\u201d Th\u00e8se de doctorat d'\u00e9tat, Universit\u00e9 des Sciences et Techniques de Lille."},{"key":"3454_CR10","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF02241754","volume":"28","author":"D. Fayard","year":"1982","unstructured":"Fayard, D. and G. Plateau. (1982). \u201cAn Algorithm for the Solution of the 0-1 Knapsack Problem.\u201d Computing 28, 269\u2013287.","journal-title":"Computing"},{"key":"3454_CR11","unstructured":"Fr\u00e9ville, A., L.A.N. Lorena, and G. Plateau. (1990). \u201cEfficient Subgradient Algorithms for the 0-1 Multiknapsack Lagrangean and Surrogate Duals.\u201d Research Report LIPN, Universit\u00e9 de Paris 13."},{"key":"3454_CR12","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1016\/0377-2217(93)90197-U","volume":"68","author":"A. Fr\u00e9ville","year":"1993a","unstructured":"Fr\u00e9ville, A. and G. Plateau. (1993a). \u201cAn Exact Search for the Solution of the Surrogate Dual of the 0-1 Bidimensional Knapsack Problem.\u201d European Journal of Operational Research 68, 413\u2013421.","journal-title":"European Journal of Operational Research"},{"key":"3454_CR13","doi-asserted-by":"crossref","unstructured":"Fr\u00e9ville, A. and G. Plateau. (1993b). \u201cFPBK92: an implicit enumeration code for the solution of the 0-1 bidimensional knapsack problem.\u201d ECCO VI, Bruxelles.","DOI":"10.1016\/0377-2217(93)90197-U"},{"key":"3454_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6103-3","volume-title":"Advances in Sensitivity Analysis and Parametric Programming","author":"T. Gal","year":"1997","unstructured":"Gal, T. and H.J. Greenberg. (1997). Advances in Sensitivity Analysis and Parametric Programming. Boston, Dordrecht, London: Kluwer Academic Publishers."},{"key":"3454_CR15","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1007\/BF02591863","volume":"31","author":"B. Gavish","year":"1985","unstructured":"Gavish, B. and H. Pirkul. (1985). \u201cEfficient Algorithms for Solving Multiconstraint 0-1 Knapsack Problems to Optimality.\u201d Mathematical Programming 31, 78\u2013105.","journal-title":"Mathematical Programming"},{"key":"3454_CR16","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1287\/mnsc.23.5.453","volume":"23","author":"A.M. Geoffrion","year":"1977","unstructured":"Geoffrion, A.M. and K. Nauss. (1977). \u201cParametric and Postoptimality Analysis in Integer Linear Programming.\u201d Management Science 23, 453\u2013466.","journal-title":"Management Science"},{"key":"3454_CR17","volume-title":"Advances in Computational and Stochastic Optimization, Logic Programming and Heuristic Search","author":"H.J. Greenberg","year":"1998","unstructured":"Greenberg, H.J. (1998). \u201cAn Annoted Bibliography for Post-Solution Analysis in Mixed Integer Programming and Combinatorial Optimization.\u201d In D.L. Woodruff (ed.), Advances in Computational and Stochastic Optimization, Logic Programming and Heuristic Search. Boston, MA: Kluwer Academic Publishers."},{"key":"3454_CR18","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BF02592954","volume":"32","author":"M. Guignard","year":"1987","unstructured":"Guignard, M. and S. Kim. (1987). \u201cLagrangean Decomposition: A Model Yielding Stronger Lagrangian Bounds.\u201d Mathematical Programming 32, 215\u2013228.","journal-title":"Mathematical Programming"},{"key":"3454_CR19","first-page":"307","volume":"21","author":"M. Guignard","year":"1987","unstructured":"Guignard, M. and S. Kim. (1987). \u201cLagrangean Decomposition for Integer Programming: Theory and Applications.\u201d RAIRO-Recherche Op\u00e9rationnelle 21, 307\u2013324.","journal-title":"RAIRO-Recherche Op\u00e9rationnelle"},{"key":"3454_CR20","unstructured":"Gusfield, D. (1980). \u201cSensitivity Analysis for Combinatorial Optimization.\u201d Memo. No. UCB\/ERL M80\/22, Electronics Research Laboratory, Univ. of California, Berkeley, California."},{"issue":"3","key":"3454_CR21","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1145\/2402.322391","volume":"30","author":"D. Gusfield","year":"1983","unstructured":"Gusfield, D. (1983). \u201cParametric Combinatorial Computing and A Problem of Program Module Distribution.\u201d Journal of the Association for Computing Machinery 30(3), 551\u2013563.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"3454_CR22","unstructured":"Hanafi, S. (1993). \u201cContribution \u00e0 la r\u00e9solution De Probl\u00e8mes Duaux De Grandes Tailles En Optimisation Combinatoire.\u201d Ph.D, Universit\u00e9 de Valenciennes et du Hainaut Cambr\u00e9sis."},{"key":"3454_CR23","unstructured":"Hanafi, S. (2002). \u201cM\u00e9taheuristiques et dualit\u00e9 en Optimisation Combinatoire: Th\u00e9orie et Applications.\u201d Habilitation \u00e0 Diriger des Recherches, Universit\u00e9 de Valenciennes et du Hainaut Cambr\u00e9sis."},{"key":"3454_CR24","unstructured":"Hanafi, S. and A. Fr\u00e9ville. (2001). \u201cR\u00e9solution Du Dual Composite Du Sac \u00e0 Dos Bidimensionnel En variables 0-1 par une m\u00e9thode de branch and bound.\u201d FRANCORO III, Qu\u00e9bec."},{"key":"3454_CR25","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BFb0121213","volume":"21","author":"S. Holm","year":"1984","unstructured":"Holm, S. and D. Klein. (1984). \u201cThree Methods for Postoptimal Analysis in Integer Linear Programming.\u201d Mathematical Programming Study 21, 97\u2013109.","journal-title":"Mathematical Programming Study"},{"key":"3454_CR26","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1145\/321812.321823","volume":"21","author":"E. Horowitz","year":"1974","unstructured":"Horowitz, E. and S. Sahni. (1974). \u201cComputing Partitions with Application to the Knapsack Problems.\u201d Journal of the Association for Computing Machinery 21, 275\u2013292.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"3454_CR27","unstructured":"ILOG Inc. (2000) CPLEX Callable Library 7.0. Reference Manuel. ILOG."},{"key":"3454_CR28","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1016\/0377-2217(87)90143-3","volume":"31","author":"L. Jenkins","year":"1987","unstructured":"Jenkins, L. (1987). \u201cParametric-Objective Integer Programming Using Knapsack Facets and Gomory Cutting Planes.\u201d European Journal of Operational Research 31, 102\u2013109.","journal-title":"European Journal of Operational Research"},{"key":"3454_CR29","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BF02055191","volume":"27","author":"L. Jenkins","year":"1990","unstructured":"Jenkins, L. (1990). \u201cParametric Methods in Integer Linear Programming.\u201d Annals of Operations Research 27, 77\u201396.","journal-title":"Annals of Operations Research"},{"key":"3454_CR30","doi-asserted-by":"crossref","first-page":"1251","DOI":"10.1287\/opre.28.5.1251","volume":"28","author":"M.H. Karwan","year":"1980","unstructured":"Karwan, M.H. and R.L. Rardin. (1980). \u201cSearchability of the Composite and Multiple Surrogate Dual Functions.\u201d Operations Research 28, 1251\u20131257.","journal-title":"Operations Research"},{"issue":"6","key":"3454_CR31","first-page":"1165","volume":"25","author":"M. Libura","year":"1996","unstructured":"Libura, M. (1996). \u201cOptimality Conditions and Sensitivity Analysis for Combinatorial Optimization Problems.\u201d Control and Cybernetics 25(6), 1165\u20131180.","journal-title":"Control and Cybernetics"},{"key":"3454_CR32","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/0377-2217(84)90013-4","volume":"17","author":"E. Loukakis","year":"1984","unstructured":"Loukakis, E. and A.P. Muhlemann. (1984). \u201cParametrisation Algorithms for the Integer Linear Programs in Binary Variables.\u201d European Journal of Operational Research 17, 104\u2013115.","journal-title":"European Journal of Operational Research"},{"key":"3454_CR33","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF02252196","volume":"21","author":"S. Martello","year":"1978","unstructured":"Martello, S. and P. Toth. (1978). \u201cAlgorithm for the Solution of the 0-1 Single Knapsack.\u201d Computing 21, 81\u201386.","journal-title":"Computing"},{"issue":"2","key":"3454_CR34","first-page":"127","volume":"2","author":"Ph. Michelon","year":"1991","unstructured":"Michelon, Ph. (1991). \u201cM\u00e9thodes Lagrangiennes pour programmation lin\u00e9aire avec variables enti\u00e8res.\u201d Investigaci\u00f3n Operativa 2(2), 127\u2013146.","journal-title":"Investigaci\u00f3n Operativa"},{"key":"3454_CR35","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/BF01582893","volume":"52","author":"Ph. Michelon","year":"1991","unstructured":"Michelon, Ph. and N. Maculan. (1991). \u201cLagrangean Decomposition for Integer Nonlinear Programming.\u201d Mathematical Programming 52, 303\u2013313.","journal-title":"Mathematical Programming"},{"key":"3454_CR36","doi-asserted-by":"crossref","unstructured":"Nauss, K. (1975). \u201cParametric Integer Programming.\u201d PhD thesis, Western Management Science Institute, UCLA.","DOI":"10.21236\/ADA006401"},{"key":"3454_CR37","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1287\/mnsc.22.7.759","volume":"22","author":"C.J. Piper","year":"1976","unstructured":"Piper, C.J. and A. Zoltners. (1976). \u201cSome Easy Postoptimality Analysis for Zero-One Programming.\u201d Management Science 22, 759\u2013765.","journal-title":"Management Science"},{"key":"3454_CR38","first-page":"277","volume":"49","author":"G. Plateau","year":"1985","unstructured":"Plateau, G. and M. Elkihel. (1985). \u201cA Hybrid Method for the 0-1 Knapsack Problem.\u201d Methods of Operations Research 49, 277\u2013293.","journal-title":"Methods of Operations Research"},{"issue":"2","key":"3454_CR39","first-page":"1","volume":"52","author":"H. Reinoso","year":"1992","unstructured":"Reinoso, H. and N. Maculan. (1992). \u201cLagrangean Decomposition for Integer Programming: A New Scheme.\u201d INFOR 52(2), 1\u20135.","journal-title":"INFOR"},{"key":"3454_CR40","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1002\/nav.3800210404","volume":"21","author":"G.M. Roodman","year":"1974","unstructured":"Roodman, G.M. (1974). \u201cPostoptimality Analysis in Zero-One Programming by Implicit Enumeration: The Mixed Integer Case.\u201d Naval Research Logistics Quarterly 21, 595\u2013607.","journal-title":"Naval Research Logistics Quarterly"},{"key":"3454_CR41","doi-asserted-by":"crossref","first-page":"1008","DOI":"10.1287\/opre.33.5.1008","volume":"33","author":"L. Schrage","year":"1985","unstructured":"Schrage, L. and L. Wolsey. (1985). \u201cSensitivity Analysis for Branch and Bound Integer Programming.\u201d Operations Research 33, 1008\u20131023.","journal-title":"Operations Research"},{"key":"3454_CR42","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1057\/jors.1979.78","volume":"30","author":"W. Shih","year":"1979","unstructured":"Shih, W. (1979). \u201cA Branch and Bound Method for the Multiconstraint 0-1 Knapsack Problem.\u201d Journal of the Operations Research Society 30, 369\u2013378.","journal-title":"Journal of the Operations Research Society"},{"key":"3454_CR43","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0166-218X(93)E0126-J","volume":"58","author":"Y.N. Sotskov","year":"1995","unstructured":"Sotskov, Y.N., V.K. Leontev, and E.N. Gordeev. (1995). \u201cSome Concepts of Stability Analysis in Combinatorial Optimization.\u201d Discrete Applied Mathematics 58, 169\u2013190.","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"3454_CR44","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1051\/ro:2004002","volume":"37","author":"B. Thiongane","year":"2003a","unstructured":"Thiongane, B., A. Nagih, and G. Plateau. (2003a). \u201cAnalyse de sensibilit\u00e9 pour les probl\u00e8mes lin\u00e9aires en variables 0-1.\u201d RAIRO\/Operations Research 37(4), 291\u2013309.","journal-title":"RAIRO\/Operations Research"},{"key":"3454_CR45","unstructured":"Thiongane, B., A. Nagih, and G. Plateau. (2003b). \u201cTheoretical and Algorithmic Study for Parametric 0-1 Linear Programs Relative to the Objective Function.\u201d Submitted for publica- tion."},{"key":"3454_CR46","unstructured":"Thiongane, B., A. Nagih, and G. Plateau. (2004). \u201cLagrangean Heuristics Combined with Reoptimization for the 0-1 Biknapsack Problem.\u201d In revision for Discrete Applied Mathematics."},{"key":"3454_CR47","unstructured":"Wagelmans, A.P.M. (1990). \u201cSensitivity Analysis in Combinatorial Optimization.\u201d Ph.D, Eramsus University, Rotterdam."},{"issue":"15","key":"3454_CR48","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1287\/opre.15.1.83","volume":"11","author":"H.M. Weingartner","year":"1967","unstructured":"Weingartner, H.M. and D.N. Ness. (1967). \u201cMethod for the Solution of the Multidimensional 0-1 Knapsack Problem.\u201d Operations Research 11(15), 83\u2013103.","journal-title":"Operations Research"},{"key":"3454_CR49","unstructured":"Yu, G. (1990). \u201cAlgorithms for Optimizing Piecewise Linear Functions and Degree Constrained Minimum Spanning Tree Problems.\u201d Ph.D, University of Pennsylvania."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-005-3454-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-005-3454-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-005-3454-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T14:28:00Z","timestamp":1586442480000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-005-3454-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,10]]},"references-count":49,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,10]]}},"alternative-id":["3454"],"URL":"https:\/\/doi.org\/10.1007\/s10479-005-3454-x","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,10]]}}}