<--- Back to Details
First PageDocument Content
Combinatorial optimization / Relaxation / Linear programming / Linear programming relaxation / Inequality / Branch and cut / MINTO / Algorithm / Cutting-plane method / Mathematical optimization / Mathematics / Operations research
Date: 2010-06-19 14:25:53
Combinatorial optimization
Relaxation
Linear programming
Linear programming relaxation
Inequality
Branch and cut
MINTO
Algorithm
Cutting-plane method
Mathematical optimization
Mathematics
Operations research

Noncommercial Software for Mixed-Integer Linear Programming J. T. Linderoth∗ T. K. Ralphs† December, 2004.

Add to Reading List

Source URL: coral.ie.lehigh.edu

Download Document from Source Website

File Size: 341,52 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