event

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.

Media

Summary

Solving Hard Integer Programs

Details

Tuesday
Jul 17 2001
12:00pm - 01:00am

Location:

Contact: Barbara ChristopherIndustrial and Systems EngineeringContact Barbara Christopher404.385.3102

Phone:

Email:

URL:

Extras:

Fees:

In campus calendar: No

Sidebar Content

No sidebar content

Groups

School of Industrial and Systems Engineering (ISYE)

Status

  • Workflow Status: Published
  • Created By: Barbara Christopher
  • Created: 10/08/2010
  • Modified By: Fletcher Moore
  • Modified: 10/07/2016

Related Links

No related links.

Categories

Seminar/Lecture/Colloquium

Keywords

No keywords were submitted.

Target Audience