Back to Results
First PageMeta Content
Complexity classes / NP-complete problems / Mathematical optimization / Structural complexity theory / NP-complete / NP-hard / P versus NP problem / NP / Vertex cover / Theoretical computer science / Computational complexity theory / Applied mathematics


Measuring Rationality with the Minimum Cost of Revealed Preference Violations Mark Dean and Daniel Martin Online Appendices - Not for Publication
Add to Reading List

Document Date: 2013-06-19 07:39:31

Open Document

File Size: 144,16 KB

Share Result on Facebook

Currency

pence / USD / /

Facility

The Clay Mathematics Institute / C library / /

IndustryTerm

polynomial time solution algorithm / cellphone network / online appendix / bound algorithms / software packages / approximate solutions / Online Appendices / e¢ cient graph theoretic algorithm / rst’search / /

MarketIndex

Minimum Cost / /

Movie

Not for Publication / /

Organization

Clay Mathematics Institute / /

Person

Mark Dean / Daniel Martin / /

ProgrammingLanguage

C / C++ / /

ProvinceOrState

Rhode Island / South Dakota / Minnesota / Alabama / Alaska / Wyoming / /

Technology

e¢ cient graph theoretic algorithm / 1 1 Algorithm / polynomial time solution algorithm / /

URL

www.gnu.org/software/glpk / /

SocialTag