| W13-2106 | efficiently in practice using | branch-and-cut | with cutting planes . Kuznetsova |
| W10-2913 | used as the initialization of a | branch-and-cut | framework . Here one first tries |
| P04-1051 | real-life instances , and thus the | branch-and-cut | trees remain small . The LP bounds |
| P04-1051 | algorithms . To keep the size of the | branch-and-cut | tree small , our algorithm employs |
| W10-2913 | hillclimb - ing . If during the | branch-and-cut | process tighter upper bounds |
| W10-2913 | possibility of setting a limit on the | branch-and-cut | process , either on the running |
| W10-2913 | solutions . We use the well-known | branch-and-cut | method , but also show how it |
| P04-1051 | difference in the size of the | branch-and-cut | tree and thus in the solution |
| P04-1051 | have demonstrated that modern | branch-and-cut | algorithms for GATSP can easily |
| P04-1051 | linear program ( ILP ) and uses the | branch-and-cut | method ( Nemhauser and Wolsey |
| P04-1051 | To solve such an ILP using the | branch-and-cut | method , we drop the integrality |
| W10-2913 | type I and there are variants of | branch-and-cut | that can exploit these proper |
| P04-1051 | SCIL can be used with different | branch-and-cut | core codes . We used CPLEX 9.0 |
| W10-2913 | influence the run-times of the | branch-and-cut | framework are vast : there are |
| W10-2913 | guarantee , in practice the applied | branch-and-cut | framework is fast enough to find |
| P04-1051 | for implementing the ILP-based | branch-and-cut | algorithm . SCIL can be used |
| P04-1051 | purposes ( ILP-FS ) and a commercial | branch-and-cut | ILP solver ( ILP-CS ) . Our implementations |
| P04-1051 | for an implementation using a | branch-and-cut | ILP solver which is free for |
| W10-2913 | alignments , it suffices to do | branch-and-cut | on the fertility variables and |
