<--- Back to Details
First PageDocument Content
Operations research / Computational geometry / Linear programming / Convex optimization / LP-type problem / Randomized algorithm / Convex hull / Algorithm / Mathematics / Mathematical optimization / Applied mathematics
Date: 2003-07-23 21:46:41
Operations research
Computational geometry
Linear programming
Convex optimization
LP-type problem
Randomized algorithm
Convex hull
Algorithm
Mathematics
Mathematical optimization
Applied mathematics

Add to Reading List

Source URL: cg.scs.carleton.ca

Download Document from Source Website

File Size: 163,06 KB

Share Document on Facebook

Similar Documents

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

DocID: 1riIF - View Document

Operations research / Foreign relations of Brazil / Foreign relations of India / Computational geometry / Linear programming / LP-type problem / Emo Welzl / Mathematical optimization / Bounding sphere / BRIC / Randomization

BRICS Basic Research in Computer Science BRICS NS-00-1 B. G¨artner: Randomization and Abstraction — Useful Tools for Optimization

DocID: 1pGCE - View Document

Operations research / Linear programming / Convex optimization / Combinatorial optimization / Computational geometry / Bounding sphere / LP-type problem / Simplex algorithm / Time complexity / Mathematical optimization / Integer programming / Duality

50 LINEAR PROGRAMMING Martin Dyer, Bernd G¨artner, Nimrod Megiddo and Emo Welzl

DocID: 1pt06 - View Document

Operations research / Linear programming / Convex optimization / Combinatorial optimization / Computational geometry / Bounding sphere / LP-type problem / Simplex algorithm / Time complexity / Mathematical optimization / Integer programming / Duality

50 LINEAR PROGRAMMING Martin Dyer, Bernd G¨artner, Nimrod Megiddo and Emo Welzl

DocID: 1phok - View Document

Probabilistic complexity theory / Randomized algorithm / Permutation / Structure / LP-type problem / Mathematics / Theoretical computer science / Analysis of algorithms

A subexponential lower bound for the Random Facet algorithm for Parity Games Oliver Friedmann∗ Thomas Dueholm Hansen†

DocID: 19yTs - View Document