{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,24]],"date-time":"2025-09-24T08:49:21Z","timestamp":1758703761372},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540351573"},{"type":"electronic","value":"9783540351580"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11775096_19","type":"book-chapter","created":{"date-parts":[[2006,6,22]],"date-time":"2006-06-22T08:40:18Z","timestamp":1150965618000},"page":"194-206","source":"Crossref","is-referenced-by-count":10,"title":["Some Basics on Tolerances"],"prefix":"10.1007","author":[{"given":"Boris","family":"Goldengorin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerold","family":"J\u00e4ger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Molitor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1287\/opre.39.1.150","volume":"39","author":"E. Balas","year":"1991","unstructured":"Balas, E., Saltzman, M.J.: An algorithm for the three-index assignment problem. Oper. Res.\u00a039, 150\u2013161 (1991)","journal-title":"Oper. Res."},{"key":"19_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4471-3886-0","volume-title":"Digraphs: Theory, Algorithms and Applications","author":"J. Bang-Jensen","year":"2002","unstructured":"Bang-Jensen, J., Gutin, G.: Digraphs: Theory, Algorithms and Applications. Springer, London (2002)"},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0022-0000(78)90022-3","volume":"16","author":"F. Chin","year":"1978","unstructured":"Chin, F., Hock, D.: Algorithms for Updating Minimal Spanning Trees. J. Comput. System Sci.\u00a016, 333\u2013344 (1978)","journal-title":"J. Comput. System Sci."},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Gal, T.: Sensitivity Analysis, Parametric Programming, and Related Topics: Degeneracy, Multicriteria Decision Making, Redundancy. W. de Gruyter, Berlin (1995)","DOI":"10.1515\/9783110871203"},{"key":"19_CR5","series-title":"Internat. Ser. Oper. Res. Management Sci","volume-title":"Advances in Sensitivity Analysis and Parametric Programming","year":"1997","unstructured":"Gal, T., Greenberg, H.J. (eds.): Advances in Sensitivity Analysis and Parametric Programming. Internat. Ser. Oper. Res. Management Sci., vol.\u00a06. Kluwer Academic Publishers, Boston (1997)"},{"key":"19_CR6","unstructured":"Goldengorin, B., J\u00e4ger, G.: How To Make a Greedy Heuristic for the Asymmetric Traveling Salesman Competitive. SOM Research Report 05A11, University of Groningen, The Netherlands (2005), http:\/\/som.eldoc.ub.rug.nl\/reports\/themeA\/2005\/05A11\/"},{"key":"19_CR7","unstructured":"Goldengorin, B., J\u00e4ger, G., Molitor, P.: Some Basics on Tolerances. SOM Research Report 05A13, University of Groningen, The Netherlands (2005), http:\/\/som.eldoc.ub.rug.nl\/reports\/themeA\/2005\/05A13\/"},{"key":"19_CR8","unstructured":"Goldengorin, B., Sierksma, G.: Combinatorial optimization tolerances calculated in linear time. SOM Research Report 03A30, University of Groningen, The Netherlands (2003), http:\/\/som.eldoc.ub.rug.nl\/reports\/themeA\/2003\/03A30\/"},{"key":"19_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-540-30559-0_19","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"B. Goldengorin","year":"2004","unstructured":"Goldengorin, B., Sierksma, G., Turkensteen, M.: Tolerance Based Algorithms for the ATSP. In: Hromkovi\u010d, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol.\u00a03353, pp. 222\u2013234. Springer, Heidelberg (2004)"},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1016\/S0041-5553(83)80141-4","volume":"23","author":"E.N. Gordeev","year":"1983","unstructured":"Gordeev, E.N., Leontev, V.K., Sigal, I.K.: Computational algorithms for finding the radius of stability in selection problems. USSR Comput. Math. Math. Phys.\u00a023, 973\u2013979 (1983)","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"19_CR11","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/978-1-4757-2807-1_4","volume-title":"Advances in Computational and Stochastic Optimization, Logic Programming, and Heuristic Search","author":"H.J. Greenberg","year":"1998","unstructured":"Greenberg, H.J.: An annotated bibliography for post-solution analysis in mixed integer and combinatorial optimization. In: Woodruff, D.L. (ed.) Advances in Computational and Stochastic Optimization, Logic Programming, and Heuristic Search, pp. 97\u2013148. Kluwer Academic Publishers, Dordrecht (1998)"},{"key":"19_CR12","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1002\/net.3230130204","volume":"13","author":"D. Gusfield","year":"1983","unstructured":"Gusfield, D.: A note on arc tolerances in sparse minimum-path and network flow problems. Networks\u00a013, 191\u2013196 (1983)","journal-title":"Networks"},{"key":"19_CR13","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/S0377-2217(99)00284-2","volume":"126","author":"K. Helsgaun","year":"2000","unstructured":"Helsgaun, K.: An effective implementation of the Lin-Kernighan traveling salesman heuristic. European J. Oper. Res.\u00a0126, 106\u2013130 (2000)","journal-title":"European J. Oper. Res."},{"key":"19_CR14","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1080\/02331939508844080","volume":"33","author":"S.A. Kravchenko","year":"1995","unstructured":"Kravchenko, S.A., Sotskov, Y.N., Werner, F.: Optimal schedules with infinitely large stability radius. Optimization\u00a033, 271\u2013280 (1995)","journal-title":"Optimization"},{"key":"19_CR15","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0166-218X(91)90044-W","volume":"30","author":"M. Libura","year":"1991","unstructured":"Libura, M.: Sensitivity analysis for minimum hamiltonian path and traveling salesman problems. Discrete Appl. Math.\u00a030, 197\u2013211 (1991)","journal-title":"Discrete Appl. Math."},{"key":"19_CR16","doi-asserted-by":"publisher","first-page":"682","DOI":"10.1287\/opre.16.3.682","volume":"16","author":"K.G. Murty","year":"1968","unstructured":"Murty, K.G.: An algorithm for ranking all the assignments in order of increasing cost. Oper. Res.\u00a016, 682\u2013687 (1968)","journal-title":"Oper. Res."},{"key":"19_CR17","unstructured":"Ramaswamy, R., Chakravarti, N.: Complexity of determining exact tolerances for min-sum and min-max combinatorial optimization problems. Working Paper WPS-247\/95, Indian Institute of Management, Calcutta, India, p. 34 (1995)"},{"key":"19_CR18","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/s10107-004-0517-8","volume":"102","author":"R. Ramaswamy","year":"2005","unstructured":"Ramaswamy, R., Orlin, J.B., Chakravarti, N.: Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs. Math. Program., Ser. A\u00a0102, 355\u2013369 (2005)","journal-title":"Math. Program., Ser. A"},{"key":"19_CR19","volume-title":"Mathematical Programming","author":"N.V. Reinfeld","year":"1958","unstructured":"Reinfeld, N.V., Vogel, W.R.: Mathematical Programming. Prentice-Hall, Englewood Cliffs (1958)"},{"key":"19_CR20","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1002\/net.3230100402","volume":"10","author":"D.R. Shier","year":"1980","unstructured":"Shier, D.R., Witzgall, C.: Arc tolerances in minimum-path and network flow problems. Networks\u00a010, 277\u2013291 (1980)","journal-title":"Networks"},{"key":"19_CR21","first-page":"699","volume":"33","author":"Y.N. Sotskov","year":"1993","unstructured":"Sotskov, Y.N.: The stability of the approximate boolean minimization of a linear form. USSR Comput. Math. Math. Phys.\u00a033, 699\u2013707 (1993)","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"19_CR22","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0166-218X(93)E0126-J","volume":"58","author":"Y.N. Sotskov","year":"1995","unstructured":"Sotskov, Y.N., Leontev, V.K., Gordeev, E.N.: Some concepts of stability analysis in combinatorial optimization. Discrete Appl. Math.\u00a058, 169\u2013190 (1995)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"19_CR23","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/0020-0190(82)90137-5","volume":"14","author":"R.E. Tarjan","year":"1982","unstructured":"Tarjan, R.E.: Sensitivity Analysis of Minimum Spanning Trees and Shortest Path Trees. Inform. Process. Lett.\u00a014(1), 30\u201333 (1982)","journal-title":"Inform. Process. Lett."},{"key":"19_CR24","unstructured":"Turkensteen, M., Ghosh, D., Goldengorin, B., Sierksma, G.: Tolerance-Based Branch and Bound Algorithms. In: Maroto, C., et al. (eds.) Proceedings of a EURO conference for young OR researches and practitioners, ORP3 2005, Valencia, Spain, September 6\u201310, pp. 171\u2013182 (2005)"},{"key":"19_CR25","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1016\/S0305-0548(98)00070-7","volume":"26","author":"E.S. Poort Van der","year":"1999","unstructured":"Van der Poort, E.S., Libura, M., Sierksma, G., Van der Veen, J.A.A.: Solving the k-best traveling salesman problem. Comput. Oper. Res.\u00a026, 409\u2013425 (1999)","journal-title":"Comput. Oper. Res."},{"key":"19_CR26","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0166-218X(98)00151-6","volume":"91","author":"S. Hoesel Van","year":"1999","unstructured":"Van Hoesel, S., Wagelmans, A.: On the complexity of postoptimality analysis of 0\/1 programs. Discrete Appl. Math.\u00a091, 251\u2013263 (1999)","journal-title":"Discrete Appl. Math."},{"key":"19_CR27","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1016\/j.ejor.2004.09.015","volume":"169","author":"A. Volgenant","year":"2006","unstructured":"Volgenant, A.: An addendum on sensitivity analysis of the optimal assignment. European J. Oper. Res.\u00a0169, 338\u2013339 (2006)","journal-title":"European J. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11775096_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:14:36Z","timestamp":1619507676000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11775096_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540351573","9783540351580"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/11775096_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}