This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Reference Notes
Aarts, E.H.L., Lenstra, J.K. (1997): Local Search in Combinatorial Optimization, John Wiley.
Ahuja, R.K., Magnanti, T.L., Orlin, J.B. (1993): Network Flows, Prentice Hall, Englewood Cliffs.
Bellman, R.E. (1958): Dynamic Programming, Princeton University Press.
Bland, R.G. (1977): New finite pivoting rules for the simplex method, Mathematics of Operations Research 2, 103–107.
Błażewicz, J., Lenstra, J.K., Rinnooy Kan, A.H.G. (1983): Scheduling subject to resource constraints: Classification and complexity, Discrete Applied Mathematics 5, 11–24.
Brucker, P., Knust, S.: Complexity classification of scheduling problems, http://www.mathematik.uni-osnabrueck.de/research/OR/class/.
Chvátal, V. (1983): Linear Programming, W.H. Freeman and Company, New York — San Francisco.
Cook, S.A. (1971): The complexity of theorem-proving procedures, Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, 151–158.
Dijkstra, E. (1959): A note on two problems in connexion with graphs, Numerische Mathematik 1, 269–271.
Floyd, R.W. (1962): Algorithm 97: Shortest path, Communications of the Association for Computing Machinery 5, 345.
Ford, L.R., Fulkerson, D.R. (1956): Maximal flow through a network, Canadian Journal of Mathematics 8, 399–404.
Garey, M., Johnson, D.S. (1979): Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman and Company, New York.
Gilmore, P.C., Gomory, R.E. (1961): A linear programming approach to the cutting-stock problem, Operations Research 9, 849–859.
Glover, F. (1989): Tabu Search, Part I, ORSA Journal of Computing 1, 190–206.
Glover, F. (1990): Tabu Search, Part II, ORSA Journal of Computing 2, 4–32.
Glover, F., Laguna, M. (1997): Tabu Search, Kluwer, Dordrecht.
Holland, S. (1975): Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, MI.
Khachian, L.G. (1979): A polynomial algorithm in linear programming, Soviet Math. Dokl. 20, 191–194.
Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P. (1983): Optimization by simulated annealing, Science 220, 671–680.
Klee, V., Minty, G.J. (1972): How good is the simplex algorithm? Inequalities III, Proc. 3rd Symp., Los Angeles 1969, 159–175.
Klein, M. (1967): A primal method for minimal cost flows with application to the assignment and transportation problems, Management Science 14, 205–220.
Korte, B., Vygen, J. (2002): Combinatorial optimization — Theory and algorithms, 2nd ed., Springer, Berlin.
Lawler, E.L. (1976): Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, New York.
Papadimitriou, C.H., Steiglitz, K. (1982): Combinatorial Optimization, Prentice Hall, Englewood Cliffs, N.J.
Pritsker, A., Watters, L., Wolfe, P. (1969): Multiproject scheduling with limited resources: A zero-one programming approach, Management Science 16, 93–107.
Schrijver, A. (2003): Combinatorial Optimization: Polyhedra and Efficiency, Springer, Berlin.
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2006). Algorithms and Complexity. In: Complex Scheduling. GOR ■ Publications. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-29546-1_2
Download citation
DOI: https://doi.org/10.1007/3-540-29546-1_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29545-7
Online ISBN: 978-3-540-29546-4
eBook Packages: Business and EconomicsBusiness and Management (R0)