Problem Difficulty and the Phase Transition in Heuristic Search Eldan Cohen and J. Christopher Beck Department of Mechanical & Industrial Engineering University of Toronto Toronto, Canada {ecohen, jcb}@mie.utoronto.ca

Source URL: tidel.mie.utoronto.ca

Double Variable Neighbourhood Search with Smoothing for the Molecular Distance Geometry Problem Leo Liberti1 , Carlile Lavor2 , Nelson Maculan3 , Fabrizio Marinelli1 1 ´

Source URL: www.enseignement.polytechnique.fr

LOCAL SEARCH FOR THE MINIMUM FUNDAMENTAL CYCLE BASIS PROBLEM E.Amaldi, L.Liberti, N.Maculan§, F.Maffioli DEI, Politecnico di Milano, IMilano {amaldi,liberti,maculan,maffioli}@elet.polimi.it Abstract Let G=(V,E) b

Source URL: www.enseignement.polytechnique.fr

________________________________ A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem Gerardo Berbeglia Jean-François Cordeau

Source URL: www.cirrelt.ca

The Subset Sum Problem Reducing Time Complexity of NP-Completeness with Quantum Search Abstract The Subset Sum Problem is a member of the NPcomplete class, so no known polynomial time algorithm exists for it. Although th

Source URL: ciim.usf.edu

Clearing the rights for Public heritage collections: The problem with Diligent Search Panel: Maurizio Borghi, Bournemouth University, EnDOW Project leader Marcella Favale, Bournemouth University, EnDOW Project coordinato

Source URL: diligentsearch.eu

Reflections on SDLIP and other search interfaces Sergio Guzman-Lara & Greg Janée December 11, The problem Designing and implementing a search interface is a relatively simple problem: all that’s required is a

Source URL: legacy.alexandria.ucsb.edu

Crowdsourcing diligent search: a solution for the orphan works problem? Maurizio Borghi Centre for Intellectual Property Policy & Management Bournemouth University

Source URL: diligentsearch.eu

Research Library The starting point for research: key titles and diverse, international content across 150 subjects RESEARCH LIBRARY SOLVES a common library problem: where to begin with a research problem or topic search

Source URL: media2.proquest.com

Approximation bounds for Black Hole Search problems? Ralf Klasing?? , Euripides Markou? ? ? , Tomasz Radzik† , Fabiano Sarracco‡ Abstract. A black hole is a highly harmful stationary process residing in a node of a n

Source URL: emarkou.users.uth.gr

• Graph theory
• Mathematics
• Computational complexity theory
• Operations research
• Combinatorial optimization
• Routing algorithms
• Search algorithms
• Edsger W. Dijkstra
• Travelling salesman problem
• A* search algorithm
• Flow network
• Tree traversal