Bay Area Discrete Math Day XII: Integer Linear Programming October 9, 2007
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...
Introducing The Veterans Job Bank
11/7/11: White House Press Briefing
President Obama's Press Conference on the G20 Summit
President Obama Speaks About the US-France Alliance
President Obama's Bilateral Meeting with President Cristina Fernandez de Kirchner of Argentina
Weekly Address: We Have to Increase the Pace
President's Management Advisory Board Session II
President's Management Advisory Board Session I
Why We Can't Wait to Invest in Our Infrastructure
Advise the Advisor: Nancy-Ann DeParle
Ren McCormack: A Time to Dance
Maid of Honor: Best Wedding Speech Ever
Amy Poehler: 2011 Commencement Address at the Harvard University
Ray Lewis: Elon Football Team Pregame Speech
Martin Luther King Jr.: We Shall Overcome
Ali G: Ali G's Harvard Graduation Speech
Maximus Decimus Meridius: My Name is Maximus
Gordon Gekko: Greed is Good
Best Man: Funny Best Man Speech
Favorite:
0
0