Solving discrete optimization problems by branch-and-cut - Research Portal | Lancaster University

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

Management Science

Keywords

combinatorial optimisation, branch-and-cut, integer programming

View graph of relations

Solving discrete optimization problems by branch-and-cut

Activity: Talk or presentation types › Invited talk

Professor Adam Letchford - Speaker

03/2004

Invited seminar.

External organisation (External collaborations)

Name	University of Birmingham
Country/Territory	United Kingdom