{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T15:38:36Z","timestamp":1649000316261},"reference-count":11,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1999,8,1]],"date-time":"1999-08-01T00:00:00Z","timestamp":933465600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[1999,8]]},"DOI":"10.1016\/s0167-6377(99)00026-7","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:03:44Z","timestamp":1027641824000},"page":"33-37","source":"Crossref","is-referenced-by-count":1,"title":["A reverse search algorithm for the neighborhood problem"],"prefix":"10.1016","volume":"25","author":[{"given":"Carlo","family":"Filippi","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(99)00026-7_BIB1","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/BF02023098","article-title":"Bounds on the number of vertices of perturbed polyhedra","volume":"47","author":"Armand","year":"1993","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/S0167-6377(99)00026-7_BIB2","unstructured":"D. Avis, A C implementation of the reverse search vertex enumeration algorithm, Technical Report, School of Computer Science, McGill University of Technology, Montreal, Canada, June 1993. (The code available at ftp:\/\/mutt.cs.mcgill.ca\/pub\/C\/lrs.html.)"},{"key":"10.1016\/S0167-6377(99)00026-7_BIB3","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/S0925-7721(96)00023-5","article-title":"How good are convex hull algorithms?","volume":"7","author":"Avis","year":"1997","journal-title":"Comput. Geom. Theor. Appl."},{"key":"10.1016\/S0167-6377(99)00026-7_BIB4","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF02293050","article-title":"A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra","volume":"8","author":"Avis","year":"1992","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0167-6377(99)00026-7_BIB5","unstructured":"C. Filippi, A reverse search algorithm for the neighborhood problem, Technical Report 6\/97, Dipartimento di Matematica, Universit\u00e0 di Padova, Padova, Italy, May 1997. (Available in ps format at http:\/\/www.math.unipd.it\/\u223ccarlo\/ri0697.html.)"},{"key":"10.1016\/S0167-6377(99)00026-7_BIB6","unstructured":"T. Gal, Determination of all neighbors of a degenerate extreme point in polytopes, Discussion Paper 17b, Department of Economics, Fern Universit\u00e4t, Hagen, Germany, 1978."},{"key":"10.1016\/S0167-6377(99)00026-7_BIB7","doi-asserted-by":"crossref","unstructured":"T. Gal, Postoptimal Analysis, Parametric Programming and Related Topics, 2nd ed., Walter deGruyter, Berlin, 1995.","DOI":"10.1515\/9783110871203"},{"key":"10.1016\/S0167-6377(99)00026-7_BIB8","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/BF02023105","article-title":"An improved N-tree algorithm for the enumeration of all neighbors of a degenerate vertex","volume":"47","author":"Geue","year":"1993","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"10.1016\/S0167-6377(99)00026-7_BIB9","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/S0377-2217(96)00172-5","article-title":"Sensitivity analysis in linear programming: just be careful! European","volume":"101","author":"Jansen","year":"1997","journal-title":"J. Oper. Res."},{"key":"10.1016\/S0167-6377(99)00026-7_BIB10","doi-asserted-by":"crossref","unstructured":"H.-J. Kruse, Degeneracy Graphs and the Neighbourhood Problem, Springer, Englewood Cliffs, NJ, 1986.","DOI":"10.1007\/978-3-642-49270-9"},{"key":"10.1016\/S0167-6377(99)00026-7_BIB11","unstructured":"K.G. Murty, Linear Programming, Wiley, New York, 1983."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637799000267?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637799000267?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,30]],"date-time":"2020-01-30T05:39:48Z","timestamp":1580362788000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637799000267"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,8]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1999,8]]}},"alternative-id":["S0167637799000267"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(99)00026-7","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1999,8]]}}}