Set Partitioning: A survey
暂无分享,去创建一个
[1] H. Weyl. Elementare Theorie der konvexen Polyeder , 1934 .
[2] Willard Van Orman Quine,et al. A Way to Simplify Truth Functions , 1955 .
[3] C Berge,et al. TWO THEOREMS IN GRAPH THEORY. , 1957, Proceedings of the National Academy of Sciences of the United States of America.
[4] J. Roth. Algebraic topological methods for the synthesis of switching systems. I , 1958 .
[5] Ralph E. Gomory,et al. An algorithm for integer solutions to linear programs , 1958 .
[6] Stephen H. Unger,et al. Minimizing the Number of States in Incompletely Specified Sequential Switching Functions , 1959, IRE Trans. Electron. Comput..
[7] George B. Dantzig,et al. The Truck Dispatching Problem , 1959 .
[8] George B. Dantzig,et al. Linear programming and extensions , 1965 .
[9] M. Balinski,et al. On an Integer Program for a Delivery Problem , 1964 .
[10] G. Clarke,et al. Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .
[11] James G. Root. An Application of Symbolic Logic to a Selection Problem , 1964 .
[12] F. Glover. A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem , 1965 .
[13] E. Balas. An Additive Algorithm for Solving Linear Programs with Zero-One Variables , 1965 .
[14] Michel Balinski,et al. Integer Programming: Methods, Uses, Computations , 1965 .
[15] J. Edmonds. Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.
[16] Jack Edmonds,et al. Maximum matching and a polyhedron with 0,1-vertices , 1965 .
[17] James F. Gimpel. A Reduction Technique for Prime Implicant Tables , 1964, IEEE Trans. Electron. Comput..
[18] James Anthony Moreland. Scheduling of airline flight crews , 1966 .
[19] A. M. Geoffrion. Integer Programming by Implicit Enumeration and Balas’ Method , 1967 .
[20] J. F. Pierce. Application of Combinatorial Programming to a Class of All-Zero-One Integer Programming Problems , 1968 .
[21] Andrew B. Whinston,et al. A New Approach to Discrete Mathematical Programming , 1968 .
[22] Frank Harary,et al. Graph Theory , 2016 .
[23] Horst Steinmann,et al. Letter to the Editor - Computational Experience with a Zero-One Programming Problem , 1969, Oper. Res..
[24] Herv Thiriez,et al. Airline crew scheduling : a group theoretic approach , 1969 .
[25] George L. Nemhauser,et al. The Set-Partitioning Problem: Set Covering with Equality Constraints , 1969, Oper. Res..
[26] J. P. Arabeyre,et al. The Airline Crew Scheduling Problem: A Survey , 1969 .
[27] G. Nemhauser,et al. Optimal Political Districting by Implicit Enumeration Techniques , 1970 .
[28] D. H. Marks,et al. An Analysis of Private and Public Sector Location Models , 1970 .
[29] Richard M. Karp,et al. The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..
[30] Charles S. ReVelle,et al. The Location of Emergency Service Facilities , 1971, Oper. Res..
[31] Richard M. Karp,et al. The traveling-salesman problem and minimum spanning trees: Part II , 1971, Math. Program..
[32] Kurt Spielberg,et al. Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems , 1971, Oper. Res..
[33] D. R. Fulkerson,et al. Blocking and anti-blocking pairs of polyhedra , 1971, Math. Program..
[34] M. Padberg. Essays in integer programming , 1971 .
[35] Michel Balinski,et al. Establishing the matching polytope , 1972 .
[36] László Lovász,et al. Normal hypergraphs and the perfect graph conjecture , 1972, Discret. Math..
[37] Egon Balas,et al. On the Set-Covering Problem , 1972, Oper. Res..
[38] G. Nemhauser,et al. Integer Programming , 2020 .
[39] J. Trotter. Solution characteristics and algorithms for the vertex packing problem. , 1973 .
[40] G. Owen. Cutting planes for programs with disjunctive constraints , 1973 .
[41] J. F. Pierce,et al. Improved Combinatorial Programming Algorithms for a Class of All-Zero-One Integer Programming Problems , 1973 .
[42] Harvey M. Salkin,et al. Set Covering by an All Integer Algorithm: Computational Experience , 1973, JACM.
[43] Egon Balas,et al. Finding a Minimum Node Cover in an Arbitrary Graph. , 1973 .
[44] M. Gondran. Un outil pour la programmation en nombres entiers : « La méthode des congruences décroissantes » , 1973 .
[45] D. R. Fulkerson. On the Perfect Graph Theorem , 1973 .
[46] Philip Wolfe,et al. Validation of subgradient optimization , 1974, Math. Program..
[47] Leslie E. Trotter,et al. Properties of vertex packing and independence system polyhedra , 1974, Math. Program..
[48] M. R. Rao,et al. The travelling salesman problem and a class of polyhedra of diameter two , 1974, Math. Program..
[49] G. Nemhauser,et al. Set Partitioning and Chain Decomposition , 1974 .
[50] Eitan Zemel. Lifting the Facets of 0-1 Polytopes. , 1974 .
[51] R. E. Marsten. An Algorithm for Large Set Partitioning Problems , 1974 .
[52] M. Padberg. Perfect Zero-One Matrices — II , 1974 .
[53] J. Laurière,et al. Un algorithme pour le problème de partitionnement , 1974 .
[54] Manfred W. Padberg,et al. Perfect zero–one matrices , 1974, Math. Program..
[55] E. Kay,et al. Graph Theory. An Algorithmic Approach , 1975 .
[56] E. Balas. DISJUNCTIVE PROGRAMMING: CUTTING PLANES FROM LOGICAL CONDITIONS , 1975 .
[57] Egon Balas,et al. Facets of the knapsack polytope , 1975, Math. Program..
[58] Problèmes de partitionnement : exploration arborescente ou méthode de troncatures ? , 1975 .
[59] Laurence A. Wolsey,et al. Technical Note - Facets and Strong Valid Inequalities for Integer Programs , 1976, Oper. Res..
[60] Peter L. Hammer,et al. The Role of Master Polytopes in the Unit Cube , 1977 .
[61] Egon Balas,et al. Some Valid Inequalities for the Set Partitioning Problem , 1977 .