<--- 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

Leveraging Linear and Mixed Integer Programming for SMT Tim King1 Clark Barrett1 1 New

Leveraging Linear and Mixed Integer Programming for SMT Tim King1 Clark Barrett1 1 New

DocID: 1xVFF - View Document

Mixed-Integer Linear Programming �LP�Branch-and-Bound Search

Mixed-Integer Linear Programming LPBranch-and-Bound Search

DocID: 1voVH - View Document

New integer programming models for tactical and strategic underground production scheduling B. King - PhD, Operations Research with Engineering, Colorado School of Mines, Golden, CO, USA M. Goycoolea – Associate Profes

New integer programming models for tactical and strategic underground production scheduling B. King - PhD, Operations Research with Engineering, Colorado School of Mines, Golden, CO, USA M. Goycoolea – Associate Profes

DocID: 1vnSH - View Document

Designing a Feedback Control System via Mixed-Integer Programming Lena C. Altherr, Thorsten Ederer, Ulf Lorenz, Peter Pelz, Philipp P¨ottgen Abstract Pure analytical or experimental methods can only find a control strat

Designing a Feedback Control System via Mixed-Integer Programming Lena C. Altherr, Thorsten Ederer, Ulf Lorenz, Peter Pelz, Philipp P¨ottgen Abstract Pure analytical or experimental methods can only find a control strat

DocID: 1vlQ3 - View Document

DECOMPOSITION METHODS FOR INTEGER LINEAR PROGRAMMING by  Matthew Galati

DECOMPOSITION METHODS FOR INTEGER LINEAR PROGRAMMING by Matthew Galati

DocID: 1vkrh - View Document