Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization

Mathematical Programming

Volumn 122, Issue 1, 2010, Pages 87-120

  McCormick, S Thomas ^a   Fujishige, Satoru ^b  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^b KYOTO UNIVERSITY   (Japan)

Author keywords

68W40; Mathematics Subject Classification (2000): Primary: 65K05; Secondary: 90C27

Indexed keywords

68W40; COMBINATORIAL ALGORITHM; MATHEMATICS SUBJECT CLASSIFICATION (2000): PRIMARY: 65K05; SECONDARY: 90C27; STRONGLY POLYNOMIAL ALGORITHM; SUBMODULAR FUNCTION MINIMIZATION; SUBMODULAR FUNCTIONS;

ALGORITHMS; FUNCTION EVALUATION; OPTIMIZATION; POLYNOMIALS;

COMBINATORIAL MATHEMATICS;

EID: 68449099642     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-008-0242-9     Document Type: Article

References (54)

1. Ando, K., Fujishige, S.: ∪,∩-closed families and signed posets. Report no. 93813, Forschungsinstitut für Diskrete Mathematik, Universität Bonn (1994)
2. K. Ando S. Fujishige 1996 On structures of bisubmodular polyhedra Math. Prog. 74 293 317
3. K. Ando S. Fujishige T. Naitoh 1996 A characterization of bisubmodular functions Discrete Math. 148 299 303
4. K. Ando S. Fujishige T. Nemoto 1996 The minimum-weight ideal problem for signed posets J. OR Soc. Jpn. 39 558 565
5. K. Ando S. Fujishige T. Nemoto 1996 Decomposition of a bidirected graph into strongly connected components and its signed poset structure Disc. Appl. Math. 68 237 248
6. Applegate D.L., Bixby R.E., Chvátal V., Cook W.J.: The traveling salesman problem: a computational study. Princeton University Press, Princeton (2007)
7. Bilbao Arrese, J.M., Fernández García, J.R., Jiménez Jiménez, M., López Vázquez, J.J.: A survey of bicooperative games. In: Proceedings of the 4th Twente Workshop on Cooperative Game Theory, Enschede, the Netherlands, pp. 5-15 (2005)
8. Birkhoff, G.: Lattice Theory. American Mathematical Society (1967)
9. R.E. Bixby W.H. Cunningham D.M. Topkis 1985 The partial order of a polymatroid extreme point Math. OR 10 367 378
10. A. Bouchet 1989 Matchings and Δ-matroids Discrete Math. 24 55 62
11. A. Bouchet W.H. Cunningham 1995 Delta-matroids, jump systems and bisubmodular polyhedra SIAM J. Disc. Math. 8 17 32
12. R. Chandrasekaran S.N. Kabadi 1988 Pseudomatroids Disc. Math. 71 205 217
13. W.H. Cunningham 1984 Testing membership in matroid polyhedra JCT Ser. B 36 161 188
14. W.H. Cunningham J. Green-Krótki 1991 b-matching degree sequence polyhedra Combinatorica 11 219 230
15. W.H. Cunningham J. Green-Krótki 1994 A separation algorithm for the matchable set polytope Math. Prog. 65 139 150
16. A. Dress T.F. Havel 1986 Some combinatorial properties of discriminants in metric vector spaces Adv. Math. 62 285 312
17. F.D.J. Dunstan D.J.A. Welsh 1973 A greedy algorithm for solving a certain class of linear programmes Math. Prog. 62 338 353
18. Fleischer, L.K., Iwata, S.: A push-relabel framework for submodular function minimization and applications to parametric optimization. "Submodularity" special issue of Discrete Applied Mathematics. In: Fujishige S. (ed.) 131, 311-322 (2003)
19. S. Fujishige 1984 A system of linear inequalities with a submodular function on {0, ± 1}-vectors Lin. Alg. Appl. 63 253 266
20. S. Fujishige 1997 A min-max theorem for bisubmodular polyhedra SIAM J. Disc. Math. 10 294 308
21. S. Fujishige 2003 Submodular function minimization and related topics Optim. Methods Softw. 18 169 180
22. Fujishige S.: Submodular Functions and Optimization, 2nd edn. Elsevier, Amsterdam (2005)
23. Fujishige, S., Hayashi, T., Isotani, S.: The minimum-norm-point algorithm applied to submodular function minimization and linear programming. Research Institute for Mathematical Sciences, RIMS-1571, Kyoto University, Kyoto (2006, Preprint)
24. Fujishige, S., Iwata, S.: Bisubmodular function minimization. SIAM J. Disc. Math. 19, pp. 1065-1073;
25. an earlier version appeared in Proceedings of the 8th Conference on Integer Programming and Combinatorial Optimization (IPCO Utrecht 2001), Lecture Notes in Computer Science 2081, Aardal, K., Gerards, B. (eds.) Springer, Berlin, 160-169 (2006)
26. A.V. Goldberg A.V. Karzanov 2004 Maximum skew-symmetric flows and matchings Math. Program. 100 537 568
27. A.V. Goldberg R.E. Tarjan 1990 Finding minimum-cost circulations by successive approximation Math. Oper. Res. 15 430 466
28. M. Grötschel L. Lovász A. Schrijver 1981 The ellipsoid algorithm and its consequences in combinatorial optimization Combinatorica 1 499 513
29. Grötschel M., Lovász L., Schrijver A.: Geometric Algorithms and Combinatorial Optimization. Springer, Heidelberg (1988)
30. Hochbaum, D.S.: Polynomial and strongly polynomial algorithms for convex network optimization. In: Du, D.Z., Pardalos, P.M. (eds.) Network Optimization Problems, pp. 63-92 (1993)
31. S. Iwata 2002 A fully combinatorial algorithm for submodular function minimization J. Combin. Theory Ser. B 84 203 212
32. Iwata, S.: A faster scaling algorithm for minimizing submodular functions. SIAM J. Comput. 32, 833-840;
33. an extended abstract appeared In Proceedings of the 9th Conference on Integer Programming and Combinatorial Optimization (IPCO MIT), Lecture Notes in Computer Science 2337 (Cook, W.J., Schulz, A.S. (eds.)), Springer, Berlin, pp. 1-8 (2003)
34. S. Iwata 2008 Submodular function minimization Math. Program. 112 45 64
35. S. Iwata L. Fleischer S. Fujishige 2001 A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions J. ACM 48 761 777
36. Kabadi, S.N.: Characterization and development of solution methods for special classes of totally dual integral systems. Dissertation, School of Management, University of Texas at Dallas (1984)
37. S.N. Kabadi R. Chandrasekaran 1990 On totally dual integral systems Disc. Appl. Math. 26 87 104
38. McCormick S.T.: Submodular function minimization. In: Aardal, K., Nemhauser, G., Weismantel, R.(eds) A chapter in the Handbook on Discrete Optimization., Elsevier, Amsterdam (2006)
39. N. Megiddo 1979 Combinatorial optimization with rational objective functions Math. Oper. Res. 4 414 424
40. Murota K.: Discrete Convex Analysis. SIAM Monographs on Discrete Mathematics and Applications, Society for Industrial and Applied Mathematics, Philadelphia (2003)
41. K. Nagano 2007 A strongly polynomial algorithm for line search in submodular polyhedra Disc. Optim. 4 349 359
42. Nagano, K.: On convex minimization over base polytopes. In: Fischetti, M., Williamson, D. (eds.) Proceedings of IPCO 12. Ithaca, pp. 252-266 (2007)
43. M. Nakamura 1988 A characterization of greedy sets-universal polymatroids I Scientific Papers of the College of Arts and Sciences, The University of Tokyo 38 155 167
44. Orlin, J.B.: A faster strongly polynomial algorithm for submodular function minimization. Math. Prog. In: Proceedings of IPCO 12, Fischetti, M., Williamson, D. (eds.) Ithaca, pp. 240-251 (2007, To appear)
45. L. Qi 1988 Directed submodularity, ditroids, and directed submodular flows Math. Prog. 42 579 599
46. M.N. Queyranne Y. Wang 1991 Single-machine scheduling polyhedra with precedence constraints Math. OR 16 1 20
47. V. Reiner 1993 Signed posets J. Comb. Theory A 62 324 360
48. A. Schrijver 1984 Proving total dual integrality with cross-free families-a general framework Math. Program. 29 15 27
49. Shrijver A.: Theory of Linear and Integer Programming. Wiley, New York (1986)
50. A. Schrijver 2000 A combinatorial algorithm minimizing submodular functions in strongly polynomial time J. Combin. Theory Ser. B 80 346 355
51. Schrijver A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Berlin (2003)
52. É. Tardos 1985 A strongly polynomial minimum cost circulation algorithm Combinatorica 5 247 256
53. J. Vygen 2003 A note on Schrijver's submodular function minimization algorithm JCT B 88 399 402
54. F. Zhang 2003 A separation algorithm for b-matching degree-sequence polyhedra Math. Oper. Res. 28 92 102