The Common Optimization INterface for Operations Research: Promoting open-source software in the operations research community
By Robert W. Lougee. 2003
448 citations recorded by the source corpus.
Subfields: Information Systems, Management Science and Operations Research, Software
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Information Systems
- Tor Justesen
- Wolfgang Huber
- Haroldo Gambini Santos
- Túlio A. M. Toffolo
- Jesper Bach Larsen
- Christodoulos A. Floudas
- Greet Vanden Berghe
- Matheus Guedes Vilas Boas
In Management Science and Operations Research
- Tor Justesen
- Wolfgang Huber
- Haroldo Gambini Santos
- Túlio A. M. Toffolo
- Jesper Bach Larsen
- Christodoulos A. Floudas
- Greet Vanden Berghe
- Matheus Guedes Vilas Boas
In Software
- Tor Justesen
- Wolfgang Huber
- Haroldo Gambini Santos
- Túlio A. M. Toffolo
- Jesper Bach Larsen
- Christodoulos A. Floudas
- Greet Vanden Berghe
- Matheus Guedes Vilas Boas
Citations in the corpus
- Optimal Decision Trees for the Algorithm Selection Problem: Integer Programming Based Approaches (2019, methodology): “To validate our proposal, we selected the challenging task of improving the performance of the COIN-OR Linear Programming Solver - CLP, which is the Linear Programming (LP) solver employed within the COIN-OR Branch & Cut - CBC solver (Lougee-Heimer, 2003).”
- ANTIGONE: Algorithms for coNTinuous / Integer Global Optimization of Nonlinear Equations (2014, methodology): “3 [139], Couenne 0.4 [17], LINDO 8 .”
- The Home Care Crew Scheduling Problem: Preference-based visit clustering and temporal dependencies (2012, methodology): “The algorithm is implemented in the branch-and-cut-and-price framework from COIN-OR, see Lougee-Heimer (2003), using the COIN-OR open-source LP solver CLP.”
- Integer programming techniques for the nurse rostering problem (2014, methodology): “We used CPLEX version 12.2.0 and COIN-OR CBC 2.7.6.”
- A review and comparison of solvers for convex MINLP (2018, unknown): “Among the MILP solvers, the most recognized commercial solvers are CPLEX [73], Gurobi [67], and XPRESS [48], while the solvers GLPK [97] and CBC [54], the last one from the COIN-OR initiative [91], are among the most recognized open-source solvers, all of them implementing an arsenal of methods with”
- GloMIQO: Global mixed-integer quadratic optimizer (2012, methodology): “– Couenne [27,88] Like αBB and BARON, Couenne addresses generic MINLP to ε-global optimality and relaxes bilinear terms using the convex hull.”
- Data-driven hypothesis weighting increases detection power in genome-scale multiple testing (2016, methodology): “For the underlying LP problem we used the open-source SYMPHONY solver of the COIN-OR project [50].”