A branch-and-cut approach to physical mapping with end-probes
RECOMB '97 Proceedings of the first annual international conference on Computational molecular biology
A branch-and-cut algorithm for multiple sequence alignment
RECOMB '97 Proceedings of the first annual international conference on Computational molecular biology
A Polyhedral Approach to the Feedback Vertex Set Problem
Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
A Polyhedral Approach to the Multi-Layer Crossing Minimization Problem
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
Branch-And-Price: Column Generation for Solving Huge Integer Programs
Operations Research
Software section: MINTO, a mixed INTeger optimizer
Operations Research Letters
Computing physical maps of chromosomes with nonoverlapping probes by branch-and-cut
RECOMB '99 Proceedings of the third annual international conference on Computational molecular biology
Branch-and-cut algorithms for the capacitated VRP
The vehicle routing problem
Optimal Compaction of Orthogonal Grid Drawings
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Pruning by Isomorphism in Branch-and-Cut
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
Branch, Cut, and Price: Sequential and Parallel
Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School]
Parallel branch and cut for capacitated vehicle routing
Parallel Computing - Special issue: Parallel computing in logistics
Maximally Violated Mod-p Cuts for the Capacitated Vehicle-Routing Problem
INFORMS Journal on Computing
| Hi-index | 0.00 |
The software system ABACUS is an object-oriented framework for the implementation of branch-and-cut and branch-and-price algorithms. This paper shows the basics of its application to combinatorial and mixed integer optimization problems.