0/1-Integer Programming: Optimization and Augmentation are Equivalent
暂无分享,去创建一个
[1] N. Biggs. GEOMETRIC ALGORITHMS AND COMBINATORIAL OPTIMIZATION: (Algorithms and Combinatorics 2) , 1990 .
[2] András Frank,et al. An application of simultaneous diophantine approximation in combinatorial optimization , 1987, Comb..
[3] L. Lovász,et al. Geometric Algorithms and Combinatorial Optimization , 1981 .
[4] Ravindra K. Ahuja,et al. Network Flows: Theory, Algorithms, and Applications , 1993 .
[5] M. Grötschel,et al. Combinatorial optimization , 1996 .
[6] Ken Darby-Dowman,et al. Discrete Structures and Algorithms , 1981 .
[7] Richard M. Karp,et al. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.
[8] László Lovász,et al. Algorithmic theory of numbers, graphs and convexity , 1986, CBMS-NSF regional conference series in applied mathematics.
[9] Harold N. Gabow,et al. Scaling algorithms for network problems , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).