When is min cut with negative edges easy to solve? Easy and difficult objective functions for max cut
暂无分享,去创建一个
[1] Paolo Toth,et al. The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.
[2] Tomasz Radzik,et al. Parametric Flows, Weighted Means of Cuts, and Fractional Combinatorial Optimization , 1993 .
[3] T. C. Hu,et al. Multi-Terminal Network Flows , 1961 .
[4] Jan Vondrák,et al. Optimization via enumeration: a new algorithm for the Max Cut Problem , 2001, Math. Program..
[5] S. Thomas McCormick,et al. Computing Maximum Mean Cuts , 1994, Discret. Appl. Math..
[6] Tomasz Radzik. Newton's method for fractional combinatorial optimization , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[7] Rajeev Kohli,et al. The Minimum Satisfiability Problem , 1994, SIAM J. Discret. Math..
[8] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[9] Michel Deza,et al. Geometry of cuts and metrics , 2009, Algorithms and combinatorics.
[10] Ravindra K. Ahuja,et al. Network Flows: Theory, Algorithms, and Applications , 1993 .