<--- Back to Details
First PageDocument Content
Operations research / Mathematics / Computational complexity theory / Applied mathematics / Mathematical optimization / Heuristic / Integer programming / Relaxation / Branch and bound / Combinatorial optimization / Travelling salesman problem / Algorithm
Date: 2013-09-27 05:04:48
Operations research
Mathematics
Computational complexity theory
Applied mathematics
Mathematical optimization
Heuristic
Integer programming
Relaxation
Branch and bound
Combinatorial optimization
Travelling salesman problem
Algorithm

Microsoft Word - orbs7180.doc

Add to Reading List

Source URL: www.math.hkbu.edu.hk

Download Document from Source Website

File Size: 12,56 KB

Share Document on Facebook

Similar Documents

Search algorithms / Routing algorithms / Combinatorial optimization / Mathematics / Information science / Information retrieval / Game artificial intelligence / A* search algorithm / Heuristic / Bayesian network / Dijkstra's algorithm / Algorithm

Softstar: Heuristic-Guided Probabilistic Inference Mathew Monfort Computer Science Department University of Illinois at Chicago Chicago, IL 60607

DocID: 1xTJu - View Document

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

DocID: 1vf9m - View Document

AUTO2, a saturation-based heuristic prover for higher-order logic Bohua Zhan Massachusetts Institute of Technology

DocID: 1uLt2 - View Document

A Heuristic-Based Approach for Planning Federated SPARQL Queries Gabriela Montoya1 , Maria-Esther Vidal1 , and Maribel Acosta1,2 1 2

DocID: 1uGfs - View Document

An Effective Implementation of the Lin-Kernighan Traveling Salesman Heuristic Keld Helsgaun E-mail: Department of Computer Science Roskilde University

DocID: 1uC4Z - View Document