Scholar4AI Updated 2026-11-03 14:43 UTC+09:00

coin-or/Clp: papers linking to it

GitHub · 499 stars · 100 forks · C++ · created 2019 · github.com/coin-or/Clp

← Code and data repositories cited in research papers

Research papers in the 480 tracked journals that link to coin-or/Clp (https://github.com/coin-or/Clp), read from their Crossref records: by year, category and journal, the family tree of papers building on one another, and the linked repositories derived from it or that it derives from.

Share: X LinkedIn Bluesky Threads Facebook Reddit Hacker News Hatena LINE Email
Copy:

Key findings#

  • 7 papers in the tracked journals link to the GitHub repository coin-or/Clp in their Crossref records, the first in 2020; most of them (4) in 2025.
  • By category: Operations Research (7); the journals with the most are Mathematical Programming (3), Optimization and Engineering (1) and Mathematical Programming Computation (1).
  • Linked repositories derived from it: 1, such as coin-or/Clp: Version 1.17.6.

By year#

2020: 2 papers2025: 4 papers2026: 1 paper
20202026
Papers linking to coin-or/Clp by publication year
YearPapers
20202
20254
20261

Journals#

Family tree#

Each paper sits under the earlier paper it builds on; papers that cite no other paper here start a branch of their own.

    Linked repositories coin-or/Clp derives from or that derive from it
    RepositoryRelationPapers
    coin-or/Clp: Version 1.17.6Zenodo archive of coin-or/Clp2
    Papers linking to coin-or/Clp, most cited first
    PublishedTitleJournalAuthorsCitationsLink
    2020-06-26A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementationMathematical Programming ComputationSahar Tahernejad, Ted K. Ralphs, Scott T. DeNegre101cites it
    2020-05-02Deterministic global optimization of steam cycles using the IAPWS-IF97 modelOptimization and EngineeringDominik Bongartz, Jaromił Najman, Alexander Mitsos9cites it
    2025-05-14$$\mathcal {V}$$-polyhedral disjunctive cutsMathematical ProgrammingEgon Balas, Aleksandr M. Kazachkov3cites it
    2025-01-29Monoidal strengthening of simple $$\mathcal {V}$$-polyhedral disjunctive cutsMathematical ProgrammingAleksandr M. Kazachkov, Egon Balas0cites it
    2025-06-23Out-of-sample estimation for a branch-and-bound algorithm with growing datasetsJournal of Global OptimizationSusanne Saß, Alexander Mitsos, Nikolay Ivanov Nikolov et al.0cites it
    2025-09-15An Operator Splitting-Based Interior-Point Method for Conic Linear ProgrammingJournal of the Operations Research Society of ChinaHan-Tao Nie, Ji-Rui Ma, Zaiwen Wen et al.0cites it
    2026-03-01On the number of degenerate simplex pivotsMathematical ProgrammingKirill Kukharenko, Laura Sanità0cites it

    How this is measured#

    Links are read from each paper's Crossref record as its publisher deposited it: the URLs and repository DOIs in its reference list (the software and data it cites) and its supplementary links (“is-supplemented-by”: its own code or data). A paper that gives its code only in the text, a footnote or a data availability statement is not counted, and some publishers deposit reference lists without their URLs, so every count here is a lower bound. Repository details come from the GitHub REST API (stars, forks, and the repository a fork was made from), the Hugging Face Hub API (likes, downloads, and the base model a model was derived from) and DataCite (Zenodo and other data DOIs, and the GitHub release a Zenodo record archives), read again every month.

    Cite this page

    Scholar4AI. (2026). coin-or/Clp: papers linking to it. Journal and Conference Research Rankings. Retrieved November 3, 2026, from https://scholar4ai.com/code/github-coin-or-clp

    @misc{scholar4ai-code-github-coin-or-clp,
      author = {{Scholar4AI}},
      title = {coin-or/Clp: papers linking to it},
      year = {2026},
      howpublished = {\url{https://scholar4ai.com/code/github-coin-or-clp}},
      urldate = {2026-11-03},
      note = {Journal and Conference Research Rankings; data from OpenAlex (CC0); licensed CC BY-NC 4.0}
    }

    Free to reuse for non-commercial purposes with attribution (CC BY-NC 4.0).