Cbc

COIN-OR Branch-and-Cut solver

Explore on GitHub Read Hacker News discussions

4Distinct people

4Mentions

0Explicit recommenders

1KGitHub stars

REPOSITORY AT A GLANCE

What to know before exploring

What it is

COIN-OR Branch-and-Cut solver

GitHub

Where it is used

No documented product use has been verified yet.

What people are saying

No recommendation phrase was found in the indexed comments.

No classified warning is attached to this page. Read the discussions before treating silence as approval.

Also in these discussions

No other repository is repeatedly linked in the same discussions.

This week on Hacker News

Nov 7–Nov 14 UTC · Direct repository links and separately labeled related project stories. Indexed through 11/14/2026, 3:56:07 PM UTC.

No direct repository links were found in the indexed HN discussions over the past seven days. Older discussions are available below.

Mentions over time

HN mentions by year4 dated mentions

Observed mentions: 2019-09-29 19:32:54 UTC to 2023-07-18 18:44:08 UTC.

Counts come from the repository’s dated source evidence. Index cutoff: 2026-11-02 08:16:59 UTC.

View mention counts and date ranges

UTC ranges include their start and exclude their end. Select a period to filter the source evidence.
Period	Start (UTC)	End (exclusive, UTC)	Mentions	Submissions	Comments
2019	2019-01-01 00:00:00 UTC	2020-01-01 00:00:00 UTC	2	1	1
2020	2020-01-01 00:00:00 UTC	2021-01-01 00:00:00 UTC	0	0	0
2021	2021-01-01 00:00:00 UTC	2022-01-01 00:00:00 UTC	0	0	0
2022	2022-01-01 00:00:00 UTC	2023-01-01 00:00:00 UTC	1	0	1
2023	2023-01-01 00:00:00 UTC	2024-01-01 00:00:00 UTC	1	0	1

What Hacker News says

4 sources

notatallshaw·Jul 18, 2023

Taking a look at pulp it just seems to be a solver abstraction API and all the real work is done by solver libraries written in lower-level languages. It looks like the default solver is COIN-OR CLP/CBC, and that's written in C++: https://github.com/coin-or/Cbc/tree/master/src Maybe I'm misunderstanding something here and it's the abstraction API causing the problems, but it seems like it's up to the solver implementation to be efficient here?

In Linear Programming in Python (2023)

fsflyer·Apr 20, 2022

I've looked at it a little bit, but as someone nearing retirement, it is lacking a number of features that I would like. There are some common tricks that I don't see how to model with ProjectionLab: 1. Do your tax-deferred 401k,403b,IRA saving in a high earning job, state, then move to a low or no income tax state to do the withdrawals in retirement. 2. Retire early so there is some time before taking social security payments to do Roth Conversions. I-ORP[0] turns this into a branch and cut linear optimization problem. User Indyhou at Bogleheads[1] has built a spreadsheet that uses a solver plugin. It may be possible to build a model in CBC[2] and compile it to WASM and run it in the browser. 3. After turning 63, watch the Roth Conversions to make sure you don't trigger IRRMA medicare surcharges. 4. Are you trying to stay under income

Read the rest

limits for ACA subsidies? It's not quite the sharp cliff that it was, but can be important for some. 5. Are you trying to balance regular income and capital gains to take advantage of the 0% cap gains rates? You've got to plan ahead on your contributions to the taxable and tax deferred accounts for this to work. Jeremy at Go Curry Cracker has written about using this to pay $0 in US Federal Income taxes[3]. 6. Paying full rate for health insurance will likely get you over the 7.5% limit for tax deductions. 7. Social Security claiming strategies can be complex for married couples. A feature that would be useful during accumulation is life insurance planning for the death of a spouse. The death of a spouse can throw a wrench in some of the strategies since the single tax bracket is much smaller. Tax law changes can also upset highly optimized strategies. So any highly optimized strategy should also have a monte carlo simulation around a spouse dying and tax law changes to understand what disruptions are possible and maybe accept a non-optimal strategy that is better in these adverse cases. [0] https://i-orp.com [1] https://www.bogleheads.org/forum/viewtopic.php?t=365518 [2] https://github.com/coin-or/Cbc [3] https://www.gocurrycracker.com/go-curry-cracker-2020-taxes/

In Show HN: I built a simulator for personal finance

fanf2·Sep 30, 2019Submission

CBC: Open-source mixed integer linear programming solver

1 points · Open discussion

wenc·Sep 29, 2019

Depends on the problem Cbc [1] is modern, free and is competitive for most non-complex problems like timetabling (say less than 100k variables). (Cbc is much better than GNU Linear Programming Kit -- GLPK -- which uses outdated algorithms and is not competitive). Cbc can also be called from Excel via OpenSolver. Scip [2] is the most performant "non-commercial" solver, but is only free for non-commercial uses. Commercial uses require licensing. As for writing MIPs, this FICO MIP formulation guide [3] is extremely well written. Modeling MIPs is something of an art, and this doc captures most of the common formulations. [1] https://github.com/coin-or/Cbc [2] https://scip.zib.de/ [3] https://www.fico.com/en/resource-download-file/3217

In Modern SAT solvers: fast, neat and underused