Back to Results
First PageMeta Content
Operations research / Complexity classes / Mathematical optimization / Linear programming / Algorithm / NP-complete / Simplex algorithm / Simplex / NP / Theoretical computer science / Applied mathematics / Computational complexity theory


LinearProgram SlId NewAlor Many people think that abstract mathematics is a nightmare. In truth, it is a
Add to Reading List

Document Date: 2013-03-22 09:46:09

Open Document

File Size: 1,97 MB

Share Result on Facebook

City

Montreal / /

Continent

Asia / South America / Africa / /

Country

United States / United Kingdom / /

Facility

University of Montreal / Stanford University / University building / /

IndustryTerm

simplex algorithm / polynomial time algorithms / combinatorial algorithms / final solution / polynomial time solution / onesecond solution / bizarre and hypothetical products / bank branch / timal solution / /

Organization

United Nations / Stanford University / University of Montreal / Academy of Science of the USSR / /

Person

John von Neumann / L. G. Khachian / Oskar Morgenstern / Laszlo Lovasz / Peter Gacs / Charles de Gaulle / George Minty / George Dantzig / Thentalk / Victor Klee / /

Position

Queen / waitress / climber / Princeton physicist / planner / salesman / mountain climber / mathematician / /

SportsLeague

Stanford University / /

Technology

simplex algorithm / polynomial time algorithms / Midi / /

SocialTag