Home > Research > Activities > Solving discrete optimization problems by branc...

Research

Keywords

View graph of relations

Solving discrete optimization problems by branch-and-cut

Activity: Talk or presentation types › Invited talk

01/2005

Invited seminar.

Related projects

  • Cutting-Plane Approaches to Integer Programming

    Project: NonFunded Project › Research

External organisation (External collaborations)

NameUniversity of Aarhus
Country/TerritoryDenmark