Dialectic search

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5732 LNCS, Issue , 2009, Pages 486-500

  Kadioglu, Serdar ^a   Sellmann, Meinolf ^a  

^a Brown Univerity   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENTISTS; CONSTRAINT SATISFACTION; CONTINUOUS OPTIMIZATION; LOCAL SEARCH; LOCAL SEARCH ALGORITHM; MENTAL CONCEPTS; METAHEURISTIC; PROBLEM DOMAIN; SEARCH SPACES;

COMBINATORIAL OPTIMIZATION; COMPUTER PROGRAMMING; CONSTRAINT THEORY; HEURISTIC METHODS; LEARNING ALGORITHMS; SPACE RESEARCH; STEELMAKING;

CONSTRAINED OPTIMIZATION;

EID: 70350426584     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04244-7_39     Document Type: Conference Paper

References (36)

1. Ahuja, R.K., Ergun, O., Orlin, J.B., Punnen, A.P.: A survey of Very Large Scale Neighborhood Search Techniques. Discrete Applied Mathematics 123, 75-102 (2002)
2. Boese, K.D.: Cost versus distance in the traveling salesman problem. TR, CSD-950018, UCLA (1995)
3. Battiti, R., Tecchiolli, G.: The reactive tabu search. ORSA Journal on Computing 6(2), 126-140 (1994)
4. Beasley, J.E.: OR-Library: Distributing test problems by electronic mail. Operations Research Society 41, 1069-1072 (1990)
5. Caprara, A., Fischetti, M., Toth, P., Vigo, D., Guida, P.L.: Algorithms for Railway Crew Management. Mathematical Programming 79, 125-141 (1997)
6. Černy, V.: Thermodynamics Approach to the Travelling Salesman Problem: An Efficient Simulation Algorithm. Optimization Theory Appl. 45, 41-51 (1985)
7. Codognet, P., Diaz, D.: Yet Another Local Search Method for Constraint Solving. In: AAAI (2001)
8. Costas, J.P.: A study of a class of detection waveforms having nearly ideal range-Doppler ambiguity properties. Proceedings of the IEEE 72(8), 996-1009 (1984)
9. Fichte, J.G.: Wissenschaftslehre, The Science of Knowledge. Cambridge University Press, Cambridge (1982); translated by P. Heath and J. Lachs (1794)
10. Freedman, A., Levanon, N.: Staggered Costas signals. IEEE Trans. Aerosp. Electron Syst. AES-22(6), 695-701 (1986)
11. Glover, F.: Tabu Search, Part I. ORSA Journal on Computing 1(3), 190-206 (1989)
12. Glover, F.: Tabu Search, Part II. ORSA Journal on Computing 2(1), 4-32 (1990)
13. Glover, F., Laguna, M., Marti, R.: Fundamentals of scatter search and path relinking. TR, 80309-0419, University of Colorado (2000)
14. Goffe, W.L., Ferrier, G.D., Rogers, J.: Global Optimization and Statistical Functions with Simulated Annealing. Journal of Econometrics 60(1-2), 65-99 (1994)
15. Gomes, C., Sellmann, M.: Streamlined constraint reasoning. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 274-289. Springer, Heidelberg (2004)
16. Golomb, S.W., Taylor, H.: Two Dimensional Synchronization Patterns for Minimum Ambiguity. IEEE Trans. Informat. Theory IT-28(4), 600-604 (1982)
17. Hansen, P., Mladenovic, N.: Variable Neighbourhood Search: Principles and Applications. European Journal of Operational Research 130, 449-467 (2001)
18. Hegel, G.W.F.: Phänomenologie des Geistes, Phenomenology of Spirit, translated by Miller, A.V. Oxford University Press, Oxford (1807) (1977)
19. Hoffmann, K.L., Padberg, M.W.: Solving Airline Crew Scheduling Problems by Branch-and-Cut. Management Science 39(6), 657-682 (1993)
20. Housos, E., Elmoth, T.: Automatic Optimization of Subproblems in Scheduling Airline Crews. Interfaces 27(5), 68-77 (1997)
21. Jones, T., Forrest, S.: Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms. In: Genetic Algorithms, pp. 184-192 (1995)
22. Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by Simulated Annealing. Science 220 (4598), 671-680 (1983)
23. Selman, B., Levesque, H.J., Mitchell, D.G.: A New Method for Solving Hard Satisfiability Problems. In: AAAI, pp. 440-446 (1992)
24. Macready, W.G., Wolpert, D.H.: Bandit Problems and the Exploration/Exploitation Tradeoff. IEEE Transactions on Evolutionary Computation 2(2), 2-22 (1998)
25. Marchiori, E., Steenbeek, A.: An Iterated Heuristic Algorithm for the Set Covering Problem. In: WEA (1998)
26. Metropolis, N., Rosenbluth, A.W., Rosenbluth, M.N., Teller, A.H., Teller, E.: Equations of State Calculations by Fast Computing Machines. Chemical Physics 21(6), 1087-1092 (1953)
27. Moran, J.: The Wonders of Magic Squares. Vintage, New York (1982)
28. Musliu, N.: Local Search Algorithm for Unicost Set Covering Problem. In: Ali, M., Dapoigny, R. (eds.) IEA/AIE 2006. LNCS (LNAI), vol. 4031, pp. 302-311. Springer, Heidelberg (2006)
29. Stuetzle, T.: Iterated local search for the quadratic assignment problem. TR, AIDA-99-03, Darmstadt University of Technology (1999)
30. SIMANN. Fortran Simulated Annealing code (2004), http://wueconb.wustl. edu/~goffe
31. Thompson, P.M., Orlin, J.B.: The theory of cyclic transfers Working Paper No. OR, 200-89, Operations Research Center. MIT, Cambridge (1989)
32. Toregas, C., Swain, R., ReVelle, C., Bergman, L.: The Location of Emergency Service Facilities. Operational Research 19(6), 1363-1373 (1971)
33. Van Hentenryck, P., Michel, L.: Constraint-Based Local Search. The MIT Press, Cambridge (2005)
34. Van Hentenryck, P., Michel, L.: Synthesis of constraint-based local search algorithms from high-level models. In: AAAI (2007)
35. Vasko, F.J., Wilson, G.R.: An Efficient Heuristic for Large Set Covering Problems. Naval Research Logistics Quarterly 31, 163-171 (1984)
36. Vasko, F.J., Wolf, F.E.: Optimal Selection of Ingot Sizes via Set Covering. Operations Research 35, 115-121 (1987)