{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,22]],"date-time":"2026-06-22T20:44:56Z","timestamp":1782161096634,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T00:00:00Z","timestamp":1497830400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001711","name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","doi-asserted-by":"publisher","award":["200021_165866"],"award-info":[{"award-number":["200021_165866"]}],"id":[{"id":"10.13039\/501100001711","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,6,19]]},"DOI":"10.1145\/3055399.3055473","type":"proceedings-article","created":{"date-parts":[[2017,6,15]],"date-time":"2017-06-15T20:27:45Z","timestamp":1497558465000},"page":"1206-1219","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":41,"title":["A strongly polynomial algorithm for bimodular integer linear programming"],"prefix":"10.1145","author":[{"given":"Stephan","family":"Artmann","sequence":"first","affiliation":[{"name":"ETH Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Robert","family":"Weismantel","sequence":"additional","affiliation":[{"name":"ETH Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rico","family":"Zenklusen","sequence":"additional","affiliation":[{"name":"ETH Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2017,6,19]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(03)00095-5"},{"key":"e_1_3_2_2_2_1","unstructured":"G. Appa B. Kotnyek K. Papalamprou and L. Pitsoulis. 2007.  G. Appa B. Kotnyek K. Papalamprou and L. Pitsoulis. 2007."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2006.04.003"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2016.07.004"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0195-6698(87)80025-2"},{"key":"e_1_3_2_2_6_1","volume-title":"Proceedings of the 34th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS). 187\u2013198","author":"Bock A.","unstructured":"A. Bock , Y. Faenza , C. Moldenhauer , R. Vargas , and A. Jacinto . 2014. Solving the Stable Set Problem in Terms of the Odd Cycle Packing Number . In Proceedings of the 34th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS). 187\u2013198 . A. Bock, Y. Faenza, C. Moldenhauer, R. Vargas, and A. Jacinto. 2014. Solving the Stable Set Problem in Terms of the Odd Cycle Packing Number. In Proceedings of the 34th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS). 187\u2013198."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-014-9601-x"},{"key":"e_1_3_2_2_8_1","unstructured":"C. Burch R. Carr S. Krumke M. Marathe C. Phillips and E. Sundberg. 2003.  C. Burch R. Carr S. Krumke M. Marathe C. Phillips and E. Sundberg. 2003."},{"key":"e_1_3_2_2_9_1","volume-title":"Network Interdiction and Stochastic Integer Programming","author":"A","unstructured":"A decomposition-based pseudoapproximation algorithm for network flow inhibition. In Network Interdiction and Stochastic Integer Programming . Springer , Chapter 3, 51\u201368. A decomposition-based pseudoapproximation algorithm for network flow inhibition. In Network Interdiction and Stochastic Integer Programming. Springer, Chapter 3, 51\u201368."},{"key":"e_1_3_2_2_10_1","unstructured":"S. Chestnut and R. Zenklusen. 2017.  S. Chestnut and R. Zenklusen. 2017."},{"key":"e_1_3_2_2_11_1","volume-title":"Mathematics of Operations Research 42, 1","author":"Combinatorial Optimization Interdicting Structured","year":"2017","unstructured":"Interdicting Structured Combinatorial Optimization Problems with 0, 1-Objectives. Mathematics of Operations Research 42, 1 ( 2017 ), 144\u2013166. Interdicting Structured Combinatorial Optimization Problems with 0, 1-Objectives. Mathematics of Operations Research 42, 1 (2017), 144\u2013166."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/3119414.3119579"},{"key":"e_1_3_2_2_13_1","unstructured":"F. Eisenbrand and S. Vempala. 2016.  F. Eisenbrand and S. Vempala. 2016."},{"key":"e_1_3_2_2_14_1","unstructured":"Geometric Random Edge. (2016).  Geometric Random Edge. (2016)."},{"key":"e_1_3_2_2_15_1","unstructured":"https: \/\/arxiv.org\/abs\/1404.1568v5.  https: \/\/arxiv.org\/abs\/1404.1568v5."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01192523"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(93)00173-W"},{"key":"e_1_3_2_2_18_1","unstructured":"M. Gr\u00f6tschel L. Lov\u00e1sz and A. Schrijver. 1993.  M. Gr\u00f6tschel L. Lov\u00e1sz and A. Schrijver. 1993."},{"key":"e_1_3_2_2_19_1","volume-title":"Algorithms and Combinatorics","author":"Algorithms Geometric","unstructured":"Geometric Algorithms and Combinatorial Optimization (second corrected ed.). Algorithms and Combinatorics , Vol. 2 . Springer . Geometric Algorithms and Combinatorial Optimization (second corrected ed.). Algorithms and Combinatorics, Vol. 2. Springer."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/502090.502096"},{"key":"e_1_3_2_2_21_1","unstructured":"B. Korte and J. Vygen. 2012.  B. Korte and J. Vygen. 2012."},{"key":"e_1_3_2_2_22_1","volume-title":"Theory and Algorithms","author":"Optimization Combinatorial","unstructured":"Combinatorial Optimization , Theory and Algorithms ( 5 th ed.). Springer . Combinatorial Optimization, Theory and Algorithms (5th ed.). Springer.","edition":"5"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-007-0189-2"},{"key":"e_1_3_2_2_24_1","unstructured":"A. Schrijver. 1986.  A. Schrijver. 1986."},{"key":"e_1_3_2_2_25_1","volume-title":"John Wiley and Sons","author":"Linear Theory","unstructured":"Theory of Linear and Integer Programming . John Wiley and Sons , NY. Theory of Linear and Integer Programming. John Wiley and Sons, NY."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.2000.1989"},{"key":"e_1_3_2_2_27_1","unstructured":"A. Schrijver. 2003.  A. Schrijver. 2003."},{"key":"e_1_3_2_2_28_1","unstructured":"Combinatorial Optimization - Polyhedra and Efficiency. Springer.  Combinatorial Optimization - Polyhedra and Efficiency. Springer."},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(80)90075-1"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/2780615.2780622"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2008.12.002"},{"key":"e_1_3_2_2_32_1","unstructured":"V. A. Yemelichev M. M. Kovalev and M. K. Kravtsov. 1986.  V. A. Yemelichev M. M. Kovalev and M. K. Kravtsov. 1986."}],"event":{"name":"STOC '17: Symposium on Theory of Computing","location":"Montreal Canada","acronym":"STOC '17","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3055399.3055473","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3055399.3055473","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:36:19Z","timestamp":1750217779000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3055399.3055473"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,19]]},"references-count":32,"alternative-id":["10.1145\/3055399.3055473","10.1145\/3055399"],"URL":"https:\/\/doi.org\/10.1145\/3055399.3055473","relation":{},"subject":[],"published":{"date-parts":[[2017,6,19]]},"assertion":[{"value":"2017-06-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}