Michael Junger and Stefan Thienel. The design of the branch-and-cut system ABACUS. Technical Report TR97.263, University of Cologne, Dept. of Computer Science, 1997. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A case-study for EasyLocal++: the Course Timetabling Problem - Di Gaspero, Schaerf (2001) (Correct)
....obtain with a limited e#ort a set of local search algorithms, possibly based on di#erent neighborhood relations, which can be composed in di#erent ways. A few other systems for local search or other techniques have been proposed in the literature, such as Localizer [6] HotFrame [3] and ABACUS [5]. A comparison between EasyLocal and those systems is provided in [2] Here we just want to mention that, in our opinion, the strength of EasyLocal is that it makes a balanced use of O O features needed for the design of a framework, namely templates and virtual functions. In fact, on the one ....
Michael Junger and Stefan Thienel. The design of the branch-and-cut system ABACUS. Technical Report TR97.263, University of Cologne, Dept. of Computer Science, 1997.
The ABACUS System for Branch-and-Cut-and-Price Algorithms in.. - Jünger, Thienel (1998) Self-citation (Thienel) (Correct)
No context found.
Michael Junger and Stefan Thienel, `The design of the branch-and-cut system ABACUS', Technical report, Institut fur Informatik, Universitat zu Koln, 1997.
BC v2.0 - Design, usage, strategies and some test results - Þorsteinsson (1998) (Correct)
No context found.
J#nger, M. and S. Thienel. The design of the branch-and-cut system ABACUS. Report no. 97.260, Institut f#r Informatik, Universit#t zu K#ln, January 1997.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC