Solving Hard Integer Programs

*********************************
There is now a CONTENT FREEZE for Mercury while we switch to a new platform. It began on Friday, March 10 at 6pm and will end on Wednesday, March 15 at noon. No new content can be created during this time, but all material in the system as of the beginning of the freeze will be migrated to the new platform, including users and groups. Functionally the new site is identical to the old one. webteam@gatech.edu
*********************************

Event Details
  • Date/Time:
    • Tuesday July 17, 2001
      11:00 am - 11:59 pm
  • Location: IC Bldg., Room 115
  • Phone:
  • URL:
  • Email:
  • Fee(s):
    N/A
  • Extras:
Contact
Barbara Christopher
Industrial and Systems Engineering
Contact Barbara Christopher
404.385.3102
Summaries

Summary Sentence: Solving Hard Integer Programs

Full Summary: Solving Hard Integer Programs

We discuss some classes of computationally hard integer programming instances. A common feature is that they remain hard even for very few variables. For one of the classes we analyze why a particular reformulation is easy to solve. The reformulation makes use of a lattice interpretation and the analysis uses knowledge of the corresponding lattice determinant.

Additional Information

In Campus Calendar
No
Groups

School of Industrial and Systems Engineering (ISYE)

Invited Audience
No audiences were selected.
Categories
Seminar/Lecture/Colloquium
Keywords
No keywords were submitted.
Status
  • Created By: Barbara Christopher
  • Workflow Status: Published
  • Created On: Oct 8, 2010 - 7:49am
  • Last Updated: Oct 7, 2016 - 9:53pm