{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T16:58:19Z","timestamp":1772297899733,"version":"3.50.1"},"reference-count":12,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5311,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1999,1]]},"DOI":"10.1016\/s0166-218x(98)00151-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T12:07:13Z","timestamp":1027598833000},"page":"251-263","source":"Crossref","is-referenced-by-count":43,"title":["On the complexity of postoptimality analysis of 01 programs"],"prefix":"10.1016","volume":"91","author":[{"given":"Stan","family":"Van Hoesel","sequence":"first","affiliation":[]},{"given":"Albert","family":"Wagelmans","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(98)00151-6_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0167-6377(98)00031-5","article-title":"Calculation of stability radii for combinatorial optimization problems","volume":"23","author":"Chakravarti","year":"1999","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0166-218X(98)00151-6_BIB2","article-title":"Postoptimal Analysis, Parametric Programming and Related Topics","author":"Gal","year":"1979"},{"key":"10.1016\/S0166-218X(98)00151-6_BIB3","doi-asserted-by":"crossref","first-page":"973","DOI":"10.1016\/S0041-5553(83)80141-4","article-title":"Computational algorithms for finding the radius of stability in selection problems","volume":"23","author":"Gordeev","year":"1983","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"10.1016\/S0166-218X(98)00151-6_BIB4","series-title":"Advances in Computational and Stochastic Optimization, Logic Programming, and Heuristic Search","first-page":"97","article-title":"An annotated bibliography for post-solution analysis in mixed integer and combinatorial optimization","author":"Greenberg","year":"1998"},{"key":"10.1016\/S0166-218X(98)00151-6_BIB5","series-title":"The Traveling Salesman Problem","first-page":"37","article-title":"Computational complexity","author":"Johnson","year":"1985"},{"key":"10.1016\/S0166-218X(98)00151-6_BIB6","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1080\/02331939508844080","article-title":"Optimal schedules with infinitely large stability radius","volume":"33","author":"Kravchenko","year":"1995","journal-title":"Optimization"},{"key":"10.1016\/S0166-218X(98)00151-6_BIB7","article-title":"Stability aspects of the traveling salesman problem based on the k-best solutions","author":"Libura","year":"1999","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(98)00151-6_BIB8","first-page":"34","article-title":"Complexity of determining exact tolerances for min-sum and min-max combinatorial optimization problems","author":"Ramaswamy","year":"1995"},{"key":"10.1016\/S0166-218X(98)00151-6_BIB9","first-page":"699","article-title":"The stability of the approximate boolean minimization of a linear form","volume":"33","author":"Sotskov","year":"1993","journal-title":"USSR Comput.Math. Math. Phys."},{"key":"10.1016\/S0166-218X(98)00151-6_BIB10","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0166-218X(93)E0126-J","article-title":"Some concepts of stability analysis in combinatorial optimization","volume":"58","author":"Sotskov","year":"1995","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(98)00151-6_BIB11","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1023\/A:1018960030420","article-title":"On the calculation of the stability radius of an optimal or an approximate schedule","volume":"83","author":"Sotskov","year":"1998","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/S0166-218X(98)00151-6_BIB12","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1287\/mnsc.31.5.564","article-title":"The tolerance approach to sensitivity analysis in linear programming","volume":"31","author":"Wendell","year":"1985","journal-title":"Management Sci."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X98001516?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X98001516?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T07:23:34Z","timestamp":1556263414000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X98001516"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,1]]},"references-count":12,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1999,1]]}},"alternative-id":["S0166218X98001516"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(98)00151-6","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1999,1]]}}}