COMBINATORIAL OPTIMIZATION

Some Main Problems

  • I. Some Basic Problem Groups/Families
    (including multi-objective/multicriteria problem formulations)
    1.1. Knapsack-like problems (knapsack problem, multiple choice problem, multidimensional knapsack problems, etc.)
    1.2. Shortest path problems
    1.3. Assignment/location/allocation problems (assignment problems, location problems, allocation problems, layout problems, stable marriage problem, multidimensional assignment problem, etc.)
    1.4. Scheduling problems (e.g, ordering, sequencing)
    1.5. Packing problems (bin-packing problem, etc.)
    1.6. Traveling salesman problem
    1.7. Orienteering problem (e.g., turism orienteering problem)
    1.8. Covering problems
    1.9. Routing/flow problems
    1.10. Independent set problem
    1.11. Clique-based problems (the maximum clique problem, weighted clique in multipartite graph, multipartite graph clustering, etc.)
    1.12. Clustering problems
    1.13. Spanning structure problems (spanning tree problems, minimal Steiner tree problems, maximum leafs spanning tree problem)
    1.14. Alignment problems
    1.15. Matching problems
    1.16. Stable marriage problems
    1.17. Substructure / superstructure problems (substring/superstring problems, agreement tree problems, consensus problems, design of median strcuture, etc.).
    1.18. SAT problems
    1.19. Graph coloring problems
    1.20. Design of "optimal" trees / hierarchies (design of "optimal" hierarchy, hotlink assignment, etc.)
    1.21. Graph augmentation problems
    1.22. Critical nodes in graphs/networks problems

  • II. Composite Problems/Issues
    2.1. Multicriteria/multiobjective basic problems
    2.2. Design of "optimal" hierarchy
    2.3. Morphological clique
    2.4. Timetabling problems (e.g., sport, education, medicine/hospitals)
    2.5. Network design problems
    2.6. Vehicle Routing Problems (VRPs) (including multi-vehicle routing problems)

  • III. Some Issues
    3.1. Reoptimization in combinatorial optimization
    3.2. Robustness in combinatorial optimization.
    3.3. Space-time accessability in networks
    3.4. Restructuring in combinatorial optimization

    Researchers

  • Alexander A. Ageev (Sobolev Inst. of Mathematics, Novosibirsk, Russia) (scheduling, approximation algorithms, location, coverage problems, independent set problem, etc.)
  • Ravindra K. Ahuja (Univ. of Florida) (general, approximation algorithms, large scale neighborhood search, etc.)
  • Noga Alon (Univ. of Tel Aviv) (general, random algorithms, etc.)
  • Igor Averbakh (Univ. of Toronto at Scarborough) (scheduling, routing, scheduling under precedence, location, median problem, stochastic problems, multidimensional knapsack, supply chain scheduling, approximation algorithms, online problems, etc.)
  • Egon Balas (CMU) (general, knapsack, etc.)
  • Michael O. Ball (Univ. of Maryland) (networking, transportation, logistics, etc.)
  • Philippe Baptiste (Ecole Polytechnique) (scheduling, constraint-based scheduling, dominance-based heuristics, air traffic management, etc.)
  • John J. Bartholdi, III (Georgia Tech.) (scheduling, TSP, assignment, manufacturing, spacefilling curves based algorithms, etc.)
  • Oded Berman (Univ. of Toronto) (general, global optimization, stochastic models, location problems, covering problems, knapsack problems, etc.)
  • Jacek Blazewicz (Poznan Univ. of Technology) (scheduling, bioinformatics, etc.)
  • Rainer E. Burkard (Graz Univ. of Technology) (general, TSP, assignment, etc.)
  • Edmund K. Burke (Univ. of Nottingham) (scheduling, timetabling, packing, meta-heuristics, hyper-heuristics, bioinformatics, etc.)
  • Eranda Dragoti Cela (Graz Univ. of Technology) (quadratic assignment problem)
  • E.G. Coffman, Jr. (Columbia University) (general, scheduling, assignment, etc.)
  • Mark S. Daskin (Univ. of Michigan) (facility location, transportation, supply chain management, etc.)
  • Vladimir G. Deineko (Univ. of Warwick, Warwick Business School) (TSP, etc.)
  • Zvi Drezner (Univ. of California, Fullerton) (facility location, etc.)
  • Moshe Dror (Univ. of Arizona) (routing, scheduling, assignment, approximation, multicriteria combinatorial optimization problems, etc.)
  • Dingzhu Du (general, etc.) (Univ. of Texas at Dallas)
  • Leah Epstein (Univ. of Haifa) (packing, bin-packing, online algorithms, etc.)
  • Matthias Erhgott (The Univ. of Auckland) (multicriteria combinatorial optimization, approximation algorithms, etc.)
  • Zvi Galil (Columbia Univ.) (general, parallel algorithms, dynamic graph algorithms, etc.)
  • Xavier Gandibleux (The Univ. of Nantes) (multicriteria combinatorial optimization, global optimization, evolutionary multiobjective optimization, approximation algorithms, application in transportation, communication, etc.)
  • Michel X. Goemans (MIT) (approximation algorithms, primal-dual algorithms, randomized algorithms, TSP, spanning trees, covering, general assignment problem, networking, scheduling, semidefinite programming, etc.)
  • Bruce L. Golden (Univ. of Maryland) (networking, transportation, supply chain networks, etc.)
  • Andrew V. Goldberg (general, assignment, experimental algorithms, etc.)
  • Carla P. Gomes (Cornell Univ.) (general, algorithm porfolio, approximation, randomization, etc.)
  • Gregory Z. Gutin (Univ. of London) (TSP, generalized TSP, multidimentional assignment, longest path problem, domination analysis, memetic algorithms, heuristics, etc.)
  • Refael Hassin (Tel Aviv Univ.) (approximation algorithms, shortest path, location, graph coloring, spanning trees, network synchronization problem, packing, scheduling, cut-problems, covering, etc.)
  • Karla L. Hoffman (George Mason Univ., School of Informaiton Technology and Engineering) (general, routing, aiction design, air-line scheduling, assignment, crew-scheduling, transportation and telecommunication applications, bandwidth-packing problem, military applications)
  • Andrzej Jaszkiewicz (Poznan Univ. of Tehcnology, Poland) (knapsack, multiple choice problem, TSP, multicriteria combinatorial optimization, metaheuristics, memetic algorithms, multiobjective evolutionary algorithms, etc.)
  • David S. Johnson (AT&T Labs, Inc. - Research) (general, etc.)
  • Richard M. Karp (Univ. of California at Berkeley) (general, etc.)
  • Kathrin Klamroth (Univ. of Wuppertal, Optimization and Approximation, Dept. C - Mathematics and Natural Sciences) (discrete optimization, multicriteria optimization, location theory, applications, etc.)
  • Jon Kleinberg (Cornell Univ.) (general, networking, etc.)
  • Yury Kochetov (Sobolev Inst. of Mathematics, Novosibirsk, Russia) (location, local search, neighborhood search, metaheuristics, etc.)
  • Bernhard Korte (Univ. of Bonn) (general, etc.)
  • Gilbert Laporte (HEC Montreal) (general, etc.)
  • Adam N. Letchford (Lancaster Univ.) (general, routing, multidimensional knapsack, TSP, combinatorial optimization games, graph layout problems, network design, plant location, etc.)
  • Asaf Levin (Technion) (packing, covering, approximation, etc.)
  • Nimrod Magiddo (Stanford Univ.) (general, network flows, matching problems, allocation, Steiner trees, network design, location problems, dominating set problem, replacement problems, etc.)
  • Silvano Martello (Univ. of Bologna) (knapsack, multiple choice problem, bin-packing, transportation, etc.)
  • Martin Middendorf (Univ. of Leipzig) (dynamic problems, parallel algorithms, swarm intelligence, scheduling, TSP, median problem, shortest common super sequence problem, reconfigurable problems, heuristics, etc.)
  • Rolf H. Mohring (Technical Univ. of Berlin) (general, scheduling, scheduling under precedence, etc.)
  • Clide L. Monma (USA) (scheduling, optimization in networking, graph theory, etc.)
  • George L. Nemhauser (Georgia Tech.) (general, transportation, logistics, etc.)
  • James B. Orlin (MIT) (network flows, airline scheduling, network design, telecommunicaitons, railroad scheduling, multicriteria combinatorial optimization problems, etc.)
  • Panos M. Pardalos (Center for Applied Optimization, Univ. of Florida) (general, global optimization, non-linear assignment problems, etc.)
  • Christos H. Papadimitriou (Univ. of California at Berkeley) (general, etc.)
  • Vangelis Th. Paschos (LAMSADE, Univ. Paris-Dauphine) (general, graph coloring,, Steiner problem, TSP, approximation algorithms, on-line algorithms, reoptimization, etc.)
  • Erwin Pesch (Univ. of Siegen) (general, scheduling, transportation, metaheuristics, etc.)
  • David Pisinger (Univ. of Copenhagen) (knapsack, multiple choice problem, etc.)
  • Chris N. Potts (Univ. of Southhampton) (scheduling, heuristics, variable neighborhood search, etc.)
  • Abraham P. Punnen (Simon Fraser Univ.) (domination analysis, large scale neighborhood search, assignment problems, TSP, spanning problems, etc.)
  • Fred S. Roberts (DIMACS) (general, application in social sciences, etc.)
  • Hershel M. Safer (Tel Aviv Univ.) (multicriteria combinatorial optimization, approximation algorithms, bioinformatics, etc.)
  • Sartaj K. Sahni (Univ. of Florida) (approximation algorithms, knapsack, scheduling, networking, application in VLSI design, etc.)
  • Alexander Schrijver (CWI, Amstredam, Netherlands) (general, etc.)
  • Ron Shamir (Tel Aviv Univ.) (general, transportation, graph algorithms, bioinformatics, etc.)
  • Hanif D. Sherali (Dept. of Ind. and Systems Eng., Virginia Tech) (all areas of optimization, algorithm design, wireless networks, network design, transportation, etc.)
  • Sergey V. Sevastianov (Sevastyanov) (Sobolev Inst. of Mathematics, Novosibirsk, Russia) (scheduling, approximation algorithms, covering problems, on-line algorithms, vertex coloring, etc.)
  • Maria Grazia Speranza (Dept. of Quantitative Methods, Univ. of Brescia, Italy) (general, scheduling, portfolio selection, TSP, on-line problems, heuristics, reoptimization, etc.)
  • Chelliah Sriskandarajah (Univ. of Texas at Dallas) (scheduling, assignment, cyclic scheduling, etc.)
  • Kenneth Steiglitz (Princeton Univ.) (general, etc.)
  • George Steiner (McMaster Univ.) (scheduling, knapsack, scheduling under precedence, etc.)
  • Vitaly Strusevich (Univ. of Greenwich, UK) (general, scheduling, knapsack, approximation algorihtms, supply chains, etc.)
  • Maxim Sviridenko (general, approximation algorithms, etc.) ( site at IBM Research ) ( site at Univ. of Warwick )
  • Arie Tamir (Tel Aviv Univ.) (location theory, large scale location problems, etc.)
  • Eva Tardos (Cornell Univ.) (general, approximation algorithms, networking, network design, routing, clustering, facility location, etc.)
  • Robert E. Tarjan (Princeton Univ.) (general, augmentation problem, network design, etc.)
  • Craig Tovey (Georgia Inst. of Technology) (assignment, replacement, scheduling, online algorithms, local search, approximation, computational complexity, heuristics, applications in robots, manufacturing, social sciences, politics, etc.)
  • Michael Trick (CMU, Tepper School of Business) (general, graph coloring, timetabling, combinatorial Benders approaches, etc.)
  • Vijay V. Vazirani (Georgia Tech.) (general, approximation algorithms, etc.)
  • Stefan Voss (Univ. of Hamburg) (Steiner tree problem, heuristics, management)
  • Jens Vygen (Univ. of Bonn) (general, etc.)
  • Frank Werner (Univ. of Magdeburg) (scheduling, heuristics, etc.)
  • Dominique de Werra (EPFL) (timetabling, graph coloring, etc.)
  • Gerhard J. Woeginger (Eindhiven Univ. of Technology) (scheduling, etc.)
  • Henry Wolkowicz (Univ. of Waterloo) (general, semidifenite programming, quadratic assignment problem, quadratic programming, etc.)
  • Laurence Wolsey (Catholic Univ. of Louvain) (general, etc.)
  • Uri Zwick (Tel Aviv Univ.) (approximation algorithms, dynamic algorithms, online algorihtms, parallel algorithms, routing, selecting the median algorithms, etc.)

    Research Groups, and Centers

  • Combinatorial Optimization Group, Eindhoven Univ. of Technology
  • Combinatorics Group at Oxford University
  • Centre for Discrete and Applicable Mathematics (London School of Economics)
  • CADCOM: Committee for the Advancement of Discrete and Combinatorial Mathematics
  • Automated Scheduling and Planning Group (Univ. of Nottingen)
  • Working Group on Automating Time Tabling (Europe)
  • Special Interest Group for Cutting and Planning
  • Steven S. Skiena (Dept. of CS, State Univ. of New York)
  • Martin Croetschel (Inst. for Mathematics, TU Berlin)
  • Center for Algorithm Engineering (Prof. Michael T. Goodrich, CS Dept., Johns Hopkins Univ.)
  • Algorithm Engineering Group (Dept. of Computer and System Sci., Univ. of Roma)
  • Andrew Goldberg's Network Optimization Library
  • Research Group on Algorithm Engineering (CS & Software Eng. Dept., Univ. of Canterbury)
  • Centre for Discrete Mathematics and Its Applications (DIMAP) (Dept. of CS & Warwick Mathematics Inst., Univ. of Warwick)
  • Concordia Computational Combinatorial Optimization Laboratory ConCoCO
    (Prof. Vasek Chvatal et al., CS and Software Engineering, Faculty of Engineering and CS, Concordia Univ., CA)
  • The Automated Scheduling, Optimisation and Planning (ASAP) research group, Edmund K. Burke (School of CS, Univ. of Nottingham)
  • Combinatorial Optimization & Graph Algorithms group COGA (Technical Univ. of Berlin)
  • Research group "Combinatorial Optimization, Algorithms, Data" (LAMSADE, Univ. Paris-Dauphine)
  • Center for Discrete Mathematics & Theoretical Computer Science (DIMACS) (New Jersey, USA)
  • Center for Advanced Modelling and Optimization (CAMO, Dr. Neculai Andrei)
  • LANCS INITIATIVE Foundational Operational Research: Building Theory for Practice (UK Universities: Lancaster Univ., Nottingham Univ., Cardiff Univ., Southhampton Univ.)

    Journals

  • Journal of Heuristcs
  • Journal of Combinatorial Optimization
  • Operations Research
  • Eur. Journal of Operational Research
  • Journal of the Operational Research Society
  • Mathematics of Operations Research
  • Computers and Operations Research
  • Algorithmica
  • SIAM J. on Discrete Mathematics
  • SIAM J. on Optimization
  • SIAM J. on Computing
  • Applied Discrete Mathematics
  • Discrete Mathematics
  • Orders
  • INFOR
  • Networks
  • Naval Research Logistics
  • Operations Research Letters
  • Information Research Letters
  • Journal of Global Optimization
  • Journal of Algorithms
  • Omega
  • Discrete Optimization
  • TOP
  • Information Processing Letters
  • Theoretical Computer Science
  • Algorithmic Operations Research
  • International Transactions in Operational Research
  • Journal of Scheduling
  • Constraints

    Bibliography

  • Basic Books
    1. R.K. Ahuja, T.L. Magnanti, J.B. Orlin, Network Flows, Theory, Algorithms, and Applications. Upper Saddle River, NJ, Prentice Hall, 1993.
    2. G. Ausiello et. al., Complexity and Approximation: Combinatorial Optimization Problems and Their Approximatibility Properties, Springer, 1999.
    3. J. Blazewicz, K.H. Ecker, G. Schmidt, and J. Weglarz, Scheduling in Computer and Manufacturing Systems, 2nd ed., Berlin: Springer-Verlag, 1994.
    4. R. Burkard, M. Dell'Amico, S. Martello, Assignment Problems, Providence: SIAM, 2009.
    5. R.W. Conway, W.L. Maxwell, and L.W. Miller, Theory of scheduling. Mass.: Addison-Wesley, Reading, 1967.
    6. W.J. Cook, W.H. Cunningham, W.R. Pulleyblank, A. Schrijver, Combinatorial Optimization. Wiley, 1997.
    7. Th. H. Cormen, C.E. Leiserson, R.L. Rivest, C. Stein, Introduction to Algorithms. The MIT Press, 2009.
    8. M.R. Garey, and D.S. Johnson, Computers and Intractability. The Guide to the Theory of NP-Completeness.
    San-Francisco: W.H. Freeman and Company, 1979.
    9. D. Gusfield, R.W. Irving, The Stable Marriage Problem: Structure and Algorithms, Boston: The MIT Press, 1989.
    10. F. Harary, R.Z. Norman, and D. Carthwright, Structural Models: An Introduction to the Theory of Directed Graphs. New York: J.Wiley & Sons, 1965.
    11. M. Hall, Jr., Combinatorial Theory, 2nd ed., New York: Wiley, 1986.
    12. E. Horowitz, S. Sahni, S. Rajasekaran, Computer Algorithms. Silicon Pr., 2 nd ed., 2007.
    13. T.R. Jensen, and B. Toft, Graph Coloring Problems. New York: J.Wiley & Sons, 1990.
    14. H. Kellerer, U. Pferschy, D. Pisinger, Knapsack Problems, Springer, Berlin, 2004.
    15. B. Korte, J. Vygen, Combinatorial Optimization: Theory and Algorithms. 5th ed., Springer, 2012.
    16. J. Lee, First Course in Combinatorial Optimization. Cambridge Univ. Press, New York, 2004.
    17. S. Martello, P. Toth, Knapsack Problem: Algorithms and Computer Implementation. New York: J.Wiley & Sons, 1990.
    18. E. Minieka, Optimization Algorithms for Networks and Graphs. New York: Marcel Dekker, 1978.
    19. G.L. Nemhauser, and L.A. Wolsey, Integer and Combinatorial Optimization. New York: J.Wiley & Sons, 1999.
    20. C.H. Papadimitriou, and K. Steiglitz, Combinatorial Optimization. Dover Publications, 1998.
    21. P. Pevzner, Computational Molecular Biology. MIT Press, 2000.
    22. E.M. Reingold, J. Nievergelt, and N. Deo, Combinatorial Algorithms. NJ: Prentice Hall, Englewood Cliffs, 1977.
    23. Fred S. Roberts, Discrete Mathematical Models with Applicaitons to Social, Biological, and Environmental Problems. Pearson, 1976.
    24. R.Y. Rubinstein, D.P. Kroese, The Cross Entropy Method: A Unified Approach to Combinatorial Optimization, Monte-Carlo Simulation and Machine Learning. Springer, 2004.
    25. Alexander Schrijver, Combinatorial Optimization (3 volumes). Springer. 2002.

  • Handbooks, Encyclopedia
    1. Saul Gass, Michael Fu (eds), Encyclopedia of Operations Research and Management Sciences. Kluwer, 2012.
    2. P.M. Pardalos, D.-Z. Du (Eds.), Handbook of Combinatorial Optimization. Kluwer, vols. 1,2, and 3, 1998, Supplement Volume A (1999), Supplement Volume B (2001).
    3. P.M. Pardalos, M. Resende (Eds.), Handbook of Applied Optimization. Oxford Univ. Press, 2002.
    4. P.M. Pardalos, E. Romaijn (Eds.), Handbook of Global Optimization. vols. 1 and 2, Kluwer, 2002.
    5. C. Zopounidis, P.M. Pardalos (Eds.), Handbook of Multicriteria Analysis. Springer, 2009.
    6. P.M. Pardalos, H.E. Romeijn (Eds.), Handbook of Optimization in Medicine. Springer, 2009.
    7. T. Thai, P.M. Pardalos (Eds.), Handbook of Optimization in Complex Networks: Theory and Applications. Springer, 2011.
    8. T. Thai, P.M. Pardalos (Eds.), Handbook of Optimization in Complex Networks: Communication and Social Networks. Springer, 2011.
    9. Alexey Sorokin, Steffen Rebennack, P.M. Pardalos, Niko Iliadis, Mario Pereira (Eds.), Handbook of Networks in Power Systems I. Springer, 2011.
    10. Alexey Sorokin, Steffen Rebennack, P.M. Pardalos, Niko Iliadis, Mario Pereira (Eds.), Handbook of Networks in Power Systems II. Springer, 2011.
    11. C.A. Floudas, P.M. Pardalos (Eds.), Encyclopedia of Optimization. Kluwer, vols. 1,2, 3, 4, 5, and 6, 2001.

  • Collective Monographs
    1. F. Aleskerov, B. Goldengorin, P.M. Pardalos (Eds.) Clusters, Orders, and Trees: Methods and Applications. Springer, 2014.
    2. J. Aoe (ed.), Computer Algorithms: String Pattern Matching Strategies. Los Alamitos: IEEE CS Press, 1994.
    3. E.G. Coffman, Jr. (ed.), Scheduling in Computer and Job Shop Systems, New York: J.Wiley & Sons, 1976.
    4. C. Demetrescu, A.V. Goldberg, D.S. Johnson, (eds.), Shortest Path: Ninth DIMACS Implementation Challenge. DIMACS Book, AMS, 2009.
    5. D.-Z. Du, P.M. Pardalos (Eds.), Network Optimization Problems: Algorithms, Complexity and Applications. World Scientific, 1993.
    6. D.-Z. Du, X. Hu, P.M. Pardalos, (Eds.), Combinatorial Optimization and Applications. LNCS 5573, Springer, 2009.
    7. A. Ferreira, P.M. Pardalos, (Eds.), Solving Combinatorial Optimization Problems in Parallel: Methods and Techniques. LNCS 1054, Springer, 1996.
    8. C.A. Floudas, P.M. Pardalos, (Eds.), State of the Art in Global Optimization: Computational Methods and Applications. Boston, Kluwer Academic Publishers, 1996.
    9. C. Floudas, P.M. Pardalos, (Eds.), Optimization in Computational Chemistry and Molecular Biology. Kluwer, 2000.
    10. Yu. Gang, (Ed.) Industrial Applications of Combinatorial Optimization. Dordrecht: Kluwer, Hardbound, ISBN 0-7923-5073-1, June 1998
    11. G. Gutin, A.P. Punnen (Eds), The Traveling Salesman Problem and Its Variations. Springer, 2002.
    12. D.S. Johnson, and M.A. Trick, (Eds.), Cliques, Coloring, and Satisfiability. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 26, Providence: AMS, 1996.
    13. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys, (eds.), The Traveling Salesman Problem. Chichester: J.Wiley & Sons, 1985.
    14. P.B. Mirchandani, and R.L. Francis, (Eds.) Discrete Location Theory, New York: J.Wiley & Sons, 1990.
    15. P. Pardalos, H. Wolkowicz, (Eds.), Quadratic Assignment and Related Problems, AMS, Providence, 1994
    16. P.M. Pardalos, D. Hearn, W. Hager, (Eds.), Network Optimization. Lecture Notes in Economics and Mathematical Systems, vol. 450, Springer, 1997.
    17. P.M. Pardalos, D.-Z. Du (Eds.), Network Design: Connectivity and Facilities Allocation. DIMACS Series vol. 40, AMS, 1998.
    18. P.M. Pardalos, L. Pitsoulis (Eds.), Nonlinear Assignment Problems, Boston, Kluwer Academic Publishers, 2000.
    19. P.M. Pardalos, F. Hsu, S. Rajasekaran (Eds.), Mobile Networks and Computing. DIMACS Series vol. 52, AMS, 2000.
    20. P.M. Pardalos, A. Migdalas, R. Burkard (Eds.). Combinatorial and Global Optimization. World Scientific, 2002.
    21. P.M. Pardalos, S. Rebennack (Eds.), Experimental Algorithms. LNCS 6630, Springer, 2011.
    22. El-Ghazali Talbi (Ed.), Parallel Combinatorial Optimization, Wiley, 2006.
    23. D.J.A. Welsh (Ed.) Combinatorial Mathematics and Its Applications. New York: Academic Press, 1971
    24. Youssef Hamadi, Eric Monfroy (Eds.), Autonomous Search. Springer, 2012.
    25. Sivano Martello, Gilbert Laporte, Michel Minoux, Celso Ribeiro (eds), Surveys on Combinatorial Optimization, Elsevier, vol. 132, 1987.

  • Books
    1. D.L. Applegate, R.E. Bixby, V. Chvatal, W.J. Cook, The Traveling Salesman Problem: A Computational Study. Princeton Univ. Press, 2007.
    2. E.H.L. Arts and J.K. Lenstra, Local Search in Combinatorial Optimization. New York, J.Wiley & Sons, 1997.
    3. K. Baker, D. Trietsch, Principles of Sequencing and Scheduling. New York: J.Wiley and Sons, 2009.
    4. A.I. Barros, Discrete and Fractional Programming Techniques for Location Models. Dordrecht: Kluwer, 1998.
    5. Arthur T. Benjamin, Discrete Mathematics, The Teaching Company, Chantilly, VA, 2009.
    6. J. Blazewicz, K.H. Ecker, E. Pesch, G. Schmidt, J. Weglarz, Handbook on scheduling: from theory to application. Springer, 2007.
    7. P. Brucker, Scheduling Algorithms. 4th ed., Springer, 2004.
    8. J. Blazewicz, W. Cellary, R. Slowinski, and J. Weglarz, Scheduling under Resource Constraints: Deterministic Models. Basel: Baltzer, 1986.
    9. S. Bandyopadhyay, S. Saha, Unsupervised Classification: Similarity Measures, Classical and Metaheuristic Approaches. Springer, 2013.
    10. E. Cela, The Quadratic Assignment Problem: Theory and Algorithms. Dordrecht: Kluwer, 1997.
    11. M. Crochemore, W. Rytter, Jewels of Stringology. World Scientific, 2002.
    12. M.S. Daskin, Networks and Discrete Location. Models, Algorithms, and Applications. New York: J.Wiley & Sons, 1976.
    13. M. Dror, Arc Routing. Theory, Solutions and Applications. Boston, Kluwer, 2000.
    14. M. Ehrgott, Multicriteria Optimization. Springer, Berlin, 2005.
    15. S. French, Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop. New York: J.Wiley and Sons, 1982.
    16. Youssef Hamadi, Combinatorial Search: From Algorithms to Systems. Springer, 2013.
    17. F. Glover and M. Laguna, Tabu Search, Kluwer Academic Publishers, Boston, 1997.
    18. B.I. Goldengorin, Requiremments of Standards: Optimization Models and Algorithms. Hoogezand, The Netherlands: Operations Research Co., 1995.
    19. B.I. Goldengorin, P.M. Pardalos, Data Correcting Approaches in Combinatorial Optimization. Springer, 2012.
    20. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs. New York: Academic Press, 1980.
    21. M. Grotschel, L. Lovasz, A. Schrijver, Geometric Algorithms and Combinatorial Optimization. Springer, 1993.
    22. J. Kleinberg, E. Tardos, Algorithm Design. Addison-Wesley, 2005.
    23. P. Kouvelis, G. Yu, Robust Discrete Optimization and Its Applications. Kluwer, 1997.
    24. D. Manlove, Algorithms of Matching Under Preferences. World Scientific, 2013.
    25. G. Reinelt, The Traveling Salesman, Berlin: Springer-Verlag, 1994
    26. F. Rothlauf, Design of Modern Heuristics: Principles and Application. Springer, 2011.
    27. G. Valiente, Algorithms on Trees and Graphs. Springer, Berlin, 2002.

  • Bibliography Surveys
    1. Matthias Ehrgott, A survey and annotated bibliography of multiobjective combinatorial optimization. OR Spectrum, 22(4), 425-460, 2000.
    2. Gilbert Laporte, Ibrahim H. Osman, Routing problems: A bibliography. Annals of Operations Research, 61(1), 227-262, 1995.
    3. Ibrahim H. Osman, Gilbert Laporte, Metaheuristics: A bibliography. Annals of Operations Research, 63(5), 513-623, 1996.
    4. D. Steenken, S. Voss, R. Stahlbock, Container terminal operations and operations research - a classification and literature review. OR Spectrum, 26, 3-49, 2004.

  • Surveys
    1. G. Ausiello, V.Th. Paschos, Reductions, completeness and the hardness of approximability. EJOR, 172, 719-739, 2006.
    2. E. Balas, M. Padberg, Set partitioniong: survey. SIAM Rev., 18(4), 710-760, 1976.
    3. J. Blazewicz, W. Domaschke, E. Pesch, The job shop scheduling problems: Conventional and new solution techniques. EJOR, 93(1), 1-11, 1996.
    4. P. Brucker, R. Qu, E.K. Burke, Personnel scheduling: Models and complexity. EJOR, 210(3), 467-473, 2011.
    5. E.K. Burke, S. Jackson, H. Kingston, F. Weare, Automated timetabling: The state of the art. The Computer Journal, 40(9), 565-571, 1997.
    6. G. Cattaneo, G. Italiano, Algorithm Engineering. ACM Computing Surveys, 31(3es), Article No. 3, Sept. 1999.
    7. Matthias Ehrgott, Xavier Gandibleux, Approximate solution methods for multiobjective combinatorial optimization. TOP, 12(1), 1-89, 2004.
    8. A.T. Ernst, H. Jiang, M. Krishnamoorthy, D. Sier, Staff scheduling and rostering: A review of applications, methods and models. EJOR, 153, 3-27, 2004.
    9. B. Escoffier, V.Th. Paschos, A survey on the structure of approximation classes. Computer Science Review, 4(1), 19-40, 2010.
    10. C. Fleurent, J.A. Ferland, Genetic and hybrid algorithms for graph coloring. Annals of Operations Research, 63(3), 437-461, 1996.
    11. P. Galinier, A. Hertz, A survey of local search methods for graph coloring. Comput. and Oper. Res., 33(9), 2547-2562, 2006.
    12. R.L. Graham, E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, Optimization and approximation in deterministic scheduling and sequencing: A survey. Annals of Discrete Mathematics, 5, 287-326, 1979.
    13. Karla L. Hoffman, Combinatorial optimizaiton: Current successes and direcitons for the future. J. of Computaitonal and Applied Mathematics 124(1-2), 341--360, 2000.
    14. A.K. Jain, M.N. Murty, P.J. Flynn, Data clustering: a review, ACM Computing Surveys, 1999, vol 31, no. 3, pp. 264-323.
    15. L. Jourdan, M. Basseur, E.G. Talbi, Hybridizing exact methods and metaheuristics: A taxonomy. EJOR, 199(3), 620-629, 2009.
    16. P.A. Krokhmal, P.M. Pardalos, Random assignment problems. EJOR, 194(1), 1-17, 2009.
    17. R. Lewis, A survey of metaheuristics-based techniques for university timetabling. OR Spectrum, 30(1), 167-190, 2008.
    18. E.M. Loiola, N.M.M. de Abrea, P.O. Boaventura-Netto, P. Hahn, T. Querido, A survey on the quadratic assignment problem. EJOR, 176(2), 657-690, 2007.
    19. T.L. Magnanti, L.A. Wolsey, Optimal trees. In: M.O. Ball et al. (Eds.), Handbooks on OR & MS, North-Holland, Amsterdam, vol. 7, 503-615, 1995.
    20. B. Mirkin, I. Muchnik, Combinatorial Optimization in Clustering, in D.-Z. Du, P. Pardalos (Eds.), Handbook of Combinatorial Optimization. Vol. 2, Bostron, Kluwer Academic Publishers, 261-329, 1998.
    21. V.Th. Paschos, A survey of approximately optimal solutions to some covering and packing problems. ACM Computing Surv., 29(2), 171-209, 1999.
    22. M.M.B. Pascoal, M.E. Captivo, J.C.N. Climaco, A comprehensive survey on the quickest path problem. Ann. of Oper. Res., 147(1), 5-21, 2006.
    23. R. Qu, E.K. Burke, M. McCollum, L.T.G. Merlot, S.Y. Lee, A survey of search methodologies and automated approaches for examination timetabling. J. of Scheduling, 12(1), 55-89, 2009.
    24. A. Schaerf, A survey of automated timetabling. Artificial Intelligence Review. 13(2), 87-127, 1999.
    25. Hanif D. Sherali, Patrick J. Driscoll, Evolution and state-of-the-art in integer programming. J. of Computational and Applied Mathematics 124(1-2), 319--340, 2000.
    26. Z. Tarapata, On a multicriteria shortest path problem, Int. J. Appl. Math. Comput. Sci., 17(2), 269-287, 2007.
    27. V.G. Timkovsky, Complexity of common subsequence and supersequence problems. Cybernetics and Systems Analysis, 25(5), 565-580, 1989.
    28. G.J. Woeginger, Exact algorithms for NP-hard problems: A survey. In: Combinatorial Optimization - Eureka, You Shrink! LNCS 2570, Springer, 185-207, 2003.
    29. E. Zitzler, L. Thiele, Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Trans. on Evolutionary Computation, 3(4), 257-271, 1999.

  • Some basic papers
    1. M. Ball and M. Magazine, The design and analysis of heuristics. Networks, 11(2), 215-219, 1981.
    2. D. Bertsimas, G. Lulli, A. Odoni, An integer optimization approach to large-scale air traffic flow management. Operations Research, 59, 211-227.
    3. R.B. Borie, Generation of Polynomial-Time Algorithms for Some Optimization Problems on Tree-Decomposable Graphs. Algorithmica, 14(2), 123-137, 1995.
    4. E.W. Dijkstra, A note on two problems in connection with graphs. Numer. Math., 1, 269-271, 1959.
    5. K.P. Eswaran, R.E. Tarjan, Augmentation problems. SIAM J. on Computing, 5(4) 653-665, 1976.
    6. D. Gale, L.S. Shapley, College admissions and the stabiloty of marriage. American Math. Monthly, vol. 69, 9-15, 1962.
    7. S.M. Johnson, Optimal Two-and-Three-Stage Production Schedules. Naval Res. Logist. Quart., 1(1), 61-68, 1954.
    8. R.M. Karp. Reducibility among combinatorial problems. In: Complexity of Computer Computations, 85-103, Plenum Press, 1972.
    9. R.M. Karp, Combinatorics, Complexity, and Randomness. Comm. of the ACM, 29(2), 98-109, 1986.
    10. D. Knuth, A. Ratghunathan, The problem of compatible representatives. SIAM J. on Discr. Math., 5(3), 422-427, 1992.
    11. H.W. Kuhn. The Hungarian method for the assignment problems. Nav. Res. Log., 2(1-2), 83-97, 1955 (reprinted in Nav. Res. Log., 52(1), 7-21, 2005)
    12. S. Lin and B.W. Karnighan, An effective heuristic algorithm for the traveling salesman problem. Operations Research, 21, 498-516, 1973.
    13. S. Lin, Computer solutions to the traveling salesman problem. Bell System Tech. J., 44, 2245-2269, 1965.
    14. G.L. Nemhauser, M.A. Ball, Scheduling a major college basketbal conference. Oper. Res., 46(1), 1-8, 1998.
    15. P.A. Pevzner, Multiple alignment, communication costs, and graph matching. SIAM J. on Applied Mathematics, 52(6), 1763-1779, 1992.
    16. D. de Werra, An introduction to timetabling. EJOR, 19(2), 151-162, 1985.

  • Papers
    1. N. Alon, B. Awerbuch, Y. Azar, N. Buchbinder, J. Naor, A general approach to online network optimization problems. ACM Trans. on Algorithms 2(4), 640-660, 2006.
    2. B. Awerbuch, Y. Azar, Y. Bartal, On-line generalized Steiner problem. Theoretical Comput. Sci. 324(2-3), 313-324, 2004.
    3. A. Blum, New approximation algorithms for graph coloring. J. of the ACM 41(3), 470-516, 1994.
    4. M. Charicar, C. Chekuri, T.-Y. Cheung, Z. Dai, A. Goel, S. Guha, M. Li, Approximation algorithms for directed Steiner problems. J. of Algorithms 33(1), 73-91, 1999.
    5. I. Charon, O. Hundry, Optimal clustering of multipartite graphs. Discr. Appl. Math. 156(8), 1330-1347, 2008.
    6. M. Dror, M. Haouari, J. Chauoachi, Generalized spanning trees. EJOR 120(3), 583-592, 2000.
    7. I.S. Duff, On algorithms for obtaining a maximal transversal. ACM Trans. on Math. Software 7(3), 315-330, 1981.
    8. T. Eiter, G. Gottlib, Identifying the minimal transversals of hypergraph and related problems. SIAM J. on Computing 24(6), 1278-1304, 1995.
    9. S. Even, A. Itai, A. Shamir, On the complexity of timetable and multicommodity flow problems. SIAM J. on Comput. 5(4), 691-703, 1976.
    10. S. Even, G. Kortsarz, W. Slany, On network design problems: Fixed cost flows and the covering Steiner problem. ACM Trans. on Algorithms 1(1), 74-101, 2005.
    11. H.N. Gabov, Z. Galil, T. Spencer, R.E. Tarjan, Efficient algorithms for finding minimum spanning trees in undirected and directed graphs. Combinatorica 6(2), 109-122, 1986.
    12. H.W. Hamaher, G. Ruhe, On spanning tree problem with multiple objectives. Ann. of Oper. Res. 52(4), 209-230, 1995.
    13. M. Imase, B.M. Waxman, Dynamic Steiner tree problem. SIAM J. on Discr. Math. 4(3), 369-384, 1991.
    14. D.S. Johnson, M. Yannakakis, C.H. Papadimitriou, In generating all maximal independent sets. Infor. Process. Lett. 27(3), 119-123, 1988.
    15. D. Karger, R. Motwani, M. Sudan, Approximate graph coloring by semidefinitive programming. J. of the ACM 45(2), 246-265, 1998.
    16. E.Q. Martins, On a multicriteria shortest path problem. EJOR 16(2), 236-245, 1984.
    17. S. Mittal, B. Falkenhainer, Dynamic constraint satisfaction problem. Proc. of the 8th Nat. Conf. on AI, 25-32, 1990.
    18. C. Murat, V.Th. Pachos, On the probabilistic minimum coloring and minimum k-coloring. Discr. Appl. Math. 154(3), 564-586, 2006.
    19. V.Th. Pachos, Polynomial approximation and graph coloring. Computing 70(1), 41-86, 2003.
    20. A. Scarelli, S.C. Narula, A multicriteria assignment problem. J. of Multi-Criteria Dec. Anal. 11(2), 65-74, 2002.
    21. A. Segev, The node-weighted Steiner tree problem. Networks 17(1), 1-17, 1987.
    22. S. Voss, Steiner's problem in graphs: Heuristic methods. Discr. Appl. Math. 40(1), 45-72, 1992.
    23. S. Voss, The Steiner tree problem with hop constraints. Ann. of Oper. Res. 86, 321-345, 1999.
    24. D. Adolphson and T.C. Hu, Optimal linear ordering. SIAM J. Apl. Math. 25(3), 403-423, 1973.
    25. D. Adolphson, Single Machine Sequencing with Precedence Constraints. SIAM J. Comput. 6, 40-56, 1977.
    26. M. Habib and R. Jegou, N-free posets as generalizations of series-parallel posets. Annals Discrete Math. 23, 331-386, 1985.
    27. W.A. Horn, Single-machine job sequencing with treelike precedence ordering and linear delay penalties. SIAM J. Appl. Math. 23(2), 189-202, 1972.
    28. E.L. Lawler, Sequencing jobs to minimize total weighted completion time subject to precedence constraints. Ann. Discrete Math. 2, 75-86, 1978.
    29. M.Sh. Levin, Effective solution of certain problems of theory of scheduling of nets.
    Cybernetics (now: Cybernetics and Systems Analysis) 16(1), pp. 148-154, 1980.
    30. C.L. Monma, Two-machine flow-shop problem with series-parallel precedence relations. Operations Research 27, 792-798, 1979.
    31. C.L. Monma, J.B. Sidney, Sequencing with series-parallel precedence constraints. Math. Oper. Res. 4, 215-224, 1979.
    32. W.E. Smith, Various Optimizers for Single-Stage Production. Naval Research Logistic Quarterly 3(1), 59-66, 1956.
    33. F. Werner, On the heuristic solution of the permutation flow shop problem by path algorithms. Computers and Operations Research 20(7), 707-722, 1993.
    34. L. Puquete, T. Stutzle, On local optima in multiobjective optimization. Annals of Oper. Res. 156(1), 83-97, 2007.
    35. T.B. Boffey, Multiobjective routing problems. TOP 3(2), 167-220, 1996.
    36. M.Sh. Levin, Towards four-layer framework of combinatorial problems. 32rd Annual IEEE Int. Conf. COMPSAC 2008, IEEE Computer Society Press,
    pp. 873-878, 2008.
    37. M.Sh. Levin, Four-layer framework for combinatorial optimization problems domain. Advances in Engineering Software 42(12), 1089-1098, 2011
    (journal site)
    38. L. Yelowitz, An efficient algorithm for constructing hierarchical graphs. IEEE Trans. SMC 6, 327-329, Apr. 1976.
    39. C. Archetti, L. Bertazzi, M.G. Speranza, Reoptimizing the traveling salesman problem. Networks 42(3), 154-159, 2003.
    40. P. Calegari, F. Guedec, P. Kuonen, F. Nielsen, Combinatorial optimization algorithms for radio network planning. Theoretical Computer Science 263, 235-245, 2001.
    41. Klaus Jansen, An approximation scheme for bin packing with conflicts. J. of Combin. Optim. 3(4), 363--377, 1999.

  • Technical Reports/Preprints
    1. T. Lust, J. Teghem, The multiobjective multidimensional knapsack problem: a survey and a new approach. Techn. Rep., arXiv: 1007.4063v1, 2010. http: //arxiv.org/abs/1007.4063.v1
    pdf-file
    2. Hershel M. Safer, James B. Orlin, Fast Approximation Schemes for Multi-Criteria Flow, Knapsack, and Scheduling Problems. Working Paper WP # 37855-95, Operations Research Center, MIT, 1995a.
    3. Hershel M. Safer, James B. Orlin, Fast Approximation Schemes for Multi-Criteria Combinatorial Optimization. Working Paper WP # 37856-95, Operations Research Center, MIT, 1995b.
    4. Hershel M. Safer, James B. Orlin, Moshe Dror, Fully Polynomial Approximation in Multi-Criteria Combinatorial Optimization. Working Paper WP8, MIT, 53 pp., 2004.
    5. E. Girlich, V. Kotov, M. Kovalev, Semi on-line algorithm for multiprocessors scheduling problem with given total processing time. TR 98-05, The Math. Dept., Univ. of Magdeburg, 1998.
    6. P. Jaillet, Probabilistic traveling salesman problem. PhD Thesis, Technical Report No. 185, Operations Research Center, MIT, Cambridge, MA, 1985.
    7. M.Sh. Levin, Towards Combinatorial Clustering: Preliminary Research Survey. Electronic preprint. 102 p., May 28, 2015.
    http://arxiv.org/abs/1505.07872 [cs.AI]
    8. M.Sh. Levin, Discrete Route/Trajectory Decision Making Problems. Electronic preprint. 25 p., Aug. 16, 2015.
    http://arxiv.org/abs/1508.03863 [cs.AI]
    9. Chien-Chung Huang, How Hard is it to Cheat in the Gale-Shapley Stable Marriage Algorithm? Technical Report TR2005-565, Dept. of CS, Darthmouth College, 2005.
    10. Hanif D. Sherali, Patrick J. Driscoll, A bibliography for the evolution and state-of-the-art in integer programming. Technical Report # 99-004, Dept. of Math. Sciences, U.S. Military Academy, West Point, NY, 1999.

  • PhD Theses
    1. T. Jordan, Connectivity Augmentation Problems in Graphs. PhD Thesis, 1995.
    2. David Pisinger Algorithms for Knapsack Problems. PhD Thesis, Dept. of CS, Univ. of Copenhagen, Feb. 1995.
    3. E. Zitzler, Evolutionary Algorithms for Multiobjective Optimization: Methods and Applications. PhD Thesis, Swiss Federal Inst. of Technology (ETH) Zurich, Switzerland, 1999.
    4. Benjamin Colin Cosh, Vertex Splitting and Connectivity Augmentation in Hypergraphs. PhD Thesis, Goldsmiths' College, Univ. of London, 2000.
    5. Anders J.V. Skriver, Multicriteria Analysis on Network and Location Problems. PhD Thesis, Dept. of Operations Research, Univ. of Aarhus, 2001.
    6. S. Ruzika, On multiple objective combinatorial optimization. PhD thesis, Technische Universitat Kaiserslautern, 2008.
    7. J. Gorski, Multiple objective optimization and implifications for single objective optimization. PhD thesis, Bergische Universitat Wuppertal, Shaker Verlag, 2010.
    8. S.C. Hiremath, New heuristic and metaheuristic approaches applied to the multiple-choice multidimensional knapsack problem. PhD thesis, Wright State. Univ., USA, 2008.
    9. D. Kumlander, Some Practical Algorithms to Solve The Maximum Clique Problem. PhD Thesis, Tallin Univ. of Techn, 2005.
    10. Matthew Streeter, Using Online Algorithms to Solve NP-Hard Problems More Efficiently in Practice. PhD Thesis, School fo CS, CMU, CMU-CS-07-172, Dec. 2007.
    11. S. Zilberstein, Operational Rationality Through Compilation of Anytime Algorithms. PhD Dissertation, Univ. of California, Berkley, 1993.
    12. Alexander Tiskin, The Design and Analysis of Bulk-Synchronous Parallel Algorithms. DPhil Thesis, Univ. of Oxford, 1999.
    13. A.P.A. Vertjens, On-Line Machine Scheduling. PhD thesis, Eindhoven Univ. of Technology, The Netherlands, 1997.
    14. A. Agustin, Mathematical optimization in Air Traffic Flow Management under uncertainty. PhD thesis dissertation, Statistics and Operations Research Dept., Universidad Rey Juan Carlos, Mostoles (Madrid), Spain, 2011.
    15. Martin M. Vergas, Enhancing Hyperlink Structure for Improving Web Performance. PhD thesis, School of CS, Carleton Univ., 2002.
    16. R. Ravi, Steiner trees and beyond: Approximation algorithms for network design. PhD Dissertation, Brown Univ., 1993
    17. M. Stoer, Design of survivable networks. PhD thesis, Univ. of Augsburg, Lecture Notes in Mathematics, Springer, Heidelberg, Vol. 1531, 1992.
    18. S.I. Butenko, Maximum independent set and related problems with applications. PhD Thesis, Univ. of Florida, 2003.
    19. Daniil Karapetyan, Design, Evaluation and Analysis of Combinatorial Optimization Heuristic Algorithms. PhD Thesis, Dept. of Computer Science, Royal Holloway College, Univ. of London, 2010.
    20. Ch.E. Noon, The Generalized Traveling Salesman Problem. PhD Thesis, Univ. of Michigan, 1988.
    21. P. Jaillet, Probabilistic traveling salesman problem. PhD thesis, Technical Report No. 185, Operations Research Center, MIT, Cambridge, MA, 1985.
    22. I. Or, Traveling salesman-type combinatorial problems and their relation to the logistics of blood banking. PhD thesis, Dept. of Industrial Engineering and Management Science, Northwestern Univ., Evanston, IL, 1976.
    23. N. Secomandi, Exact and heuristic dynamic programming algorithms for the vehicle routing problem with stochastic demands. PhD dissertation, Faculty of the College of Business Administration, Univ. of Houston, TX, 1999.
    24. A. Van Breedam, An analysis of the behavior of heuristics for the vehicle routing problem for a selection of problems with vehicle-related, customer-related, and time-related constraints. PhD dissertation, Univ. of Antwerp, Belgium, 1994.
    25. L. Kopman, A New Genetic Separation Routine and Its Application in a Branch and Cut Algorithm for the Vehicle Routing Problem. PhD Dissertation, Field of OR, Cornell Univ., Ithaca, NY, 1999.
    26. L. Ladanyi, Parallel Branch and Cut and Its Application to the Trabeling Salessman Problem. PhD Dissertation, Field of OR, Cornell Univ., Ithaca, NY, 1996.
    27. T.K. Ralphs, Parallel Branch and Cut for Vehicle Routing. PhD Dissertation, Field of OR, Cornell Univ., Ithaca, NY, 1995.
    28. R.R. Mettu, Approximation algorithms for NP-hard clustering problems. PhD Thesis, Dept. of CS, Univ. of Texas at Austin, Aug. 2002.
    29. P. Bajcsy, Hierarchical segmentation and clustering using similarity analysis. PhD Dissertation, Dept. of CS, Univ. of Illinois at Urbana-Champaign, 1997.
    30. H. Moser, Finding optimal solutions for covering and matching problems. PhD thesis, Inst. for Informatics, Friedrich-Schiller Univ. at Jena, 2009.
    31. S. Trukhanov, Novel approaches for solving large-scale optimization problems on graphs. PhD thesis, A&M Universtity, Texas, 2008.
    32. D. Adjiashvili, Structural Robustness in Combinatorial Optimization, PhD Thesis, ETH Zurich, 2012.
    33. H. Yanagisawa, Approximation Algorithms for Stable Marriage Problems. PhD Thesis, Kyoto Univ., 2007.
    34. Albert Einstein Fernandes Mutitiba, Algorithms and Models for Combinatorial Optimization Problems. PhD Thesis, Bologna Univ., 2010.
    (Generalized TSP, Bin Packing Problem with Conflics, Fair Layout Problem)

  • MS Theses
    1. B.C. Dean, Continuous-time dynamic shortest path algorithms. MS thesis, MIT, 1999.
    2. L. Blander-Reinhard, Multi-objective shortest path for cargo transportation. MS thesis, Unic. of copenhagen, DIKU, Denmark, April 2005.
    3. Gilad Liberman, Connectivity Augmentation Problems. MS Thesis, Computer Science Division, The Open Univ. of Israel, 2005.
    4. J. Uhlmann, Parameterized Algorithms for Connectivity Augmentation Problems in Networks. Diploma thesis, WSI fur Informatik, Univ. Tubingen, Germany, 2007.
    5. Bernd Thomas Zey, Algorithms for Planar Graph Augmentation. Dimplomarbait (Diplom Work), Faculty of Informatics, Technical Univ. of Dortmund, Germany, 2008.
    6. A. Singireddy, Solving the longest common subsequence problem in bioinformatics. Master's thesis, Industrial and Manufacturing Systems Engineering, Kansas State Univ., Manhattan, KS, 2003.
    7. Jeffrey Allen Sharkley, Automated Radion Network Design Using Ant Colony Optimization. MS-thesis, Montana State Univ., Apr. 2008.
    8. M. Petrik, Learning Parallel Portfolios of Algorithms. MS thesis, Comenius Univ., Bratislava, Slovakia, 2005.
    9. C.H. Papadimitriou, The Complexity of Combinatorial Optimization Problems. MS-thesis, Princeton Univ., 1976.
    10. M. Landberg, Approximation Algorithms for Maximization Problems arising in Graph Partitioning. MS thesis, Weizmann Inst. of Science, 1998.
    11. Donald Arthur Parish, A Genetic Algorithm Approach to Automatic Satellite Range Scheduling. MS thesis, Graduate School of Engineering, Air Force Institute of Technology, USA, March 1994.
    12. Jesper Nederlof, Inclusion exclusion for hard problems. MS thesis, Utrecht University, August 2008.
    13. A. Jezequel, Probabilistic vehicle routing problems. MS dissertation, Dept. of Civil Eng., MIT, Cambridge, MA, 1985.
    14. J.A.G. Willard, Vehicle routing using r-optimal tabu search. MSc dissertation, The Management School, Imperial College, London, UK, 1989.

    Information Resources

  • Genetic Algorithm Archive
  • Packing Bibliography
  • ALgorithms and COMplexity in Information Technology EU ESPRIT Project
  • QAPLIB - A Quadratic Assignment Problem Library (R.E. Burkard, E. Cela, S.E. Karish, & F. Rendl)
  • Dictionary of Algorithms and Data Structures (Paul E. Black)
  • Operations Research Models and Methods INTERNET (by Paul O. Jensen)
  • Classification and Clustering: Boris G. Mirkin (Birkbeck College)
  • Andrew Goldberg's Network Optimization Library
  • Michael Trick's Operations Research Page

    Polyhedra

  • George W. Hart's Virtual Reality Polyhedra page
  • Approximation Algorithms (Uri Zwick, Tel Aviv Univ., Israel)
  • Electronic Colloquium on Computational Complexity - Research reports, surveys and books in computational complexity (Univ. of Trier, Germany)