<--- Back to Details
First PageDocument Content
Theoretical computer science / Vehicle routing problem / Job shop scheduling / Scheduling / Linear programming / Guided Local Search / Constraint satisfaction / Optimization problem / Mathematical optimization / Operations research / Applied mathematics / Mathematics
Date: 2003-08-27 11:57:49
Theoretical computer science
Vehicle routing problem
Job shop scheduling
Scheduling
Linear programming
Guided Local Search
Constraint satisfaction
Optimization problem
Mathematical optimization
Operations research
Applied mathematics
Mathematics

Add to Reading List

Source URL: www.dcs.gla.ac.uk

Download Document from Source Website

File Size: 348,10 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