Colourful Linear Programming Feasibility Problem: Algorithms - Guohong Rong
-25% koodilla BOOKS
Toimitus 12-18 arkipäivässä
30 päivän palautusoikeus
This problem was presented by Barany and Onn in 1997 and it is still not known if a polynomial-time algorithm for the problem exists. The monochrome version of this problem, expressing p as a convex combination of points in a set S, is a traditional linear programming feasibility problem. The colourful Caratheodory Theorem, due to Barany in 1982, provides a sufficient condition for the existence of a colour ... Täydellinen kuvaus
Saatat myös pitää
TOP
Gödel, Escher, Bach: An Eternal Golden Braid
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
If Anyone Builds It, Everyone Dies: Why Superhuman AI Would Kill Us All
Eliezer Yudkowsky, Nate Soares
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
AI Engineering: Building Applications with Foundation Models
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
Empire of AI: Dreams and Nightmares in Sam Altman's OpenAI
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
The Pragmatic Programmer: journey to mastery, 20th Anniversary Edition, 2/e: your journey to mastery, 20th Anniversary Edition
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
The Rust Programming Language
Steve Klabnik, Carol Nichols, Chris Krycho
-25% koodilla BOOKS
Loppu
TOP
How To Think About AI: A Guide For The Perplexed
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
Slanted 47 Digital Tools: Slanted Magazine
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
The Web Application Hacker's Handbook: Discovering and Exploiting Security Flaws
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
The Art of Game Design: A Book of Lenses
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
How Linux Works: What Every Superuser Should Know
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
Artificial Intelligence: A Modern Approach, Global Edition
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
Python Crash Course: A Hands-On, Project-Based Introduction to Programming
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
CompTIA Security+ Certification Kit: Exam SY0-701
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
Automate the Boring Stuff with Python
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
Fundamentals of Software Architecture: A Modern Engineering Approach
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
Speak Data: Artists, Scientists, Thinkers, and Dreamers on How We Live Our Lives in Numbers
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
Hacking: The Art of Exploitation
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
Linux Basics for Hackers, 2nd Edition: Getting Started with Networking, Scripting, and Security in Kali
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
HBR Guide to Generative AI for Managers
-25% koodilla BOOKS
Toimittajalla varastossa
Kuvaus
This problem was presented by Barany and Onn in 1997 and it is still not known if a polynomial-time algorithm for the problem exists. The monochrome version of this problem, expressing p as a convex combination of points in a set S, is a traditional linear programming feasibility problem. The colourful Caratheodory Theorem, due to Barany in 1982, provides a sufficient condition for the existence of a colourful set of points containing p in its convex hull. Barany's result was generalized by Holmsen et al. in 2008 and by Arocha et al. in 2009 before being recently further generalized by Meunier and Deza. We study algorithms for colourful linear programming under the conditions of Barany and their generalizations. In particular, we implement the Meunier-Deza algorithm and enhance previously used random case generators. Computational benchmarking and a performance analysis including a comparison between the two algorithms of Barany and Onn and the one of Meunier and Deza, and random picking are presented.
Lisätietoja
| Kirjoittaja | Guohong Rong |
|---|---|
| Julkaisija | LAP LAMBERT Academic Publishing |
| Julkaisuvuosi | 2012 |
| Kannen tyyppi | Pehmeäkantinen |
| EAN | 9783659286773 |