On the Set-Covering Problem
暂无分享,去创建一个
[1] I. Heller,et al. 14 . An Extension of a Theorem of Dantzig’s , 1957 .
[2] J. P. Arabeyre,et al. The Airline Crew Scheduling Problem: A Survey , 1969 .
[3] R. Roth,et al. Computer Solutions to Minimum-Cover Problems , 1969, Oper. Res..
[4] Kurt Spielberg,et al. Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems , 1971, Oper. Res..
[5] M. Balinski,et al. On an Integer Program for a Delivery Problem , 1964 .
[6] J. Roth. Algebraic topological methods for the synthesis of switching systems. I , 1958 .
[7] Abraham Charnes,et al. A MODEL FOR THE OPTIMAL PROGRAMMING OF RAILWAY FREIGHT TRAIN MOVEMENTS , 1956 .
[8] George B. Dantzig,et al. The Truck Dispatching Problem , 1959 .
[9] George L. Nemhauser,et al. The Set-Partitioning Problem: Set Covering with Equality Constraints , 1969, Oper. Res..
[10] H. D. Ratliff,et al. Set Covering and Involutory Bases , 1971 .
[11] J. F. Pierce. Application of Combinatorial Programming to a Class of All-Zero-One Integer Programming Problems , 1968 .
[12] E. Balas,et al. Canonical Cuts on the Unit Hypercube , 1972 .
[13] J. F. McCloskey,et al. An analysis of stewardess requirements and scheduling for a major domestic airline , 1957 .