Disjunctive cuts in branch-and-but-and-price algorithms ... - gerad
Disjunctive cuts in branch-and-but-and-price algorithms ... - gerad
Disjunctive cuts in branch-and-but-and-price algorithms ... - gerad
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Motivation: Branch-cut-<strong>and</strong>-<strong>price</strong><br />
• Ma<strong>in</strong> research trend:<br />
– Problem specific <strong>cuts</strong> <strong>in</strong> the variables of the compact<br />
formulation.<br />
• Many succesful applications:<br />
– Vehicle rout<strong>in</strong>g problem with time w<strong>in</strong>dows: Kohl, Desrosiers,<br />
Madsen, Solomon , Soumis (1999)<br />
– Multicommodity flow problems: Barnhart, Hane, Vance (2000)<br />
– Capacitated vehicle rout<strong>in</strong>g problem: Fukasawa, Longo, Lysgaard,<br />
Poggi de Aragão, Reis, Uchoa, Werneck (2006)<br />
– Multiple depot vehicle schedul<strong>in</strong>g: Hadjar, Marcotte, Soumis<br />
(2006)<br />
– Capacitated m<strong>in</strong>imum spann<strong>in</strong>g tree: Uchoa, Fukasawa,<br />
Lysgaard, Pessoa, Poggi de Aragão, Andrade (2007).<br />
• Some research on generic <strong>cuts</strong> on the variables of the<br />
extended formulation:<br />
– Petersen, Pis<strong>in</strong>ger, Spoorendonk (2007)
Change language