<--- Back to Details
First PageDocument Content
Numerical analysis / Mathematical optimization / Search algorithms / Constraint programming / Guided Local Search / Heuristics / Genetic algorithm / Hill climbing / Travelling salesman problem / Mathematics / Applied mathematics / Operations research
Date: 2007-05-26 07:34:01
Numerical analysis
Mathematical optimization
Search algorithms
Constraint programming
Guided Local Search
Heuristics
Genetic algorithm
Hill climbing
Travelling salesman problem
Mathematics
Applied mathematics
Operations research

Add to Reading List

Source URL: www.bracil.net

Download Document from Source Website

File Size: 577,97 KB

Share Document on Facebook

Similar Documents

LTE / Technology / Mobile technology / Wireless / Software-defined radio / Mobile telecommunications / ENodeB / System Architecture Evolution / Telecommunications / E-UTRA / User equipment / Mobility management

Protocol log analysis with constraint programming Mats Carlsson Olga Grinchtein Justin Pearson

DocID: 1xUdh - View Document

PDF Document

DocID: 1xSrV - View Document

Answer Sets: From Constraint Programming Towards Qualitative Optimization Gerhard Brewka

DocID: 1vleR - View Document

Constraint Programming Mark Wallace Contact address: Mark Wallace, IC-Parc, William Penney Laboratory, Imperial College, LONDON SW7 2AZ. email: September 1995

DocID: 1v7SC - View Document

Solving Segment Routing Problems with Hybrid Constraint Programming Techniques Renaud Hartert, Pierre Schaus, Stefano Vissicchio, and Olivier Bonaventure UCLouvain, ICTEAM, Place Sainte Barbe 2, 1348 Louvain-la-Neuve, Be

DocID: 1v72L - View Document