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

First Page		Document Content
Date: 2016-07-12 11:32:46 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 Add to Reading List Source URL: people.inf.ethz.ch Download Document from Source Website File Size: 211,28 KB Share Document on Facebook

	Unique Sink Orientations of Grids ? Bernd G¨artner1 , Walter D. Morris, Jr.2 , and Leo R¨ ust3 DocID: 1riIF - View Document
	BRICS Basic Research in Computer Science BRICS NS-00-1 B. G¨artner: Randomization and Abstraction — Useful Tools for Optimization DocID: 1pGCE - View Document
	50 LINEAR PROGRAMMING Martin Dyer, Bernd G¨artner, Nimrod Megiddo and Emo Welzl DocID: 1pt06 - View Document
	50 LINEAR PROGRAMMING Martin Dyer, Bernd G¨artner, Nimrod Megiddo and Emo Welzl DocID: 1phok - View Document
	A subexponential lower bound for the Random Facet algorithm for Parity Games Oliver Friedmann∗ Thomas Dueholm Hansen† DocID: 19yTs - View Document