{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T21:41:34Z","timestamp":1781386894433,"version":"3.54.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2000,10,1]],"date-time":"2000-10-01T00:00:00Z","timestamp":970358400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,10,1]],"date-time":"2000-10-01T00:00:00Z","timestamp":970358400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Optimization and Applications"],"published-print":{"date-parts":[[2000,10]]},"DOI":"10.1023\/a:1008779125567","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T11:37:32Z","timestamp":1040557052000},"page":"61-84","source":"Crossref","is-referenced-by-count":97,"title":["A Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints"],"prefix":"10.1007","volume":"17","author":[{"given":"Norbert","family":"Ascheuer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"J\u00fcnger","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gerhard","family":"Reinelt","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"272482_CR1","volume-title":"Ein Schnittebenenverfahren f\u00fcr ein Reihenfolgeproblem in der flexiblen Fertigung","author":"N. Ascheuer","year":"1989","unstructured":"N. Ascheuer, \u201cEin Schnittebenenverfahren f\u00fcr ein Reihenfolgeproblem in der flexiblen Fertigung,\u201d Master's Thesis, Universit\u00e4t Augsburg, Germany, 1989."},{"key":"272482_CR2","unstructured":"N. Ascheuer, \u201cHamiltonian path problems in the on-line optimization of flexible manufacturing systems,\u201d PhD Thesis, Tech. Univ. Berlin, 1995. Avail. at URL http:\/\/www.zib.de\/ZIBbib\/Publications\/."},{"key":"272482_CR3","first-page":"19","volume-title":"Integer Programming and Combinatorial Optimization","author":"N. Ascheuer","year":"1990","unstructured":"N. Ascheuer, L. Escudero, M. Gr\u00f6tschel, and M. Stoer, \u201cOn identifying in polynomial time violated subtour elimination and precedence forcing constraints for the sequential ordering problem,\u201d in Integer Programming and Combinatorial Optimization, R. Kannan and W.R. Pulleyblank (Eds.), University ofWaterloo: Waterloo, 1990, pp. 19-28."},{"key":"272482_CR4","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1137\/0803002","volume":"3","author":"N. Ascheuer","year":"1993","unstructured":"N. Ascheuer, L. Escudero, M. Gr\u00f6tschel, and M. Stoer, \u201cA cutting plane approach to the sequential ordering problem (with applications to job scheduling in manufacturing),\u201d SIAM Journal on Optimization, vol. 3, pp. 25-42, 1993.","journal-title":"SIAM Journal on Optimization"},{"key":"272482_CR5","unstructured":"N. Ascheuer, M. J\u00fcnger, and G. Reinelt, \u201cHeuristic algorithms for the ATSP with precedence constraints-A computational comparison,\u201d In preparation."},{"key":"272482_CR6","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF01581274","volume":"58","author":"E. Balas","year":"1993","unstructured":"E. Balas and M. Fischetti, \u201cA lifting procedure for the asymmetric traveling salesman polytope and a large new class of facets,\u201d Mathematical Programming, vol. 58, pp. 325-352, 1993.","journal-title":"Mathematical Programming"},{"key":"272482_CR7","first-page":"241","volume":"68","author":"E. Balas","year":"1995","unstructured":"E. Balas, M. Fischetti, and W. Pulleyblank, \u201cThe precedence constrained asymmetric traveling salesman polytope,\u201d Math. Prog., vol. 68, pp. 241-265, 1995.","journal-title":"Math. Prog."},{"key":"272482_CR8","series-title":"Technical Report CMU-RI-TR-96-27","volume-title":"Commonality and genetic algorithms","author":"S. Chen","year":"1996","unstructured":"S. Chen and S. Smith, \u201cCommonality and genetic algorithms,\u201d Technical Report CMU-RI-TR-96-27, Carnegie Mellon University, Pittsburgh, 1996."},{"key":"272482_CR9","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1016\/0377-2217(88)90333-5","volume":"37","author":"L.F. Escudero","year":"1988","unstructured":"L.F. Escudero, \u201cAn inexact algorithm for the sequential ordering problem,\u201d European Journal of Operational Research, vol. 37, pp. 236-253, 1988.","journal-title":"European Journal of Operational Research"},{"key":"272482_CR10","first-page":"117","volume":"3","author":"L.F. Escudero","year":"1988","unstructured":"L.F. Escudero, \u201cOn the implementation of an algorithm for improving a solution to the sequential ordering problem,\u201d Trabajos de Investigacion-Operativa, vol. 3, pp. 117-140, 1988.","journal-title":"Trabajos de Investigacion-Operativa"},{"key":"272482_CR11","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/BF02085641","volume":"50","author":"L.F. Escudero","year":"1994","unstructured":"L.F. Escudero, M. Guignard, and K. Malik, \u201cA Lagrangean relax-and-cut approach for the sequential ordering problem with precedence constraints,\u201d Annals of Operations Research, vol. 50, pp. 219-237, 1994.","journal-title":"Annals of Operations Research"},{"key":"272482_CR12","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1287\/moor.16.1.42","volume":"16","author":"M. Fischetti","year":"1991","unstructured":"M. Fischetti, \u201cFacets of the asymmetric traveling salesman polytope,\u201d Mathematics of Operations Research, vol. 16, pp. 42-56, 1991.","journal-title":"Mathematics of Operations Research"},{"issue":"11","key":"272482_CR13","doi-asserted-by":"crossref","first-page":"1520","DOI":"10.1287\/mnsc.43.11.1520","volume":"43","author":"M. Fischetti","year":"1997","unstructured":"M. Fischetti and P. Toth, \u201cApolyhedral approach to the asymmetric traveling salesman problem,\u201d Management Science, vol. 43, no. 11, pp. 1520-1536, 1997.","journal-title":"Management Science"},{"key":"272482_CR14","series-title":"Technical Report IDSIA-11-97","volume-title":"HAS-SOP: Hybrid ant system for the sequential ordering problem","author":"L.M. Gambardella","year":"1997","unstructured":"L.M. Gambardella and M. Dorigo, \u201cHAS-SOP: Hybrid ant system for the sequential ordering problem,\u201d Technical Report IDSIA-11-97, IDSIA, Lugano, Switzerland, 1997."},{"key":"272482_CR15","volume-title":"Polyedrische Charakterisierungen kombinatorischer Optimierungsprobleme","author":"M. Gr\u00f6tschel","year":"1977","unstructured":"M. Gr\u00f6tschel, \u201cPolyedrische Charakterisierungen kombinatorischer Optimierungsprobleme,\u201d Hain: Meisenheim am Glan, 1977."},{"key":"272482_CR16","volume-title":"The Traveling Salesman Problem","author":"M. Gr\u00f6tschel","year":"1985","unstructured":"M. Gr\u00f6tschel and M. Padberg, \u201cPolyhedral theory,\u201d in The Traveling Salesman Problem, E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys (Eds.), John Wiley & Sons, New York, 1985."},{"key":"272482_CR17","first-page":"225","volume-title":"Handbooks in Operations Research and Management Science, vol. 7: Network Models","author":"M. J\u00fcnger","year":"1995","unstructured":"M. J\u00fcnger, G. Reinelt, and G. Rinaldi, \u201cThe traveling salesman problem,\u201d in Handbooks in Operations Research and Management Science, vol. 7: Network Models, M.O. Ball, T.L. Magnanti, C.L. Monma, and G.L. Nemhauser (Eds.), Elsevier Sci. B.V., Amsterdam, 1995, Ch. 4, pp. 225-330."},{"key":"272482_CR18","first-page":"83","volume":"22","author":"M. J\u00fcnger","year":"1998","unstructured":"M. J\u00fcnger, G. Reinelt, and S. Thienel, \u201cProvably good solutions for the traveling salesman problem,\u201d Zeitschrift f\u00fcr Operations Research, vol. 22, pp. 83-95, 1998.","journal-title":"Zeitschrift f\u00fcr Operations Research"},{"issue":"2","key":"272482_CR19","first-page":"183","volume":"40","author":"M. J\u00fcnger","year":"1994","unstructured":"M. J\u00fcnger and S. Thienel. \u201cIntroduction toABACUS-Abranch and cut system,\u201d Operations Research Letters, vol. 40, no. 2, pp. 183-217, 1994.","journal-title":"Operations Research Letters"},{"key":"272482_CR20","unstructured":"M. J\u00fcnger and S. Thienel, \u201cIntroduction to ABACUS-A branch and cut system,\u201d Technical Report No. 97.263, Institut f\u00fcr Informatik, Universit\u00e4t zu K\u00f6ln, 1997. See on-line documentation under URL http:\/\/www.informatik.uni-koeln.de\/ls juenger\/projects\/abacus.html."},{"key":"272482_CR21","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BF01580850","volume":"47","author":"M. Padberg","year":"1990","unstructured":"M. Padberg and G. Rinaldi, \u201cAn efficient algorithm for the minimum capacity cut problem,\u201d Mathematical Programming, vol. 47, pp. 19-36, 1990.","journal-title":"Mathematical Programming"},{"key":"272482_CR22","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/BF01580861","volume":"47","author":"M. Padberg","year":"1990","unstructured":"M. Padberg and G. Rinaldi, \u201cFacet identification for the symmetric traveling salesman polytope,\u201d Mathematical Programming, vol. 47, pp. 219-257, 1990.","journal-title":"Mathematical Programming"},{"key":"272482_CR23","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1287\/moor.7.1.67","volume":"7","author":"M. Padberg","year":"1982","unstructured":"M. Padberg and M.R. Rao, \u201cOdd minimum cut-sets and b-matchings,\u201d Math. of OR, vol. 7, pp. 67-80, 1982.","journal-title":"Math. of OR"},{"key":"272482_CR24","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G. Reinelt","year":"1991","unstructured":"G. Reinelt, \u201cTSPLIB-A traveling salesman problem library,\u201d ORSA Journal on Computing, vol. 3, pp. 376-384, 1991. See http:\/\/www.iwr.uni-heidelberg.de\/iwr\/comopt\/soft\/TSPLIB95\/TSPLIB.html.","journal-title":"ORSA Journal on Computing"},{"key":"272482_CR25","unstructured":"M. Timlin, \u201cPrecedence constrained routing,\u201d Master's Thesis, Department of Combinatorics and Optimization, University of Waterloo, 1989."},{"issue":"3","key":"272482_CR26","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1287\/inte.22.3.100","volume":"22","author":"M.T. FialaTimlin","year":"1992","unstructured":"M.T. FialaTimlin and W.R. Pulleyblank, \u201cPrecedence constrained routing and helicopter scheduling: Heuristic design,\u201d Interfaces, vol. 22, no. 3, pp. 100-111, 1992.","journal-title":"Interfaces"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008779125567.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008779125567\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008779125567.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:06:46Z","timestamp":1752376006000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008779125567"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,10]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2000,10]]}},"alternative-id":["272482"],"URL":"https:\/\/doi.org\/10.1023\/a:1008779125567","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,10]]}}}