{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:44:00Z","timestamp":1710269040704},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1983,6,1]],"date-time":"1983-06-01T00:00:00Z","timestamp":423273600000},"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":[[1983,6]]},"DOI":"10.1007\/bf02591770","type":"journal-article","created":{"date-parts":[[2007,3,29]],"date-time":"2007-03-29T11:40:40Z","timestamp":1175168440000},"page":"183-198","source":"Crossref","is-referenced-by-count":12,"title":["Integral decomposition in polyhedra"],"prefix":"10.1007","volume":"25","author":[{"given":"Colin","family":"McDiarmid","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02591770_CR1","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1016\/0095-8956(79)90002-9","volume":"26","author":"Z. Baranyai","year":"1979","unstructured":"Z. Baranyai, \u201cThe edge-coloring of complete hypergraphs, I\u201d,Journal of Combinatorial Theory B26 (1979) 276\u2013294.","journal-title":"Journal of Combinatorial Theory"},{"key":"BF02591770_CR2","first-page":"15","volume-title":"Arbeitstagung \u00fcber Operations Research und Optimierung","author":"S. Baum","year":"1978","unstructured":"S. Baum and L. E. Trotter, \u201cInteger rounding and polyhedral decomposition for totally unimodular systems\u201d, in: R. Henn, B. Korte and W. Oettli, eds,Arbeitstagung \u00fcber Operations Research und Optimierung (Springer, Berlin, 1978) pp. 15\u201323."},{"key":"BF02591770_CR3","unstructured":"S. Baum and L.E. Trotter, \u201cFinite checkability for integer rounding properties in combinatorial programming problems\u201d,Mathematical Programming (to appear)."},{"key":"BF02591770_CR4","unstructured":"S. Baum and L.E. Trotter, \u201cInteger rounding for polymatroid and branching optimisation problems\u201d,SIAM Journal on Algebraic and Discrete Methods (to appear)."},{"key":"BF02591770_CR5","volume-title":"Graphs and hypergraphs","author":"C. Berge","year":"1973","unstructured":"C. Berge,Graphs and hypergraphs (North-Holland, Amsterdam, 1973)."},{"key":"BF02591770_CR6","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1090\/S0002-9939-1971-0289335-5","volume":"29","author":"R.A. Brualdi","year":"1971","unstructured":"R.A. Brualdi, \u201cInduced matroids\u201d,Proceedings of the American Mathematical Society 29 (1971) 213\u2013221.","journal-title":"Proceedings of the American Mathematical Society"},{"issue":"2","key":"BF02591770_CR7","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1112\/jlms\/s2-14.1.55","volume":"14","author":"J. Davies","year":"1976","unstructured":"J. Davies and C. McDiarmid, \u201cDisjoint common transversals and exchange structures\u201d,Journal of the London Mathematical Society 14(2) (1976) 55\u201362.","journal-title":"Journal of the London Mathematical Society"},{"key":"BF02591770_CR8","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, H. Hanani, N. Sauer and J. Schonheim, eds.,Combinatorial structures and their applications (Gordon and Breach, New York, 1970) pp. 69\u201387."},{"key":"BF02591770_CR9","first-page":"91","volume-title":"Combinatorial algorithms","author":"J. Edmonds","year":"1972","unstructured":"J. Edmonds, \u201cEdge-disjoint branchings\u201d, in: R. Rustin, ed.,Combinatorial algorithms (Algorithmics Press, New York, 1972) pp. 91\u201396."},{"key":"BF02591770_CR10","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1137\/0205048","volume":"5","author":"S. Even","year":"1976","unstructured":"S. Even, A. Itai and A. Shamir, \u201cOn the complexity of timetable and multicommodity flow problems\u201d,SIAM Journal on Computing 5 (1976) 691\u2013703.","journal-title":"SIAM Journal on Computing"},{"key":"BF02591770_CR11","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1007\/BF01584085","volume":"1","author":"D.R. Fulkerson","year":"1971","unstructured":"D.R. Fulkerson, \u201cBlocking and anti-blocking pairs of polyhedra\u201d,Mathematical Programming 1 (1971) 168\u2013194.","journal-title":"Mathematical Programming"},{"key":"BF02591770_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01580218","volume":"6","author":"D.R. Fulkerson","year":"1974","unstructured":"D.R. Fulkerson, \u201cPacking rooted directed cuts in a weighted directed graph\u201d,Mathematical Programming 6 (1974) 1\u201313.","journal-title":"Mathematical Programming"},{"key":"BF02591770_CR13","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0095-8956(75)90052-0","volume":"18","author":"D.R. Fulkerson","year":"1975","unstructured":"D.R. Fulkerson and D.B. Weinberger, \u201cBlocking pairs of polyhedra arising from network flows\u201d,Journal of Combinatorial Theory 18 (1975) 265\u2013283.","journal-title":"Journal of Combinatorial Theory"},{"key":"BF02591770_CR14","volume-title":"Integer programming","author":"R.S. Garfinkel","year":"1972","unstructured":"R.S. Garfinkel and G.L. Nemhauser,Integer programming (Wiley, New York, 1972)."},{"key":"BF02591770_CR15","volume-title":"Submodular functions, graphs and integer polyhedra","author":"F.R. Giles","year":"1975","unstructured":"F.R. Giles, \u201cSubmodular functions, graphs and integer polyhedra\u201d, Ph.D. thesis, University of Waterloo, Waterloo, Ontario, Canada (1975)."},{"key":"BF02591770_CR16","series-title":"Annals of Mathematics Studies","first-page":"223","volume-title":"Linear inequalities and related systems","author":"A.J. Hoffman","year":"1956","unstructured":"A.J. Hoffman and J.G. Kruskal, \u201cIntegral boundary points of convex polyhedra\u201d, in: H.W. Kuhn and A.W. Tucker, eds.,Linear inequalities and related systems, Annals of Mathematics Studies 38 (Princeton University Press, Princeton, NJ, 1956) pp. 223\u2013246."},{"key":"BF02591770_CR17","volume-title":"Combinatorial optimization: Networks and matroids","author":"E.L. Lawler","year":"1976","unstructured":"E.L. Lawler,Combinatorial optimization: Networks and matroids (Holt. Rinehart and Winston. New York, 1976)."},{"key":"BF02591770_CR18","volume-title":"Network models for linear programming problems with integer rounding properties","author":"M.D. McDaniel","year":"1981","unstructured":"M.D. McDaniel, \u201cNetwork models for linear programming problems with integer rounding properties\u201d, M.S. thesis, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, NY (1981)."},{"key":"BF02591770_CR19","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1017\/S0305004100051677","volume":"78","author":"C.J.H. McDiarmid","year":"1975","unstructured":"C.J.H. McDiarmid, \u201cRado's theorem for polymatroids\u201d,Mathematical Proceedings of the Cambridge Philosophical Society 78 (1975) 263\u2013281.","journal-title":"Mathematical Proceedings of the Cambridge Philosophical Society"},{"key":"BF02591770_CR20","series-title":"Tech. Rep.","volume-title":"On pairs of strongly-base-orderable matroids","author":"C.J.H. McDiarmid","year":"1976","unstructured":"C.J.H. McDiarmid, \u201cOn pairs of strongly-base-orderable matroids\u201d, Tech. Rep. No. 283, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, NY (1976)."},{"key":"BF02591770_CR21","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/0095-8956(78)90008-4","volume":"25","author":"C.J.H. McDiarmid","year":"1978","unstructured":"C.J.H. McDiarmid, \u201cBlocking, anti-blocking and pairs of matroids and polymatroids\u201d,Journal of Combinatorial Theory B25 (1978) 313\u2013325.","journal-title":"Journal of Combinatorial Theory B"},{"key":"BF02591770_CR22","series-title":"Sloan School of Management Tech. Rept.","volume-title":"A polynomial algorithm for integer programming covering problems satisfying the integer round-up property","author":"J.B. Orlin","year":"1980","unstructured":"J.B. Orlin, \u201cA polynomial algorithm for integer programming covering problems satisfying the integer round-up property\u201d, Sloan School of Management Tech. Rept., MIT, Cambridge, MA (1980)."},{"key":"BF02591770_CR23","series-title":"Mathematical Centre Tracts","volume-title":"Matroids and linking systems","author":"A. Schrijver","year":"1977","unstructured":"A. Schrijver, \u201cMatroids and linking systems\u201d,Mathematical Centre Tracts 88, Mathematisch Centrum, Amsterdam (1977)."},{"key":"BF02591770_CR24","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BFb0121199","volume":"8","author":"L.E. Trotter","year":"1978","unstructured":"L.E. Trotter and D.B. Weinberger, \u201cSymmetric blocking and anti-blocking relations for generalized circulations\u201d,Mathematical Programming Study 8 (1978) 141\u2013158.","journal-title":"Mathematical Programming Study"},{"key":"BF02591770_CR25","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1007\/BF01580384","volume":"11","author":"D.B. Weinberger","year":"1976","unstructured":"D.B. Weinberger, \u201cTransversal matroid intersections and related packings\u201d,Mathematical Programming 11 (1976) 164\u2013176.","journal-title":"Mathematical Programming"},{"key":"BF02591770_CR26","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1287\/opre.24.2.272","volume":"24","author":"D.B. Weinberger","year":"1976","unstructured":"D.B. Weinberger, \u201cNetwork flows, minimum coverings, and the four-color conjecture\u201d,Operations Research 24 (1976) 272\u2013290.","journal-title":"Operations Research"},{"key":"BF02591770_CR27","volume-title":"Matroid theory","author":"D.J.A. Welsh","year":"1976","unstructured":"D.J.A. Welsh,Matroid theory (Academic Press, London, 1976)."},{"key":"BF02591770_CR28","first-page":"230","volume":"9","author":"D. Werra de","year":"1971","unstructured":"D. de Werra, \u201cBalanced schedules\u201d,INFOR 9 (1971) 230\u2013237.","journal-title":"INFOR"},{"key":"BF02591770_CR29","first-page":"3","volume":"3","author":"D. Werra de","year":"1971","unstructured":"D. de Werra, \u201cEquitable colorations of graphs\u201d,Revue Fran\u00e7aise d'Informatique et de Recherche Op\u00e9rationnelle R-3 (1971) 3\u20138.","journal-title":"Revue Fran\u00e7aise d'Informatique et de Recherche Op\u00e9rationnelle R"},{"key":"BF02591770_CR30","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/BF01589329","volume":"20","author":"D. Werra de","year":"1981","unstructured":"D. de Werra, \u201cOn some characterisations of totally unimodular matrices\u201d,Mathematical Programming 20 (1981) 14\u201321.","journal-title":"Mathematical Programming"},{"issue":"2","key":"BF02591770_CR31","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1112\/jlms\/s2-10.1.27","volume":"10","author":"D. Woodwall","year":"1975","unstructured":"D. Woodwall, \u201cThe induction of matroids by graphs\u201d,Journal of the London Mathematical Society 10(2) (1975) 27\u201335.","journal-title":"Journal of the London Mathematical Society"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02591770.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02591770\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02591770","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T19:37:49Z","timestamp":1558381069000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02591770"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,6]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1983,6]]}},"alternative-id":["BF02591770"],"URL":"https:\/\/doi.org\/10.1007\/bf02591770","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1983,6]]}}}