Cbc (Coin-or branch and cut) is an open-source mixed integer programming solver written in C++. It can be used as a callable library or using a stand-alone executable. It can be called through AMPL (natively), GAMS (using the links provided by the ​Optimization Services and ​GAMSlinks projects), MPL (through the ​CoinMP project), AIMMS (through the ​AIMMSlinks project), or ​PuLP.

References in zbMATH (referenced in 39 articles )

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

1 2 next

  1. Ahani, Narges; Andersson, Tommy; Martinello, Alessandro; Teytelboym, Alexander; Trapp, Andrew C.: Placement optimization in refugee resettlement (2021)
  2. Frank Schäfer, Mohamed Tarek, Lyndon White, Chris Rackauckas: AbstractDifferentiation.jl: Backend-Agnostic Differentiable Programming in Julia (2021) arXiv
  3. Gleixner, Ambros; Hendel, Gregor; Gamrath, Gerald; Achterberg, Tobias; Bastubbe, Michael; Berthold, Timo; Christophel, Philipp; Jarck, Kati; Koch, Thorsten; Linderoth, Jeff; Lübbecke, Marco; Mittelmann, Hans D.; Ozyurt, Derya; Ralphs, Ted K.; Salvagnin, Domenico; Shinano, Yuji: MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library (2021)
  4. Wolsey, Laurence A.: Integer programming (2021)
  5. Kerr, Catherine; Hoare, Terri; Carroll, Paula; Mareček, Jakub: Integer programming ensemble of temporal relations classifiers (2020)
  6. Koné, Mamadou; Ndiaye, Babacar Mbaye; Seck, Diaraf: Optimal mass transport for activities location problem (2020)
  7. Tahernejad, Sahar; Ralphs, Ted K.; DeNegre, Scott T.: A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation (2020)
  8. van der Linden, Wim J.; Jiang, Bingnan: A shadow-test approach to adaptive item calibration (2020)
  9. Vidali, Janoš: Computing distance-regular graph and association scheme parameters in \textttSageMathwith \textttsage-\textttdrg (2019)
  10. Wenzel, Simon; Misz, Yannik-Noel; Rahimi-Adli, Keivan; Beisheim, Benedikt; Gesthuisen, Ralf; Engell, Sebastian: An optimization model for site-wide scheduling of coupled production plants with an application to the ammonia network of a petrochemical site (2019)
  11. Khajavirad, Aida; Sahinidis, Nikolaos V.: A hybrid LP/NLP paradigm for global optimization relaxations (2018)
  12. Kim, Kibaek; Zavala, Victor M.: Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs (2018)
  13. Moazzez, Babak; Soltani, Hossein: Integer programming approach to static monopolies in graphs (2018)
  14. Belotti, Pietro; Berthold, Timo: Three ideas for a feasibility pump for nonconvex MINLP (2017)
  15. Schulze, Britta; Paquete, Luís; Klamroth, Kathrin; Figueira, José Rui: Bi-dimensional knapsack problems with one soft constraint (2017)
  16. Belotti, Pietro; Bonami, Pierre; Fischetti, Matteo; Lodi, Andrea; Monaci, Michele; Nogales-Gómez, Amaya; Salvagnin, Domenico: On handling indicator constraints in mixed integer programming (2016)
  17. Casale, Giuliano; Sansottera, Andrea; Cremonesi, Paolo: Compact Markov-modulated models for multiclass trace fitting (2016)
  18. Cheung, Kevin K. H.; Moazzez, Babak: Certificates of optimality for mixed integer linear programming using generalized subadditive generator functions (2016)
  19. Gassmann, Horand; Ma, Jun; Martin, Kipp: Communication protocols for options and results in a distributed optimization environment (2016)
  20. Santos, Haroldo G.; Toffolo, Túlio A. M.; Gomes, Rafael A. M.; Ribas, Sabir: Integer programming techniques for the nurse rostering problem (2016)

1 2 next