ABACUS is a software system written in C++ that provides a framework for the implementation of branch-and-bound algorithms using linear programming relaxations. Cutting planes or columns can be generated dynamically (branch-and-cut, branch-and-price, branch-and-cut-and-price). ABACUS allows the software developer to concentrate merely on the problem specific parts, i.e., the separation of cutting planes, column generation, and primal heuristics. ABACUS supports the Open Solver Interface (Osi) developed by the COIN-OR (COmputational INfrastructure for Operations Research) project which means that every solver supported by OSI can be used to solve the relaxations. Moreover, ABACUS provides a variety of general algorithmic concepts, e.g., a list of different enumeration and branching strategies from which the best alternative for the user’s application can be chosen. Finally, ABACUS provides many basic data structures and useful tools for the implementation of such algorithms. It is designed both for general mixed integer optimization problems and for combinatorial optimization problems. It unifies cutting plane and column generation within one algorithm framework. Simple reuse of code and the design of abstract data structures and algorithms are met by object oriented programming modules.

References in zbMATH (referenced in 109 articles , 1 standard article )

Showing results 1 to 20 of 109.
Sorted by year (citations)

1 2 3 4 5 6 next

  1. Cacchiani, Valentina; Jünger, Michael; Liers, Frauke; Lodi, Andrea; Schmidt, Daniel R.: Single-commodity robust network design with finite and hose demand sets (2016)
  2. Gronemann, Martin; Jünger, Michael; Liers, Frauke; Mambelli, Francesco: Crossing minimization in storyline visualization (2016)
  3. Beyer, Stephan; Chimani, Markus: The influence of preprocessing on Steiner tree approximations (2015)
  4. Eckstein, Jonathan; Hart, William E.; Phillips, Cynthia A.: PEBBL: an object-oriented framework for scalable parallel branch and bound (2015)
  5. Bonato, Thorsten; Jünger, Michael; Reinelt, Gerhard; Rinaldi, Giovanni: Lifting and separation procedures for the cut polytope (2014)
  6. Reinelt, Gerhard; Seitz, Hanna: On a binary distance model for the minimum linear arrangement problem (2014)
  7. Zhang, Jianming: An automatic simulation tool for thermal analysis of gravity dams by BFM (2014)
  8. Lang, Jan Christian; Widjaja, Thomas: OREX-J: Towards a universal software framework for the experimental analysis of optimization algorithms (2013)
  9. Wang, Jiadong; Ralphs, Ted: Computational experience with hypergraph-based methods for automatic decomposition in discrete optimization (2013)
  10. Bonomo, Flavia; Marenco, Javier; Saban, Daniela; Stier-Moses, Nicolás E.: A polyhedral study of the maximum edge subgraph problem (2012)
  11. Rebennack, Steffen; Reinelt, Gerhard; Pardalos, Panos M.: A tutorial on branch and cut algorithms for the maximum stable set problem (2012)
  12. Bonato, Thorsten: Contraction-based separation and lifting for solving the max-cut problem (2011)
  13. Delle Donne, Diego; Marenco, Javier: A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem (2011)
  14. Martí, Rafael; Reinelt, Gerhard: The linear ordering problem. Exact and heuristic methods in combinatorial optimization. (2011)
  15. Oller-Marcén, Antonio M.; Grau, José María: On the base-$b$ expansion of the number of trailing zeros of $b^k$! (2011)
  16. Puchinger, Jakob; Stuckey, Peter J.; Wallace, Mark G.; Brand, Sebastian: Dantzig-Wolfe decomposition and branch-and-price solving in G12 (2011)
  17. Rebennack, Steffen; Oswald, Marcus; Theis, Dirk Oliver; Seitz, Hanna; Reinelt, Gerhard; Pardalos, Panos M.: A branch and cut solver for the maximum stable set problem (2011)
  18. Vanderbeck, François: Branching in branch-and-price: A generic scheme (2011)
  19. Margot, François: Symmetry in integer linear programming (2010)
  20. Milano, Michela; Wallace, Mark: Integrating operations research in constraint programming (2010)

1 2 3 4 5 6 next