» Live Videos » Download Games » Flash Games » Game News » Media Forum

Bay Area Discrete Math Day XII: Integer Linear Programming

Back


Bay Area Discrete Math Day XII: Integer Linear Programming video:


Google TechTalks Bay Area Discrete Math Day XII April 15, 2006 Sinai Robins (Temple University) ABSTRACT One of the most fundamental problems in integer linear programming is that of finding an integer point inside a given rational polytope. Here we develop a new tool to solve this problem. We first give a survey of the history of Dedekind sums, and show the current state of a recently developed theory of higher dimensional differentiable Dedekind sums. We next use these differentiable Dedekind sums to locate points in rational polytopes. Some examples in low dimensions will be given. Moreover, no background in Dedekind sums is assumed at all, to maximize accessibility for the casual...

Bay Area Discrete Math Day XII: Integer Linear Programming Category: Howto
Bay Area Discrete Math Day XII: Integer Linear Programming Uploaded: October 9th, 2007 @ 1:07 am
Bay Area Discrete Math Day XII: Integer Linear Programming Author: View googletechtalks's Other Uploaded Videos

Bay Area Discrete Math Day XII: Integer Linear Programming Length: 30:47
Rating:
Bay Area Discrete Math Day XII: Integer Linear Programming Views:

Tags: google howto bay area discrete math day xii

Links related to Bay Area Discrete Math Day XII: Integer Linear Programming video:


» View Video Comments For Bay Area Discrete Math Day XII: Integer Linear Programming
» View googletechtalks's Other Uploaded Videos

Bay Area Discrete Math Day XII: Integer Linear Programming Video Thumbnails:


Thumbnail #1 Video Thumbnail #1:
Thumbnail #2 Video Thumbnail #2:
Thumbnail #3 Video Thumbnail #3:


Video Embedding Code:


Video Url:


Embed Code:

* Embed Bay Area Discrete Math Day XII: Integer Linear Programming video on your website, social bookmark, myspace, or blog.

Fun Game & Video Sites:

Download Free Games