UPPER PLANES OF QUADRATIC 0–1 FUNCTIONS AND STABILITY IN GRAPHS
暂无分享,去创建一个
[1] P. Hammer,et al. Vertices Belonging to All or to No Maximum Stable Sets of a Graph , 1982 .
[2] P. Hammer,et al. Quadratic knapsack problems , 1980 .
[3] M. L. Fisher,et al. An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..
[4] Leslie E. Trotter,et al. Vertex packings: Structural properties and algorithms , 1975, Math. Program..
[5] P. Hammer,et al. Linear Decomposition of a Positive Group-Boolean Function , 1974 .
[6] Hamdy A. Taha. Concave minimization over a convex polyhedron , 1973 .
[7] J. Rhys. A Selection Problem of Shared Fixed Costs and Network Flows , 1970 .
[8] Katta G. Murty,et al. Solving the Fixed Charge Problem by Ranking the Extreme Points , 1968, Oper. Res..
[9] T. L. Ray,et al. A Branch-Bound Algorithm for Plant Location , 1966, Oper. Res..
[10] Michel Balinski,et al. Integer Programming: Methods, Uses, Computations , 1965 .
[11] M. Balinski. Fixed‐cost transportation problems , 1961 .
[12] E. Beale. An algorithm for solving the transportation problem when the shipping cost over each route is convex , 1959 .