{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:13:33Z","timestamp":1773656013250,"version":"3.50.1"},"reference-count":12,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1991,2,1]],"date-time":"1991-02-01T00:00:00Z","timestamp":665366400000},"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":8202,"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":[[1991,2]]},"DOI":"10.1016\/0166-218x(91)90044-w","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"197-211","source":"Crossref","is-referenced-by-count":38,"title":["Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems"],"prefix":"10.1016","volume":"30","author":[{"given":"Marek","family":"Libura","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(91)90044-W_BIB1","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0022-0000(78)90022-3","article-title":"Algorithm for updating minimal spanning trees","volume":"16","author":"Chin","year":"1978","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0166-218X(91)90044-W_BIB2","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1287\/mnsc.23.5.453","article-title":"Parametric and postoptimality analysis in integer programming","volume":"23","author":"Geoffrion","year":"1977","journal-title":"Management Sci."},{"key":"10.1016\/0166-218X(91)90044-W_BIB3","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1002\/net.3230130204","article-title":"A note on arc tolerances in sparse minimum-path and network flow problems","volume":"13","author":"Gusfield","year":"1983","journal-title":"Networks"},{"key":"10.1016\/0166-218X(91)90044-W_BIB4","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1137\/0213024","article-title":"Fast algorithms for finding nearest common ancestor","volume":"13","author":"Harel","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(91)90044-W_BIB5","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/BF02579450","article-title":"Maximum and k-maximal spanning trees of a weighted graph","volume":"7","author":"Kano","year":"1987","journal-title":"Combinatorica"},{"key":"10.1016\/0166-218X(91)90044-W_BIB6","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF02579443","article-title":"Linear verification for spanning trees","volume":"5","author":"Koml\u00f3s","year":"1985","journal-title":"Combinatorica"},{"key":"10.1016\/0166-218X(91)90044-W_BIB7","series-title":"The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization","author":"Lawler","year":"1985"},{"key":"10.1016\/0166-218X(91)90044-W_BIB8","first-page":"131","article-title":"Sensitivity analysis of optimal solutions for minimum Hamiltonian path","volume":"84","author":"Libura","year":"1986","journal-title":"Zeszyty Nauk. Politech. \u015ala\u0327skiej: Automatyka"},{"key":"10.1016\/0166-218X(91)90044-W_BIB9","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1002\/net.3230100402","article-title":"Arc tolerances in minimum-path and network flow problems","volume":"10","author":"Shier","year":"1980","journal-title":"Networks"},{"key":"10.1016\/0166-218X(91)90044-W_BIB10","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1145\/321879.321884","article-title":"Efficiency of a good but not linear set union algorithm","volume":"22","author":"Tarian","year":"1975","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(91)90044-W_BIB11","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1145\/322154.322161","article-title":"Applications of path compression of balanced trees","volume":"26","author":"Tarjan","year":"1979","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(91)90044-W_BIB12","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/0020-0190(82)90137-5","article-title":"Sensitivity analysis of minimum spanning trees and shortest path trees","volume":"14","author":"Tarjan","year":"1982","journal-title":"Inform. Process. Lett."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9190044W?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9190044W?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:58:14Z","timestamp":1555135094000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9190044W"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,2]]},"references-count":12,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1991,2]]}},"alternative-id":["0166218X9190044W"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(91)90044-w","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1991,2]]}}}