Combinatorics in operations research
暂无分享,去创建一个
[1] D. R. Fulkerson,et al. MINIMIZING THE NUMBER OF CARRIERS TO MEET A FIXED SCHEDULE , 1954 .
[2] Shen Lin. Computer solutions of the traveling salesman problem , 1965 .
[3] George L. Nemhauser,et al. Scheduling to Minimize Interaction Cost , 1966, Oper. Res..
[4] Brian W. Kernighan,et al. An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..
[5] Richard M. Karp,et al. The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..
[6] Richard M. Karp,et al. The traveling-salesman problem and minimum spanning trees: Part II , 1971, Math. Program..
[7] Paul J. Schweitzer,et al. Problem Decomposition and Data Reorganization by a Clustering Technique , 1972, Oper. Res..
[8] Brian W. Kernighan,et al. An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..
[9] R. E. Beckwith,et al. Scheduling the 41st-ORSA-Meeting Sessions: The Visiting-Fireman Problem, II , 1973, Oper. Res..
[10] Jan Karel Lenstra,et al. Some Simple Applications of the Travelling Salesman Problem , 1975 .
[11] J. Lenstra,et al. Job-Shop Scheduling by Implicit Enumeration , 1977 .
[12] George L. Nemhauser,et al. Easy and hard bottleneck location problems , 1979, Discret. Appl. Math..
[13] Joseph Y.-T. Leung,et al. An Optimal Solution for the Channel-Assignment Problem , 1979, IEEE Transactions on Computers.
[14] Donald E. Knuth,et al. Breaking paragraphs into lines , 1981, Softw. Pract. Exp..
[15] Marshall L. Fisher,et al. A generalized assignment heuristic for vehicle routing , 1981, Networks.
[16] J. K. Lenstra,et al. Complexity of vehicle routing and scheduling problems , 1981, Networks.
[17] H. Peyton Young,et al. Fair Representation: Meeting the Ideal of One Man, One Vote , 1982 .
[18] J. M. Anthonisse,et al. Operational operations research at the Mathematical Centre , 1984 .
[19] Samuel J. Raff,et al. Routing and scheduling of vehicles and crews : The state of the art , 1983, Comput. Oper. Res..
[20] H. D. Ratliff,et al. Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem , 1983, Oper. Res..
[21] J. Anthonisse. Proportional representation in a regional council , 1984 .
[22] W. Lucas. Fair Representation: Meeting the Ideal of One Man, One Vote. By Michel L. Balinski and H. Peyton Young , 1985 .
[23] B. Moret,et al. On Minimizing a Set of Tests , 1985 .
[24] Gerhard Reinelt,et al. The linear ordering problem: algorithms and applications , 1985 .
[25] Michael Jünger,et al. Polyhedral combinatorics and the acyclic subdigraph problem , 1985 .
[26] M. Fisher,et al. A multiplier adjustment method for the generalized assignment problem , 1986 .
[27] M. Minoux. Solving integer minimum cost flows with separable convex cost objective polynomially , 1986 .
[28] N. Biggs. THE TRAVELING SALESMAN PROBLEM A Guided Tour of Combinatorial Optimization , 1986 .
[29] Esther M. Arkin,et al. Scheduling jobs with fixed start and end times , 1987, Discret. Appl. Math..
[30] Mwp Martin Savelsbergh,et al. VEHICLE ROUTING WITH TIME WINDOWS: OPTIMIZATION AND APPROXIMATION. VEHICLE ROUTING: METHOD AND STUDIES. STUDIES IN MANAGEMENT SCIENCE AND SYSTEMS - VOLUME 16 , 1987 .
[31] Matteo Fischetti,et al. The Fixed Job Schedule Problem with Spread-Time Constraints , 1987, Oper. Res..
[32] Mwp Martin Savelsbergh,et al. Behind the screen: DSS from an OR point of view , 1988, Decis. Support Syst..
[33] Egon Balas,et al. The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .
[34] Yoshiko Wakabayashi,et al. A cutting plane algorithm for a clustering problem , 1989, Math. Program..
[35] R. Bland,et al. Large travelling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation , 1989 .
[36] Michel Balinski,et al. An Axiomatic Approach to Proportionality Between Matrices , 1989, Math. Oper. Res..
[37] J. Carlier,et al. An algorithm for solving the job-shop problem , 1989 .
[38] Matteo Fischetti,et al. The Fixed Job Schedule Problem with Working-Time Constraints , 1989, Oper. Res..
[39] Eugene L. Lawler,et al. Sequencing and scheduling: algorithms and complexity , 1989 .
[40] M. Padberg,et al. Addendum: Optimization of a 532-city symmetric traveling salesman problem by branch and cut , 1990 .
[41] Martin Grötschel,et al. Solution of large-scale symmetric travelling salesman problems , 1991, Math. Program..
[42] Said Salhi,et al. Discrete Location Theory , 1991 .
[43] Jan Karel Lenstra,et al. Job Shop Scheduling by Simulated Annealing , 1992, Oper. Res..