<--- Back to Details
First PageDocument Content
NP-complete problems / Complexity classes / Operations research / Combinatorial optimization / Travelling salesman problem / Optimization problem / NP / Branch and bound / Mathematical optimization / Theoretical computer science / Computational complexity theory / Applied mathematics
Date: 2009-03-06 00:35:16
NP-complete problems
Complexity classes
Operations research
Combinatorial optimization
Travelling salesman problem
Optimization problem
NP
Branch and bound
Mathematical optimization
Theoretical computer science
Computational complexity theory
Applied mathematics

Artificial Intelligence Artificial Intelligence

Add to Reading List

Source URL: www.cse.unsw.edu.au

Download Document from Source Website

File Size: 698,25 KB

Share Document on Facebook

Similar Documents

Journal of Global Optimization manuscript No. (will be inserted by the editor) Stabilizer-based symmetry breaking constraints for mathematical programs Leo Liberti · James Ostrowski

DocID: 1v0h9 - View Document

OPTIMA 88 Mathematical Optimization Society Newsletter Philippe L. Toint MOS Chair’s Column

DocID: 1uTp0 - View Document

The Annals of Probability 2004, Vol. 32, No. 1B, 1030–1067 © Institute of Mathematical Statistics, 2004 A STOCHASTIC REPRESENTATION THEOREM WITH APPLICATIONS TO OPTIMIZATION AND OBSTACLE PROBLEMS

DocID: 1sOP9 - View Document

Optimization of Electrical Production The production of electricity in France is optimized everyday with the help of a mathematical software developed at Inria, in collaboration with EDF R&D. Substantial performance is a

DocID: 1rxID - View Document

Mathematical optimization / Control theory / Systems science / Academia / Cybernetics / Systems theory / Operations research / Model predictive control / Dynamic programming / Optimal control / Trajectory optimization / Sequential quadratic programming

Timed-Elastic-Bands for Time-Optimal Point-To-Point Nonlinear Model Predictive Control

DocID: 1ru4i - View Document