{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:45:25Z","timestamp":1759063525757},"reference-count":14,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,3,1]],"date-time":"2000-03-01T00:00:00Z","timestamp":951868800000},"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":4886,"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":[[2000,3]]},"DOI":"10.1016\/s0166-218x(99)00167-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:55:55Z","timestamp":1027608955000},"page":"67-84","source":"Crossref","is-referenced-by-count":10,"title":["Naturally submodular digraphs and forbidden digraph configurations"],"prefix":"10.1016","volume":"100","author":[{"given":"D.","family":"Granot","sequence":"first","affiliation":[]},{"given":"F.","family":"Granot","sequence":"additional","affiliation":[]},{"given":"W.R.","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(99)00167-5_BIB1","doi-asserted-by":"crossref","unstructured":"J.A. Bondy, U.S.R. Murty, Graph Theory with Applications, Elsevier Science Publishing Co., Inc., New York, 1976.","DOI":"10.1007\/978-1-349-03521-2"},{"key":"10.1016\/S0166-218X(99)00167-5_BIB2","doi-asserted-by":"crossref","first-page":"951","DOI":"10.1287\/moor.17.4.951","article-title":"Simple power of two policies are close to optimal in a general class of production\/distribution systems with general joint setup costs","volume":"17","author":"M. Queyranne","year":"1992","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0166-218X(99)00167-5_BIB3","unstructured":"D. Granot, F. Granot, W.R. Zhu, Circular network games, Working paper, Faculty of Commerce and Business Administration, UBC, Vancouver, 1996."},{"key":"10.1016\/S0166-218X(99)00167-5_BIB4","unstructured":"D. Granot, H. Hamers, S. Tijs, On some balanced, totally balanced and submodular delivery games, Working paper, Department of Econometrics, Tilburg University, P.O. Box 90153, 5000 LE Tilburg, The Netherlands, 1997 (Math. Prog., forthcoming.)"},{"key":"10.1016\/S0166-218X(99)00167-5_BIB5","first-page":"219","article-title":"The kernel\/nucleolus of a standard tree game","volume":"25","author":"Granot","year":"1996","journal-title":"Int. J. GT"},{"key":"10.1016\/S0166-218X(99)00167-5_BIB6","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1016\/S0377-2217(98)00175-1","article-title":"Submodularity and the traveling salesman problem","volume":"114","author":"Herer","year":"1999","journal-title":"European J. Oper. Res."},{"issue":"3","key":"10.1016\/S0166-218X(99)00167-5_BIB7","first-page":"673","article-title":"Naturally submodular graphs: A polynomially solvable class for the TSP","volume":"123","author":"Herer","year":"1995","journal-title":"Proc. AMS"},{"key":"10.1016\/S0166-218X(99)00167-5_BIB8","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1287\/opre.45.1.102","article-title":"Heuristics for a one warehouse multi-retailer distribution problem with performance bounds","volume":"45","author":"Herer","year":"1997","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(99)00167-5_BIB9","doi-asserted-by":"crossref","first-page":"186","DOI":"10.2307\/3003493","article-title":"Aircraft landing fees: a game theory approach","volume":"8","author":"Littlechild","year":"1977","journal-title":"The Bell J. Ec."},{"key":"10.1016\/S0166-218X(99)00167-5_BIB10","first-page":"73","article-title":"The kernel and bargaining set of convex games","volume":"2","author":"Maschler","year":"1972","journal-title":"Int. J. GT"},{"key":"10.1016\/S0166-218X(99)00167-5_BIB11","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1287\/moor.3.3.189","article-title":"Computational complexity of the game theory approach to cost allocation for a tree","volume":"3","author":"Megiddo","year":"1978","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0166-218X(99)00167-5_BIB12","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0020-0190(79)90075-9","article-title":"Linear time algorithms to recognize outerplanar and maximal outerplanar graphs","volume":"9","author":"Mitchell","year":"1979","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0166-218X(99)00167-5_BIB13","first-page":"11","article-title":"Cores of convex games","volume":"1","author":"Shapley","year":"1971","journal-title":"Int. J. GT"},{"key":"10.1016\/S0166-218X(99)00167-5_BIB14","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","article-title":"Depth-first search and linear graph algorithms","volume":"1","author":"Tarjan","year":"1972","journal-title":"SIAM. J. Comput."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99001675?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99001675?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T21:25:37Z","timestamp":1578605137000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X99001675"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,3]]},"references-count":14,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,3]]}},"alternative-id":["S0166218X99001675"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(99)00167-5","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2000,3]]}}}