Back to Results
First PageMeta Content
Spanning tree / NP-complete problems / Network theory / Minimum spanning tree / Capacitated minimum spanning tree / Shortest path problem / Tree / Graph partition / Travelling salesman problem / Theoretical computer science / Graph theory / Computational complexity theory


Document Date: 2008-12-09 15:25:41

Open Document

File Size: 2,72 MB

Share Result on Facebook

City

Gainesville / Cambridge / /

Company

OPERATIONAL RESEARCH Intl / Elsevier Science Ltd. / /

Currency

USD / /

/

Facility

University of Florida / USA COperations Research Center / Massachusetts Institute of Technology / /

IndustryTerm

neighborhood search algorithms / local improvement algorithm / excellent solutions / telecommunications network design / neighborhood search approach / feasible solution / telecommunications / construction algorithms / final solution / optimum solutions / neighborhood search algorithm / manufacturing / computing / large-scale neighborhood search / local improvement algorithms / important tool / largescakle neighborhootl search algorithms / search algorithms / /

Organization

School of Management / USA COperations Research Center / Massachusetts Institute of Technology / University of Florida / /

Person

Tabu / Luis Gouveia / /

Position

Corresponding author / /

ProgrammingLanguage

FL / /

ProvinceOrState

Laguna / Florida / Massachusetts / /

SportsEvent

ufl / SKl / /

Technology

construction algorithms / neighborhood search algorithm / central processor / artificial intelligence / http / Neighborhood search algorithms / developing neighborhood search algorithms / 2000 Abstract Neighborhood search algorithms / largescakle neighborhootl search algorithms / local improvement algorithms / Local Improvement Algorithm / /

URL

www.ms.ic.ac.uk/info.html / www.elsevier.com/locate/orms / /

SocialTag