{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T06:11:38Z","timestamp":1774332698715,"version":"3.50.1"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1995,10,1]],"date-time":"1995-10-01T00:00:00Z","timestamp":812505600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1995,10]]},"DOI":"10.1007\/bf01585938","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T05:15:15Z","timestamp":1114665315000},"page":"211-232","source":"Crossref","is-referenced-by-count":243,"title":["The fleet assignment problem: Solving a large-scale integer program"],"prefix":"10.1007","volume":"70","author":[{"given":"Christopher A.","family":"Hane","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cynthia","family":"Barnhart","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ellis L.","family":"Johnson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roy E.","family":"Marsten","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George L.","family":"Nemhauser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gabriele","family":"Sigismondi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1287\/inte.19.4.20","volume":"19","author":"J. Abara","year":"1989","unstructured":"J. Abara, \u201cApplying integer linear programming to the fleet assignment problem,\u201dInterfaces 19 (1989) 20\u201328.","journal-title":"Interfaces"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1287\/opre.41.1.153","volume":"41","author":"M.A. Berge","year":"1993","unstructured":"M.A. Berge and C.A. Hopperstad, \u201cDemand driven dispatch: a method for dynamic aircraft capacity assignment, models and algorithms,\u201dOperations Research 41 (1993) 153\u2013168.","journal-title":"Operations Research"},{"key":"CR3","unstructured":"L.W. Clarke, C.A. Hane, E.L. Johnson and G.L. Nemhauser, \u201cModeling issues in fleet assignment,\u201dTransportation Science, to appear."},{"key":"CR4","volume-title":"IBM Optimization Subroutine Library, Guide and Reference, Release 2, Document Number SC230519-02","author":"J. Druckerman","year":"1991","unstructured":"J. Druckerman, D. Silverman and K. Viaropulos,IBM Optimization Subroutine Library, Guide and Reference, Release 2, Document Number SC230519-02, IBM, Kingston, NY (1991)."},{"issue":"3","key":"CR5","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/BF01581089","volume":"57","author":"J.J. Forrest","year":"1992","unstructured":"J.J. Forrest and D. Goldfarb, \u201cSteepest-edge simplex algorithms for linear programming,\u201dMathematical Programming 57 (3) (1992) 341\u2013374.","journal-title":"Mathematical Programming"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1147\/sj.311.0011","volume":"31","author":"J.J.H. Forrest","year":"1992","unstructured":"J.J.H. Forrest and J.A. Tomlin, \u201cImplementing the simplex method of the Optimization Subroutine Library,\u201dIBM Systems Journal 31 (1992) 11\u201325.","journal-title":"IBM Systems Journal"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1147\/sj.311.0026","volume":"31","author":"J.J.H. Forrest","year":"1992","unstructured":"J.J.H. Forrest and J.A. Tomlin, \u201cImplementing interior point linear programming methods in the Optimization Subroutine Library,\u201dIBM Systems Journal 31 (1992) 26\u201338.","journal-title":"IBM Systems Journal"},{"issue":"3","key":"CR8","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/BF01593804","volume":"12","author":"D. Goldfarb","year":"1977","unstructured":"D. Goldfarb and J.K. Reid, \u201cA practicable steepest-edge simplex algorithm,\u201dMathematical Programming 12 (3) (1977) 361\u2013371.","journal-title":"Mathematical Programming"},{"issue":"1","key":"CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01580108","volume":"5","author":"P.M.J. Harris","year":"1973","unstructured":"P.M.J. Harris, \u201cPivot selection methods of the Devex LP code,\u201dMathematical Programming 5 (1) (1973) 1\u201328; reprinted in:Mathematical Programming Study 4 (1975) 30\u201357.","journal-title":"Mathematical Programming"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1137\/0802022","volume":"2","author":"I.J. Lustig","year":"1992","unstructured":"I.J. Lustig, R.E. Marsten and D.F. Shanno, \u201cOn implementing Mehrotra's predictor\u2014corrector interior point method for linear programming,\u201dSIAM Journal on Optimization 2 (1992) 435\u2013449.","journal-title":"SIAM Journal on Optimization"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1287\/ijoc.3.1.63","volume":"3","author":"N. Megiddo","year":"1991","unstructured":"N. Megiddo, \u201cOn finding primal- and dual-optimal bases,\u201dORSA Journal on Computing 3 (1991) 63\u201365.","journal-title":"ORSA Journal on Computing"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1137\/0802028","volume":"2","author":"S. Mehrotra","year":"1992","unstructured":"S. Mehrotra, \u201cOn the implementation of a primal\u2014dual interior point method,\u201dSIAM Journal on Optimization 2 (1992) 575\u2013601.","journal-title":"SIAM Journal on Optimization"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01585938.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01585938\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01585938","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T11:32:34Z","timestamp":1556883154000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01585938"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,10]]},"references-count":12,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1995,10]]}},"alternative-id":["BF01585938"],"URL":"https:\/\/doi.org\/10.1007\/bf01585938","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,10]]}}}