Solving fixed charge network problems with group theory‐based penalties
暂无分享,去创建一个
[1] M. Balinski. Fixed‐cost transportation problems , 1961 .
[2] R E Gomory,et al. ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS. , 1965, Proceedings of the National Academy of Sciences of the United States of America.
[3] Ellis L Johnson,et al. PROGRAMMING IN NETWORKS AND GRAPHS , 1965 .
[4] Ellis L. Johnson,et al. Some continuous functions related to corner polyhedra , 1972, Math. Program..
[5] R. Gomory. Some polyhedra related to combinatorial problems , 1969 .
[6] Darwin Klingman,et al. NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems , 1974 .
[7] R E Gomory,et al. Faces of an integer polyhedron. , 1967, Proceedings of the National Academy of Sciences of the United States of America.
[8] P. Gray. Mixed integer programming algorithms for site selection and other fixed charge problems having capacity constraints , 1967 .