{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T15:55:46Z","timestamp":1770738946917,"version":"3.49.0"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1992,2,1]],"date-time":"1992-02-01T00:00:00Z","timestamp":696902400000},"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":[[1992,2]]},"DOI":"10.1007\/bf01586058","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T08:35:49Z","timestamp":1114677349000},"page":"335-351","source":"Crossref","is-referenced-by-count":4,"title":["Paths on polymatroids"],"prefix":"10.1007","volume":"54","author":[{"given":"Donald M.","family":"Topkis","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1287\/moor.10.3.367","volume":"10","author":"R.E. Bixby","year":"1985","unstructured":"R.E. Bixby, W.H. Cunningham and D.M. Topkis, \u201cThe partial order of a polymatroid extreme point,\u201dMathematics of Operations Research 10 (1985) 367\u2013378.","journal-title":"Mathematics of Operations Research"},{"key":"CR2","volume-title":"\u201cRational behaviour and computational complexity,\u201d Technical Report SOCS-78.9","author":"V. Chv\u00e1tal","year":"1978","unstructured":"V. Chv\u00e1tal, \u201cRational behaviour and computational complexity,\u201d Technical Report SOCS-78.9, School of Computer Science, McGill University (Montreal, Que., 1978)."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0095-8956(84)90023-6","volume":"36","author":"W.H. Cunningham","year":"1984","unstructured":"W.H. Cunningham, \u201cTesting membership in matroid polyhedra,\u201dJournal of Combinatorial Theory (B) 36 (1984) 161\u2013188.","journal-title":"Journal of Combinatorial Theory (B)"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/BF02579361","volume":"5","author":"W.H. Cunningham","year":"1985","unstructured":"W.H. Cunningham, \u201cOn submodular function minimization,\u201dCombinatorica 5 (1985) 185\u2013192.","journal-title":"Combinatorica"},{"key":"CR5","first-page":"69","volume-title":"Combinatorial Structures and their Applications (Proceedings Calgary International Conference, 1969)","author":"J. Edmonds","year":"1970","unstructured":"J. Edmonds, \u201cSubmodular functions, matroids, and certain polyhedra,\u201d in: R. Guy et al., eds.,Combinatorial Structures and their Applications (Proceedings Calgary International Conference, 1969) (Gordon and Breach, New York, 1970) pp. 69\u201387."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"189","DOI":"10.15807\/jorsj.21.189","volume":"21","author":"S. Fujishige","year":"1978","unstructured":"S. Fujishige, \u201cAlgorithms for solving the independent-flow problems,\u201dJournal of the Operations Research Society of Japan 21 (1978) 189\u2013204.","journal-title":"Journal of the Operations Research Society of Japan"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M. Gr\u00f6tschel","year":"1981","unstructured":"M. Gr\u00f6tschel, L. Lov\u00e1sz and A. Schrijver, \u201cThe ellipsoid method and its consequences in combinatorial optimization,\u201dCombinatorica 1 (1981) 169\u2013197.","journal-title":"Combinatorica"},{"key":"CR8","first-page":"173","volume-title":"Proceedings of the West Coast Conference on Combinatorics, Graph Theory and Computing","author":"D. Gusfield","year":"1980","unstructured":"D. Gusfield, \u201cBounds for the parametric minimum spanning tree problem,\u201d in: P.Z. Chinn et al., eds.,Proceedings of the West Coast Conference on Combinatorics, Graph Theory and Computing (Utilitas Mathematica, Winnipeg, Man., 1980) pp. 173\u2013181."},{"key":"CR9","volume-title":"Adjacency on Polytopes in Combinatorial Optimization. Mathematical Systems in Economics No. 49","author":"D. Hausmann","year":"1979","unstructured":"D. Hausmann,Adjacency on Polytopes in Combinatorial Optimization. Mathematical Systems in Economics No. 49 (Oelgeschlager, Gunn & Hain, Cambridge, MA, 1979)."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1007\/BFb0121197","volume":"8","author":"D. Hausmann","year":"1978","unstructured":"D. Hausmann and B. Korte, \u201cColouring criteria for adjacency on 0\u20131 polyhedra,\u201dMathematical Programming Study 8 (1978) 106\u2013127.","journal-title":"Mathematical Programming Study"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1137\/0122021","volume":"22","author":"C.A. Holzmann","year":"1972","unstructured":"C.A. Holzmann and F. Harary, \u201cOn the tree graph of a matroid,\u201dSIAM Journal on Applied Mathematics 22 (1972) 187\u2013193.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1287\/moor.12.4.718","volume":"12","author":"V. Klee","year":"1987","unstructured":"V. Klee and P. Kleinschmidt, \u201cThed-step conjecture and its relatives,\u201dMathematics of Operations Research 12 (1987) 718\u2013755.","journal-title":"Mathematics of Operations Research"},{"key":"CR13","first-page":"159","volume-title":"Inequalities III","author":"V. Klee","year":"1972","unstructured":"V. Klee and G.J. Minty, \u201cHow good is the simplex algorithm?\u201d in: O. Shisha, ed.,Inequalities III (Academic Press, New York, 1972) pp. 159\u2013175."},{"key":"CR14","unstructured":"C.L. Monma, personal communication, 1980."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1137\/1013066","volume":"13","author":"K.G. Murty","year":"1971","unstructured":"K.G. Murty, \u201cAdjacency on convex polyhedra,\u201dSIAM Review 13 (1971) 377\u2013386.","journal-title":"SIAM Review"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/BF01753431","volume":"1","author":"L.S. Shapley","year":"1971","unstructured":"L.S. Shapley, \u201cCores of convex games,\u201dInternational Journal of Game Theory 1 (1971) 11\u201326.","journal-title":"International Journal of Game Theory"},{"key":"CR17","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511571817","volume-title":"The Theory of Natural Monopoly","author":"W.W. Sharkey","year":"1982","unstructured":"W.W. Sharkey,The Theory of Natural Monopoly (Cambridge Univesity Press, Cambridge, UK, 1982)."},{"key":"CR18","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1002\/net.3230130106","volume":"13","author":"D.M. Topkis","year":"1983","unstructured":"D.M. Topkis, \u201cActivity selection games and the minimum-cut problem,\u201dNetworks 13 (1983) 93\u2013105.","journal-title":"Networks"},{"key":"CR19","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BF02591887","volume":"30","author":"D.M. Topkis","year":"1984","unstructured":"D.M. Topkis, \u201cAdjacency on polymatroids,\u201dMathematical Programming 30 (1984) 229\u2013237.","journal-title":"Mathematical Programming"},{"key":"CR20","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1007\/BFb0121198","volume":"8","author":"H.P. Young","year":"1978","unstructured":"H.P. Young, \u201cOn permutations and permutation polytopes,\u201dMathematical Programming Study 8 (1978) 128\u2013140.","journal-title":"Mathematical Programming Study"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01586058.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01586058\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01586058","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:32:35Z","timestamp":1556897555000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01586058"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,2]]},"references-count":20,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1992,2]]}},"alternative-id":["BF01586058"],"URL":"https:\/\/doi.org\/10.1007\/bf01586058","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,2]]}}}