Improved strategies for branching on general disjunctions

Research output: Contribution to conferencePaperpeer-review

Original languageEnglish
Pages144-145
Number of pages2
Publication statusPublished - 1 Jan 2009
Event8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2009 - Paris, France
Duration: 2 Jun 20094 Jun 2009

Conference

Conference8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2009
Country/TerritoryFrance
CityParis
Period2/06/094/06/09

Keywords

  • Branch and bound
  • Integer programming
  • Split disjunctions

Cite this