{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:14:25Z","timestamp":1773656065861,"version":"3.50.1"},"reference-count":23,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1989,6,1]],"date-time":"1989-06-01T00:00:00Z","timestamp":612662400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8812,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1989,6]]},"DOI":"10.1016\/0166-218x(89)90014-0","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"201-229","source":"Crossref","is-referenced-by-count":60,"title":["Facets of the three-index assignment polytope"],"prefix":"10.1016","volume":"23","author":[{"given":"Egon","family":"Balas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew J.","family":"Saltzman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(89)90014-0_BIB1","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BF01584228","article-title":"A restricted Lagrangian approach to the traveling salesman problem","volume":"21","author":"Balas","year":"1981","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(89)90014-0_BIB2","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0167-6377(83)90045-7","article-title":"Traffic assignment in communication satellites","volume":"2","author":"Balas","year":"1983","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/0166-218X(89)90014-0_BIB3","doi-asserted-by":"crossref","first-page":"710","DOI":"10.1137\/1018115","article-title":"Set partitioning: a survey","volume":"18","author":"Balas","year":"1976","journal-title":"SIAM Rev."},{"key":"10.1016\/0166-218X(89)90014-0_BIB4","series-title":"MSRR No. 511","article-title":"Some facets of the 3-index assignment polytope","author":"Balas","year":"1984"},{"key":"10.1016\/0166-218X(89)90014-0_BIB5","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0012-365X(73)90167-2","article-title":"Edmonds polytopes and a hierarchy of combinatorial problems","volume":"4","author":"Chv\u00e1tal","year":"1973","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(89)90014-0_BIB6","first-page":"57","article-title":"On a three-dimensional transportation problem","volume":"11","author":"Corban","year":"1966","journal-title":"Rev. Roumaine Math. Pures Appl."},{"key":"10.1016\/0166-218X(89)90014-0_BIB7","first-page":"27","article-title":"The traveling salesman polytope and {0,2}-matchings","volume":"16","author":"Cornuejols","year":"1982","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0166-218X(89)90014-0_BIB8","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1007\/BF01583779","article-title":"Some facets of the simple plant location polytope","volume":"23","author":"Cornuejols","year":"1982","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(89)90014-0_BIB9","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1287\/mnsc.26.5.495","article-title":"Solving large-scale symmetric traveling salesman problems to optimality","volume":"26","author":"Crowder","year":"1980","journal-title":"Management Sci."},{"key":"10.1016\/0166-218X(89)90014-0_BIB10","series-title":"Odd cycles and a class of facets of the axial 3-index assignment polytope","author":"Euler","year":"1985"},{"key":"10.1016\/0166-218X(89)90014-0_BIB11","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0377-2217(83)90078-4","article-title":"Complexity of a 3-dimensional assignment problem","volume":"13","author":"Frieze","year":"1983","journal-title":"European J. Oper. Res."},{"key":"10.1016\/0166-218X(89)90014-0_BIB12","doi-asserted-by":"crossref","first-page":"989","DOI":"10.1057\/jors.1981.207","article-title":"An algorithm for solving 3-dimensional assignment problems with application to scheduling a teaching practice","volume":"32","author":"Frieze","year":"1981","journal-title":"J. Oper. Res. Soc."},{"key":"10.1016\/0166-218X(89)90014-0_BIB13","series-title":"Computers and Intractibility: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0166-218X(89)90014-0_BIB14","series-title":"Proceedings IFIP Congress","first-page":"73","article-title":"The construction of class-teacher timetables","author":"Gotlieb","year":"1962"},{"key":"10.1016\/0166-218X(89)90014-0_BIB15","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1287\/opre.10.4.448","article-title":"The solid transportation problem","volume":"10","author":"Haley","year":"1962","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(89)90014-0_BIB16","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1287\/opre.11.3.368","article-title":"The multi-index problem","volume":"11","author":"Haley","year":"1963","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(89)90014-0_BIB17","first-page":"154","article-title":"Methoden zur L\u00f6sung dreidimensionaler Zuordnungsprobleme","author":"Leue","year":"1972","journal-title":"Angew. Inform."},{"key":"10.1016\/0166-218X(89)90014-0_BIB18","series-title":"Ph.D. Dissertation","article-title":"Polytopes a sommets dans {0,1}","author":"Maurras","year":"1976"},{"key":"10.1016\/0166-218X(89)90014-0_BIB19","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF01580121","article-title":"On the facial structure of set packing polyhedra","volume":"5","author":"Padberg","year":"1973","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(89)90014-0_BIB20","first-page":"71","article-title":"The tri-substitution method for the three-dimensional assignment problem","volume":"5","author":"Pierskalla","year":"1967","journal-title":"CORS J."},{"key":"10.1016\/0166-218X(89)90014-0_BIB21","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1287\/opre.16.2.422","article-title":"The multidimensional assignment problem","volume":"16","author":"Pierskalla","year":"1968","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(89)90014-0_BIB22","first-page":"615","article-title":"Distribution of a product by several properties","volume":"2","author":"Schell","year":"1955"},{"key":"10.1016\/0166-218X(89)90014-0_BIB23","first-page":"181","article-title":"Branch and bound method for the three-index assignment problem","volume":"3","author":"Vlach","year":"1967","journal-title":"Ekonom.-Mat. Obzor (Czechoslovakia)"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X89900140?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X89900140?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:55:40Z","timestamp":1555134940000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X89900140"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,6]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1989,6]]}},"alternative-id":["0166218X89900140"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(89)90014-0","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1989,6]]}}}