{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T14:31:23Z","timestamp":1774449083219,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1994,12,1]],"date-time":"1994-12-01T00:00:00Z","timestamp":786240000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[1994,12]]},"DOI":"10.1007\/bf02085641","type":"journal-article","created":{"date-parts":[[2005,8,14]],"date-time":"2005-08-14T11:22:06Z","timestamp":1124018526000},"page":"219-237","source":"Crossref","is-referenced-by-count":58,"title":["A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships"],"prefix":"10.1007","volume":"50","author":[{"given":"L. F.","family":"Escudero","sequence":"first","affiliation":[]},{"given":"Monique","family":"Guignard","sequence":"additional","affiliation":[]},{"given":"Kavindra","family":"Malik","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02085641_CR1","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/0377-2217(91)90265-W","volume":"50","author":"R. Aboudi","year":"1991","unstructured":"R. Aboudi, A. Hallefjord and K. Jornsten, A facet generation and relaxation technique applied to an assignment problem with side constraints, Eur. J. Oper. Res. 50(1991)335\u2013344.","journal-title":"Eur. J. Oper. Res."},{"key":"BF02085641_CR2","volume-title":"Ein Schnittebenenverfahren fuer ein Reihenfolgeproblem in der flexiblen Fertigung","author":"N. Ascheuer","year":"1989","unstructured":"N. Ascheuer, Ein Schnittebenenverfahren fuer ein Reihenfolgeproblem in der flexiblen Fertigung, Diplomarbeit angefertigt, Universit\u00e4t Augsburg, Germany (1989)."},{"key":"BF02085641_CR3","first-page":"19","volume-title":"Integer Programming and Combinatorial Optimization Conf.","author":"N. Ascheuer","year":"1990","unstructured":"N. Ascheuer, L.F. Escudero, M. Gr\u00f6tschel and M. Stoer, On identifying in polynomial time violated subtour elimination and precedence forcing constraints for the sequential ordering problem, in:Integer Programming and Combinatorial Optimization Conf., ed. R. Kannan and W.R. Pulleyblank (Waterloo University Press, Waterloo, Ontario, 1990) pp. 19\u201328."},{"key":"BF02085641_CR4","unstructured":"E. Balas, M. Fischetti and W.R. Pulleyblank, Polyhedral results for the precedence constrained ATSP,Meeting on Combinatorial Optimization, Oberwolfach, Germany (1991)."},{"key":"BF02085641_CR5","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1002\/net.3230100202","volume":"10","author":"P.M. Camerini","year":"1980","unstructured":"P.M. Camerini, L. Fratta and F. Maffioli, A note on finding optimum branching, Networks 10(1980)81\u2013110.","journal-title":"Networks"},{"key":"BF02085641_CR6","doi-asserted-by":"crossref","first-page":"233","DOI":"10.6028\/jres.071B.032","volume":"71","author":"J. Edmonds","year":"1967","unstructured":"J. Edmonds, Optimum branchings, J. Res. Nat. Bureau Stand. B 71(1967)233\u2013240.","journal-title":"J. Res. Nat. Bureau Stand. B"},{"key":"BF02085641_CR7","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, An inexact algorithm for the sequential ordering problem, Eur. J. Oper. Res. 37(1988)236\u2013253.","journal-title":"Eur. J. Oper. Res."},{"key":"BF02085641_CR8","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/BF02096599","volume":"17","author":"L.F. Escudero","year":"1989","unstructured":"L.F. Escudero, A production planning problem in FMS, Ann. Oper. Res. 17(1989)69\u2013104.","journal-title":"Ann. Oper. Res."},{"key":"BF02085641_CR9","unstructured":"L.F. Escudero, M. Guignard and K. Malik, A Lagrangian based lower bound for the sequential ordering problem with precedence relationships and deadlines, Report 92-05-05-, Decision Sciences Department, The Wharton School, University of Pennsylvania (1992)."},{"key":"BF02085641_CR10","volume-title":"An approximate algorithm for the sequential ordering problem with time windows and precedence relationships, Report No. RC-16820","author":"L.F. Escudero","year":"1991","unstructured":"L.F. Escudero and A. Sciomachen, An approximate algorithm for the sequential ordering problem with time windows and precedence relationships, Report No. RC-16820, IBM T.J. Watson Research Center, Yorktown Heights, NY 1991."},{"key":"BF02085641_CR11","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/BFb0120690","volume":"2","author":"A. Geoffrion","year":"1974","unstructured":"A. Geoffrion, Lagrangian relaxation and its uses in integer programming, Math. Progr. Study 2(1974)82\u2013114.","journal-title":"Math. Progr. Study"},{"key":"BF02085641_CR12","unstructured":"M. Guignard, Efficient cuts in Lagrangian relax-and-cut schemes, Report No. 92-09-07, Decision Sciences Department, The Wharton School, University of Pennsylvania (1992)."},{"key":"BF02085641_CR13","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/BF01580223","volume":"6","author":"M. Held","year":"1974","unstructured":"M. Held, P. Wolfe and H.P. Crowder, Validation of subgradient optimization, Math. Progr. 6(1974)62\u201388.","journal-title":"Math. Progr."},{"key":"BF02085641_CR14","unstructured":"T.H.C. Smith, A LIFO implicit enumeration algorithm for the asymmetric traveling salesman problem using a one-arborescence relaxation, Report MSRR 380, GSIA, Carnegie-Mellon University (1975)."},{"key":"BF02085641_CR15","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1002\/net.3230070103","volume":"7","author":"T.E. Tarjan","year":"1977","unstructured":"T.E. Tarjan, Finding optimum branchings, Networks 7(1977)25\u201335.","journal-title":"Networks"},{"key":"BF02085641_CR16","volume-title":"Precedence constrained routing and helicopter scheduling","author":"M.T.F. Timlin","year":"1989","unstructured":"M.T.F. Timlin, Precedence constrained routing and helicopter scheduling, MS Thesis, University of Waterloo, Waterloo, Ontario, Canada (1989)."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02085641.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02085641\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02085641","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T00:36:24Z","timestamp":1557794184000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02085641"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,12]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,12]]}},"alternative-id":["BF02085641"],"URL":"https:\/\/doi.org\/10.1007\/bf02085641","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,12]]}}}