<--- Back to Details
First PageDocument Content
Mathematics / COIN-OR / MINTO / Linear programming / Cutting-plane method / Symphony Developer Edition / Algorithm / Solver / Travelling salesman problem / Operations research / Mathematical optimization / Applied mathematics
Date: 2011-09-11 15:50:29
Mathematics
COIN-OR
MINTO
Linear programming
Cutting-plane method
Symphony Developer Edition
Algorithm
Solver
Travelling salesman problem
Operations research
Mathematical optimization
Applied mathematics

SYMPHONY 4.0 User’s Manual 1 SYMPHONY Developed By T.K. Ralphs2

Add to Reading List

Source URL: www.coin-or.org

Download Document from Source Website

File Size: 476,28 KB

Share Document on Facebook

Similar Documents

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

DocID: 1xVFF - View Document

Exploiting Anonymity in Approximate Linear Programming: Scaling to Large Multiagent MDPs

DocID: 1xUZo - View Document

Mixed-Integer Linear Programming LPBranch-and-Bound Search

DocID: 1voVH - View Document

Mathematics / Mathematical optimization / Computational complexity theory / Combinatorial optimization / Travelling salesman problem / Cutting-plane method / Decomposition method / Linear programming / COIN-OR / Ear decomposition

DECOMPOSITION METHODS FOR INTEGER LINEAR PROGRAMMING by Matthew Galati

DocID: 1vkrh - View Document

Approximate Linear Programming for Constrained Partially Observable Markov Decision Processes Pascal Poupart† , Aarti Malhotra† , Pei Pei† , Kee-Eung Kim§ , Bongseok Goh§ and Michael Bowling‡ † David R. Cher

DocID: 1vcNT - View Document