{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T05:44:19Z","timestamp":1775022259732,"version":"3.50.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[2001,10,1]],"date-time":"2001-10-01T00:00:00Z","timestamp":1001894400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,10,1]],"date-time":"2001-10-01T00:00:00Z","timestamp":1001894400000},"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":["Annals of Operations Research"],"published-print":{"date-parts":[[2001,10]]},"DOI":"10.1023\/a:1014998931654","type":"journal-article","created":{"date-parts":[[2002,12,28]],"date-time":"2002-12-28T21:55:50Z","timestamp":1041112550000},"page":"117-142","source":"Crossref","is-referenced-by-count":18,"title":["Modeling and Solving an Airline Schedule Generation Problem"],"prefix":"10.1007","volume":"107","author":[{"given":"A.","family":"Erdmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Nolte","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Noltemeier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Schrader","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"399512_CR1","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1287\/opre.43.1.58","volume":"43","author":"A. Balakrishnan","year":"1995","unstructured":"A. Balakrishnan, T.L. Magnanti and R.T. Wong, A decomposition algorithm for local access telecommunications network expansion planning, Operations Research 43 (1995) 58\u201376.","journal-title":"Operations Research"},{"key":"399512_CR2","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1287\/opre.46.3.316","volume":"46","author":"C. Barnhart","year":"1998","unstructured":"C. Barnhart, E.L. Johnson, G.L. Nemhauser, M.W.P. Savelsbergh and P.H. Vance, Branch-and-price: column generation for solving huge integer programs, Operations Research 46 (1998) 316\u2013329.","journal-title":"Operations Research"},{"issue":"6","key":"399512_CR3","doi-asserted-by":"crossref","first-page":"852","DOI":"10.1287\/opre.44.6.852","volume":"44","author":"C. Barnhart","year":"1996","unstructured":"C. Barnhart and R.R. Schneur, Air network design for express shipment service, Operations Research 44(6) (1996) 852\u2013863.","journal-title":"Operations Research"},{"key":"399512_CR4","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1287\/trsc.34.4.364.12319","volume":"34","author":"K. B\u00fcdenbender","year":"2000","unstructured":"K. B\u00fcdenbender, T. Gr\u00fcnert and H.J. Sebastian, A tabu search algorithm for the direct flight network design problem, Transportation Science 34 (2000) 364\u2013380.","journal-title":"Transportation Science"},{"issue":"1","key":"399512_CR5","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1287\/opre.43.1.43","volume":"43","author":"S.-G. Chang","year":"1995","unstructured":"S.-G. Chang and B. Gavish, Lower bounding procedures for multiperiod telecommunications network expansion problem, Operations Research 43(1) (1995) 43\u201357.","journal-title":"Operations Research"},{"key":"399512_CR6","unstructured":"T. Christof, A. L\u00f6bel and M. Stoer, PORTA-POlyhedral Representation Transfomation Algorithm. www.zib.de\/Optimization\/Software\/Porta\/, 1998."},{"key":"399512_CR7","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1016\/S0377-2217(96)00298-6","volume":"97","author":"T.G. Crainic","year":"1997","unstructured":"T.G. Crainic and G. Laporte, Planning models for freight transportation, European Journal of Operational Research 97 (1997) 409\u2013438.","journal-title":"European Journal of Operational Research"},{"key":"399512_CR8","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1287\/opre.31.5.803","volume":"31","author":"H. Crowder","year":"1983","unstructured":"H. Crowder, E.L. Johnson and M.W. Padberg, Solving large scale zero-one linear programming problems, Operations Research 31 (1983) 803\u2013834.","journal-title":"Operations Research"},{"key":"399512_CR9","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1287\/trsc.23.2.91","volume":"23","author":"M.S. Daskin","year":"1989","unstructured":"M.S. Daskin and N.D. Panayotopoulos, A Lagrangian relaxation approach to assigning aircraft to routes in hub and spoke networks, Transportation Science 23 (1989) 91\u201399.","journal-title":"Transportation Science"},{"key":"399512_CR10","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1287\/mnsc.43.6.841","volume":"43","author":"G. Desaulniers","year":"1997","unstructured":"G. Desaulniers, J. Desrosiers, Y. Dumas, M.M. Solomon and F. Soumis, Daily aircraft routing and scheduling, Management Science 43 (1997) 841\u2013855.","journal-title":"Management Science"},{"key":"399512_CR11","doi-asserted-by":"crossref","unstructured":"G. Desaulniers, J. Desrosiers, I. Ioachim, M.M. Solomon, F. Soumis and D. Villeneuve, A unified framework for deterministic time constraint vehicle routing and crew scheduling problems, Les Cahiers de GERAD G-94-46 (1997).","DOI":"10.1007\/978-1-4615-5755-5_3"},{"key":"399512_CR12","unstructured":"M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, 1979)."},{"key":"399512_CR13","unstructured":"K. Holmberg and J. Hellstrand, Solving the uncapacitated network design problem by a Lagrangian heuristic and branch-and-bound, in: Operations Research Proceedings 1996, Selected Papers of the SOR' 96, eds. U. Zimmermann, U. Derigs, W. Gaul, R.H. M\u00f6hring, and K.P. Schuster (Springer, 1997)."},{"key":"399512_CR14","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1287\/opre.46.2.247","volume":"46","author":"K. Holmberg","year":"1998","unstructured":"K. Holmberg and D. Yuan, A Lagrangian heuristic based branch-and-bound approach for the capacitated network design problem, Operations Research 46 (1998) 247\u2013259.","journal-title":"Operations Research"},{"issue":"4","key":"399512_CR15","doi-asserted-by":"crossref","first-page":"704","DOI":"10.1287\/opre.38.4.704","volume":"38","author":"B.W. Lamar","year":"1990","unstructured":"B.W. Lamar, Y. Sheffi and W.B. Powell, A capacity improvement lower bound for fixed charge network design problem, Operations Research 38(4) (1990) 704\u2013710.","journal-title":"Operations Research"},{"key":"399512_CR16","volume-title":"Optimization Theory for Large Systems","author":"L.S. Lasdon","year":"1970","unstructured":"L.S. Lasdon, Optimization Theory for Large Systems (Collier-MaxMillan, New York, 1970)."},{"key":"399512_CR17","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1287\/opre.43.1.142","volume":"43","author":"T.L. Magnanti","year":"1995","unstructured":"T.L. Magnanti, P. Mirchandani and R. Vachani, Modeling and solving the two-facility capacitated network loading problem, Operations Research 43 (1995) 142\u2013157.","journal-title":"Operations Research"},{"key":"399512_CR18","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1007\/BFb0121090","volume":"26","author":"T.L. Magnanti","year":"1986","unstructured":"T.L. Magnanti, P. Mireault and R.T. Wong, Tailoring Bender's decomposition for network design, Mathematical Programming Study 26 (1986) 112\u2013154.","journal-title":"Mathematical Programming Study"},{"key":"399512_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.18.1.1","volume":"18","author":"T.L. Magnanti","year":"1984","unstructured":"T.L. Magnanti and R.T. Wong, Network design and transportation planning: Models and algorithms, Transportation Science 18 (1984) 1\u201355.","journal-title":"Transportation Science"},{"key":"399512_CR20","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1002\/net.3230190305","volume":"19","author":"M. Minoux","year":"1989","unstructured":"M. Minoux, Network synthesis and optimum network design problems: Models, solution methods and applications, Network 19 (1989) 313\u2013360.","journal-title":"Network"},{"key":"399512_CR21","volume-title":"Modelle und L\u00f6sungsverfahren zur Generierung von Flugpl\u00e4nen","author":"A. Noltemeier","year":"2000","unstructured":"A. Noltemeier, Modelle und L\u00f6sungsverfahren zur Generierung von Flugpl\u00e4nen, Ph.D. thesis, ZAIK\/ZPR, University of Cologne, Germany (2000)."},{"key":"399512_CR22","doi-asserted-by":"crossref","first-page":"842","DOI":"10.1287\/opre.33.4.842","volume":"33","author":"M.W. Padberg","year":"1985","unstructured":"M.W. Padberg, T.J. van Roy and L.A. Wolsey, Valid linear inequalities for fixed charge problems, Operations Research 33 (1985) 842\u2013861.","journal-title":"Operations Research"},{"key":"399512_CR23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.34.1.1.12277","volume":"34","author":"B. Rexing","year":"2000","unstructured":"B. Rexing, C. Barnhart, T. Kniker, A. Jarrah and N. Krishnamoorthy, Airline fleet assignment with time windows, Transportation Science 34 (2000) 1\u201320.","journal-title":"Transportation Science"},{"key":"399512_CR24","first-page":"35","volume-title":"Computer scheduling of Public Transport Urban Passenger Vehicle and Crew Scheduling","author":"D.M. Ryan","year":"1981","unstructured":"D.M. Ryan and B.A. Foster, An integer programming approach to scheduling, in: Computer scheduling of Public Transport Urban Passenger Vehicle and Crew Scheduling, ed. A.Wren (North-Holland, Amsterdam, 1981) pp. 35\u2013139."},{"key":"399512_CR25","unstructured":"M.W.P. Savelsbergh and G.L. Nemhauser. Functional Description of MINTO, a Mixed INTeger Optimizer, Version 3.0 (Georgia Institute of Technology, 1998)."},{"key":"399512_CR26","doi-asserted-by":"crossref","first-page":"622","DOI":"10.1016\/S0377-2217(99)00272-6","volume":"125","author":"V. Sridhar","year":"2000","unstructured":"V. Sridhar and J.S. Park, Benders-and-cut algorithm for fixed-charge capacitated network design problem, European Journal of Operational Research 125 (2000) 622\u2013632.","journal-title":"European Journal of Operational Research"},{"key":"399512_CR27","unstructured":"Using the CPLEX Callable Library, Version 6.0, CPLEX Optimization, Inc., 1998."},{"key":"399512_CR28","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0166-218X(86)90061-2","volume":"14","author":"T.J. van Roy","year":"1986","unstructured":"T.J. van Roy and L.A. Wolsey, Valid inequalities for mixed 0-1 programs, Discrete Applied Mathematics 14 (1986) 199\u2013213.","journal-title":"Discrete Applied Mathematics"},{"key":"399512_CR29","unstructured":"P.H. Vance, A. Atamt\u00fcrk, C. Barnhart, E. Gelman, E.L. Johnson, A. Krishna, D. Mahidhara, G.L. Nemhauser and R. Rebello, A heuristic branch-and-price approach for the airline crew pairing problem (1997) (from author)."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1014998931654.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1014998931654\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1014998931654.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T14:10:47Z","timestamp":1747577447000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1014998931654"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,10]]},"references-count":29,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[2001,10]]}},"alternative-id":["399512"],"URL":"https:\/\/doi.org\/10.1023\/a:1014998931654","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,10]]}}}