{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T18:03:13Z","timestamp":1775671393982,"version":"3.50.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1984,10,1]],"date-time":"1984-10-01T00:00:00Z","timestamp":465436800000},"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":[[1984,10]]},"DOI":"10.1007\/bf02591887","type":"journal-article","created":{"date-parts":[[2007,3,29]],"date-time":"2007-03-29T15:39:01Z","timestamp":1175182741000},"page":"229-237","source":"Crossref","is-referenced-by-count":19,"title":["Adjacency on polymatroids"],"prefix":"10.1007","volume":"30","author":[{"given":"Donald M.","family":"Topkis","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF02591887_CR1","doi-asserted-by":"crossref","first-page":"1152","DOI":"10.1287\/opre.20.6.1152","volume":"20","author":"E. Balas","year":"1972","unstructured":"E. Balas and M.W. Padberg, \u201cOn the set-covering problem\u201d,Operations Research 20 (1972) 1152\u20131161.","journal-title":"Operations Research"},{"key":"BF02591887_CR2","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1287\/opre.23.1.74","volume":"23","author":"E. Balas","year":"1975","unstructured":"E. Balas and M. Padberg, \u201cOn the set-covering problem: II. an algorithm for set partitioning\u201d,Operations Research 23 (1975) 74\u201390.","journal-title":"Operations Research"},{"key":"BF02591887_CR3","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1051\/ro\/1979130100031","volume":"13","author":"E. Balas","year":"1979","unstructured":"E. Balas and M.W. Padberg, \u201cAdjacent vertices of the all 0\u20131 programming polytope\u201d,RAIRO-Operations Research 13 (1979) 3\u201312.","journal-title":"RAIRO-Operations Research"},{"key":"BF02591887_CR4","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/BF01584995","volume":"3","author":"M.L. Balinski","year":"1972","unstructured":"M.L. Balinski and A. Russakoff, \u201cSome properties of the assignment polytope\u201d,Mathematical Programming 3 (1972) 257\u2013258.","journal-title":"Mathematical Programming"},{"key":"BF02591887_CR5","doi-asserted-by":"crossref","first-page":"516","DOI":"10.1137\/1016083","volume":"16","author":"M.L. Balinski","year":"1974","unstructured":"M.L. Balinski and A Russakoff, \u201cOn the assignment polytope\u201d,SIAM Review 16 (1974) 516\u2013525.","journal-title":"SIAM Review"},{"key":"BF02591887_CR6","unstructured":"R.E. Bixby, W.H. Cunningham and D.M. Topkis, \u201cThe partial order of a polymatroid extreme point\u201d (to appear inMathematics of Operations Research)."},{"key":"BF02591887_CR7","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/0095-8956(75)90041-6","volume":"18","author":"V. Chv\u00e1tal","year":"1975","unstructured":"V. Chv\u00e1tal, \u201cOn certain polytopes associated with graphs\u201d,Journal of Combinatorial Theory (B) 18 (1975) 138\u2013154.","journal-title":"Journal of Combinatorial Theory (B)"},{"key":"BF02591887_CR8","unstructured":"V. Chv\u00e1tal, \u201cRational behaviour and computational complexity\u201d, Technical Report SOCS-78.9, School of Computer Science, McGill University (1978)."},{"key":"BF02591887_CR9","unstructured":"W.H. Cunningham, \u201cTesting membership in matroid polyhedra\u201d, Working Paper WP-81207, Department of Operations Research, University of Bonn (1981)."},{"key":"BF02591887_CR10","series-title":"Proceedings Calgary International Conference, 1969","first-page":"69","volume-title":"Combinatorial structures and their applications","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":"BF02591887_CR11","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\u201d,Journal of the Operations Research Society of Japan 21 (1978) 189\u2013204.","journal-title":"Journal of the Operations Research Society of Japan"},{"key":"BF02591887_CR12","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1137\/0132025","volume":"32","author":"P. Gaiha","year":"1977","unstructured":"P. Gaiha and S.K. Gupta, \u201cAdjacent vertices on a permutohedron\u201d,SIAM Journal on Applied Mathematics 32 (1977) 323\u2013327.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"BF02591887_CR13","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1137\/0602021","volume":"2","author":"R. Giles","year":"1981","unstructured":"R. Giles, \u201cAdjacency on the postman polyhedron\u201d,SIAM Journal on Algebraic and Discrete Methods 2 (1981) 172\u2013175.","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"BF02591887_CR14","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0012-365X(79)90027-X","volume":"26","author":"R. Giles","year":"1979","unstructured":"R. Giles and D. Hausmann, \u201cCharacterizations of adjacency on the branching polyhedron\u201d,Discrete Mathematics 26 (1979) 219\u2013226.","journal-title":"Discrete Mathematics"},{"key":"BF02591887_CR15","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\u201d,Combinatorica 1 (1981) 169\u2013197.","journal-title":"Combinatorica"},{"key":"BF02591887_CR16","series-title":"Mathematical Systems in Economics","volume-title":"Adjacency on polytopes in combinatorial optimization","author":"D. Hausmann","year":"1979","unstructured":"D. Hausmann, \u201cAdjacency on polytopes in combinatorial optimization\u201d, Mathematical Systems in Economics 49, Oelgeschlager, Gunn & Hain (Cambridge, Massachusetts, 1979)."},{"key":"BF02591887_CR17","first-page":"133","volume":"32","author":"D. Hausmann","year":"1979","unstructured":"D. Hausmann, \u201cComplexity of the testing of adjacency on theb-matching polyhedron\u201d,Operations Research Verfahren\/Methods of Operations Research 32 (1979) 133\u2013141.","journal-title":"Operations Research Verfahren\/Methods of Operations Research"},{"key":"BF02591887_CR18","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0012-365X(81)90256-9","volume":"33","author":"D. Hausmann","year":"1981","unstructured":"D. Hausmann, \u201cAdjacent vertices on theb-matching polyhedron\u201d,Discrete Mathematics 33 (1981) 37\u201351.","journal-title":"Discrete Mathematics"},{"key":"BF02591887_CR19","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\u201d,Mathematical Programming Study 8 (1978) 106\u2013127.","journal-title":"Mathematical Programming Study"},{"key":"BF02591887_CR20","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1002\/nav.3800230307","volume":"23","author":"P.G. McKeown","year":"1976","unstructured":"P.G. McKeown, \u201cDetermining adjacent vertices on assignment polytopes\u201d,Naval Research Logistics Quarterly 23 (1976) 455\u2013460.","journal-title":"Naval Research Logistics Quarterly"},{"key":"BF02591887_CR21","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1002\/nav.3800220212","volume":"22","author":"P.G. McKeown","year":"1975","unstructured":"P.G. McKeown and D.S. Rubin, \u201cAdjacent vertices on transportation polytopes\u201d,Naval Research Logistics Quarterly 22 (1975) 365\u2013374.","journal-title":"Naval Research Logistics Quarterly"},{"key":"BF02591887_CR22","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1137\/0307009","volume":"7","author":"K.G. Murty","year":"1969","unstructured":"K.G. Murty, \u201cOn the tours of a traveling salesman\u201d,SIAM Journal on Control 7 (1969), 122\u2013131.","journal-title":"SIAM Journal on Control"},{"key":"BF02591887_CR23","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\u201d,SIAM Review 13 (1971) 377\u2013386.","journal-title":"SIAM Review"},{"key":"BF02591887_CR24","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1007\/BF01585502","volume":"7","author":"M.W. Padberg","year":"1974","unstructured":"M.W. Padberg and M.R. Rao, \u201cThe traveling salesman problem and a class of polyhedra of diameter two\u201d,Mathematical Programming 7 (1974) 32\u201345.","journal-title":"Mathematical Programming"},{"key":"BF02591887_CR25","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1007\/BF01588973","volume":"14","author":"C.H. Papadimitriou","year":"1978","unstructured":"C.H. Papadimitriou, \u201cThe adjacency relation on the traveling salesman polytope is NP-complete\u201d,Mathematical Programming 14 (1978) 312\u2013324.","journal-title":"Mathematical Programming"},{"key":"BF02591887_CR26","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1137\/0130021","volume":"30","author":"M.R. Rao","year":"1976","unstructured":"M.R. Rao, \u201cAdjacency of the traveling salesman tours and 0\u20131 vertices\u201d,SIAM Journal on Applied Mathematics 30 (1976) 191\u2013198.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"BF02591887_CR27","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\u201d,International Journal of Game Theory 1 (1971) 11\u201326.","journal-title":"International Journal of Game Theory"},{"key":"BF02591887_CR28","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\u201d,Networks 13 (1983) 93\u2013105.","journal-title":"Networks"},{"key":"BF02591887_CR29","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\u201d,Mathematical 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\/BF02591887.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02591887\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02591887","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T23:37:50Z","timestamp":1558395470000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02591887"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,10]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1984,10]]}},"alternative-id":["BF02591887"],"URL":"https:\/\/doi.org\/10.1007\/bf02591887","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1984,10]]}}}