{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T00:32:32Z","timestamp":1699835552939},"reference-count":5,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":8715,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1982,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Given an extreme point of an assignment polytope of size <jats:italic>m<\/jats:italic>, there exist 2<jats:sup>m\u22121<\/jats:sup> <jats:italic>m<\/jats:italic><jats:sup>m\u22122<\/jats:sup> alternative basis representations according to the choice of the <jats:italic>m<\/jats:italic> \u2010 1 degenerate basic variables. This note establishes the basis structure which admits the maximum degenerate pivots and that which admits the minimum degenerate pivots. It is shown that the upper bound is achieved if and only if the basis is a chain graph and that the lower bound is achieved if the degenerate basic arcs all originate at some facility or all terminate at some location.<\/jats:p>","DOI":"10.1002\/net.3230120411","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T14:26:51Z","timestamp":1178893611000},"page":"469-474","source":"Crossref","is-referenced-by-count":1,"title":["A property regarding degenerate pivots for linear assignment networks"],"prefix":"10.1002","volume":"12","author":[{"given":"Mokhtar S.","family":"Bazaraa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hanif D.","family":"Sherali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1137\/1016083"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01584319"},{"key":"e_1_2_1_4_2","volume-title":"Linear Programming and Network Flows","author":"Bazaraa M. S.","year":"1977"},{"key":"e_1_2_1_5_2","volume-title":"Facility Layout and Location: An Analytical Approach","author":"Francis R. L.","year":"1974"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.28.4.969"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230120411","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230120411","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T13:29:09Z","timestamp":1699795749000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230120411"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,12]]},"references-count":5,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1982,12]]}},"alternative-id":["10.1002\/net.3230120411"],"URL":"https:\/\/doi.org\/10.1002\/net.3230120411","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1982,12]]}}}