<--- Back to Details
First PageDocument Content
Graph theory / Mathematics / Geometry / Convex optimization / Operations research / Linear programming / Polytopes / Unique sink orientation / LP-type problem / Orientation / Simplex / Ear decomposition
Date: 2016-06-20 11:55:09
Graph theory
Mathematics
Geometry
Convex optimization
Operations research
Linear programming
Polytopes
Unique sink orientation
LP-type problem
Orientation
Simplex
Ear decomposition

Unique Sink Orientations of Grids ? Bernd G¨artner1 , Walter D. Morris, Jr.2 , and Leo R¨ ust3

Add to Reading List

Source URL: people.inf.ethz.ch

Download Document from Source Website

File Size: 168,05 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

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

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

DocID: 1xUZo - View Document

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

Mixed-Integer Linear Programming LPBranch-and-Bound Search

DocID: 1voVH - View Document

DECOMPOSITION METHODS FOR INTEGER LINEAR PROGRAMMING by  Matthew Galati

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

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