Submodular Function Minimization

[1]  Kiyohito Nagano,et al.  A strongly polynomial algorithm for line search in submodular polyhedra , 2007, Discret. Optim..

[2]  Vahab S. Mirrokni,et al.  Maximizing Non-Monotone Submodular Functions , 2011, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[3]  Kiyohito Nagano,et al.  On Convex Minimization over Base Polytopes , 2007, IPCO.

[4]  James B. Orlin,et al.  A faster strongly polynomial time algorithm for submodular function minimization , 2007, Math. Program..

[5]  Martin Skutella,et al.  Solving Evacuation Problems Efficiently--Earliest Arrival Flows with Multiple Sources , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[6]  Robin O. Roundy,et al.  A continuous‐time strategic capacity planning model , 2005 .

[7]  Satoru Iwata,et al.  A push-relabel framework for submodular function minimization and applications to parametric optimization , 2003, Discret. Appl. Math..

[8]  Jens Vygen,et al.  A note on Schrijver's submodular function minimization algorithm , 2003, J. Comb. Theory, Ser. B.

[9]  S. Fujishige.  Submodular function minimization and related topics , 2003, Optim. Methods Softw..

[10]  Zuo-Jun Max Shen,et al.  A Joint Location - Inventory Model , 2003, Transp. Sci..

[11]  Jacques Desrosiers,et al.  Selected Topics in Column Generation , 2002, Oper. Res..

[12]  J. A. d'Auriac,et al.  Optimal cooperation and submodularity for computing Potts' partition functions with a large number of states , 2002, cond-mat/0204055.

[13]  Satoru Iwata,et al.  A descent method for submodular function minimization , 2002, Math. Program..

[14]  Satoru Iwata,et al.  A faster capacity scaling algorithm for minimum cost submodular flow , 2002, Math. Program..

[15]  Satoru Iwata,et al.  A fully combinatorial algorithm for submodular function minimization , 2001, SODA '02.

[16]  Satoru Iwata,et al.  A combinatorial strongly polynomial algorithm for minimizing submodular functions , 2001, JACM.

[17]  Alexander Schrijver,et al.  A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time , 2000, J. Comb. Theory B.

[18]  Satoru Iwata,et al.  Improved algorithms for submodular function minimization and submodular flow , 2000, STOC '00.

[19]  S. Fujishige,et al.  A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions , 2000, STOC '00.

[20]  Donald Goldfarb,et al.  A new scaling algorithm for the minimum cost network flow problem , 1999, Oper. Res. Lett..

[21]  Satoru Iwata,et al.  A Strongly Polynomial Cut Canceling Algorithm for the Submodular Flow Problem , 1999, IPCO.

[22]  Sanjeev Arora,et al.  Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems , 1998, JACM.

[23]  Maurice Queyranne,et al.  Minimizing symmetric submodular functions , 1998, Math. Program..

[24]  Martin C. Cooper,et al.  Constraints, Consistency and Closure , 1998, Artif. Intell..

[25]  D. M. Topkis.  Supermodularity and Complementarity , 1998 .

[26]  Pierre Hansen,et al.  Stabilized column generation , 1998, Discret. Math..

[27]  Andrew V. Goldberg,et al.  On Implementing the Push—Relabel Method for the Maximum Flow Problem , 1997, Algorithmica.

[28]  Andrew V. Goldberg,et al.  Beyond the flow decomposition barrier , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[29]  Mauro Dell'Amico,et al.  Annotated Bibliographies in Combinatorial Optimization , 1997 .

[30]  Satoru Iwata,et al.  A capacity scaling algorithm for convex cost submodular flows , 1996, SODA '96.

[31]  Michel X. Goemans,et al.  Minimizing submodular functions over families of sets , 1995, Comb..

[32]  Andrew V. Goldberg,et al.  On Implementing Push-Relabel Method for the Maximum Flow Problem , 1995, IPCO.

[33]  S. Thomas McCormick,et al.  Two Strongly Polynomial Cut Cancelling Algorithms for Minimum Cost Network Flow , 1993, Discret. Appl. Math..

[34]  David D. Yao,et al.  Multiclass Queueing Systems: Polymatroidal Structure and Optimal Scheduling Control , 1992, Oper. Res..

[35]  Toshihide Ibaraki,et al.  Computing Edge-Connectivity in Multigraphs and Capacitated Graphs , 1992, SIAM J. Discret. Math..

[36]  Andrew V. Goldberg,et al.  Finding Minimum-Cost Circulations by Successive Approximation , 1990, Math. Oper. Res..

[37]  Dimitri P. Bertsekas,et al.  Distributed Asynchronous Relaxation Methods for Linear Network Flow Problems , 1987 .

[38]  Andrew V. Goldberg,et al.  A new approach to the maximum flow problem , 1986, STOC '86.

[39]  Éva Tardos,et al.  Layered Augmenting Path Algorithms , 1986, Math. Oper. Res..

[40]  R. E. Bixby,et al.  The Partial Order of a Polymatroid Extreme Point , 1985, Math. Oper. Res..

[41]  Frieda Granot,et al.  Substitutes, Complements and Ripples in Network Flows , 1985, Math. Oper. Res..

[42]  Éva Tardos,et al.  A strongly polynomial minimum cost circulation algorithm , 1985, Comb..

[43]  William H. Cunningham,et al.  Testing membership in matroid polyhedra , 1984, J. Comb. Theory, Ser. B.

[44]  Harold N. Gabow,et al.  Scaling algorithms for network problems , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[45]  William H. Cunningham,et al.  Decomposition of submodular functions , 1983, Comb..

[46]  J. Picard,et al.  Selected Applications of Minimum Cuts in Networks , 1982 .

[47]  E. L. Lawler,et al.  Computing Maximal "Polymatroidal" Network Flows , 1982, Math. Oper. Res..

[48]  Nimrod Megiddo,et al.  Applying parallel computation algorithms in the design of serial algorithms , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[49]  Maurice Queyranne,et al.  Theoretical Efficiency of the Algorithm "Capacity" for the Maximum Flow Problem , 1980, Math. Oper. Res..

[50]  Satoru Fujishige,et al.  Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector , 1980, Math. Oper. Res..

[51]  Robert J. Plemmons,et al.  Nonnegative Matrices in the Mathematical Sciences , 1979, Classics in Applied Mathematics.

[52]  Donald M. Topkis,et al.  Minimizing a Submodular Function on a Lattice , 1978, Oper. Res..

[53]  Philip Wolfe,et al.  Finding the nearest point in A polytope , 1976, Math. Program..

[54]  Richard M. Karp,et al.  Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.

[55]  T. C. Hu,et al.  Multi-Terminal Network Flows , 1961 .

[56]  Sahar Karimi,et al.  Max-cut Problem , 2007 .

[57]  D. SIAMJ..  BISUBMODULAR FUNCTION MINIMIZATION∗ , 2006 .

[58]  S. Fujishige,et al.  The Minimum-Norm-Point Algorithm Applied to Submodular Function Minimization and Linear Programming , 2006 .

[59]  Yingdong Lu,et al.  Order-Based Cost Optimization in Assemble-to-Order Systems , 2005, Oper. Res..

[60]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[61]  Jack Edmonds,et al.  Submodular Functions, Matroids, and Certain Polyhedra , 2001, Combinatorial Optimization.

[62]  C. SIAMJ..  A FASTER SCALING ALGORITHM FOR MINIMIZING SUBMODULAR FUNCTIONS∗ , 2001 .

[63]  Ronald L. Rivest,et al.  Introduction to Algorithms, Second Edition , 2001 .

[64]  Lisa Fleischer,et al.  Recent Progress in Submodular Function Minimization , 2000 .

[65]  Kazuo Murota,et al.  Discrete convex analysis , 1998, Math. Program..

[66]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[67]  James G. Oxley,et al.  Matroid theory , 1992 .

[68]  藤重 悟.  Submodular functions and optimization , 1991 .

[69]  J. G. Pierce,et al.  Geometric Algorithms and Combinatorial Optimization , 2016 .

[70]  S. Fujishige.  Submodular systems and related topics , 1984 .

[71]  Martin Grötschel,et al.  Mathematical Programming The State of the Art, XIth International Symposium on Mathematical Programming, Bonn, Germany, August 23-27, 1982 , 1983, ISMP.

[72]  László Lovász,et al.  Submodular functions and convexity , 1982, ISMP.

[73]  Martin Grötschel,et al.  The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..

[74]  P. Schönsleben.  Ganzzahlige Polymatroid-Intersektions-Algorithmen , 1980 .

[75]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[76]  J. Edmonds,et al.  A Min-Max Relation for Submodular Functions on Graphs , 1977 .

[77]  E. A. Dinic.  Algorithm for solution of a problem of maximal flow in a network with power estimation , 1970 .