<--- Back to Details
First PageDocument Content
Operations research / Combinatorial optimization / Travelling salesman problem / Branch and bound / Linear programming relaxation / Integer programming / Branch and cut / Linear programming / Algorithm / Mathematical optimization / Cutting-plane method / Simplex algorithm
Date: 2012-07-25 10:25:04
Operations research
Combinatorial optimization
Travelling salesman problem
Branch and bound
Linear programming relaxation
Integer programming
Branch and cut
Linear programming
Algorithm
Mathematical optimization
Cutting-plane method
Simplex algorithm

227 Documenta Math. Markowitz and Manne + Eastman + Land and Doig = Branch and Bound

Add to Reading List

Source URL: documenta.sagemath.org

Download Document from Source Website

File Size: 629,99 KB

Share Document on Facebook

Similar Documents

IMPLEMENTATION OF A CUTTING PLANE METHOD FOR SEMIDEFINITE PROGRAMMING by  Joseph G. Young

IMPLEMENTATION OF A CUTTING PLANE METHOD FOR SEMIDEFINITE PROGRAMMING by Joseph G. Young

DocID: 1tPuJ - View Document

PDF Document

DocID: 1q42m - View Document

227  Documenta Math. Markowitz and Manne + Eastman + Land and Doig = Branch and Bound

227 Documenta Math. Markowitz and Manne + Eastman + Land and Doig = Branch and Bound

DocID: 1p8DV - View Document

277  Documenta Math. Subgradient Optimization in Nonsmooth Optimization

277 Documenta Math. Subgradient Optimization in Nonsmooth Optimization

DocID: 1oUrq - View Document

First-Order Mixed Integer Linear Programming  Geoffrey J. Gordon Machine Learning Department Carnegie Mellon University Pittsburgh, PA 15213

First-Order Mixed Integer Linear Programming Geoffrey J. Gordon Machine Learning Department Carnegie Mellon University Pittsburgh, PA 15213

DocID: 1nwjJ - View Document