CAPITAL EFFICIENCY / 001
NetGraph home/Thesis/How it works
HOW IT WORKS / 3 MIN READ

Three companies. Fewer payments.

Imagine three businesses all owing money to one another. Before moving any cash, add up what each business should receive and what it should pay. Only the difference needs to move.

Try the numbers ↓
01

Write down the promises.

A owes B, B owes C, and C owes A. Adding those promises gives gross settlement: the amount that would move if every invoice were paid separately.

02

Find the net position.

For each company, subtract money owed from money due in. A negative result means it pays; a positive result means it receives. The three results always add to zero.

03

Send only what is still owed.

Match net payers directly to net receivers. With unrestricted routes and equal costs, the smallest amount that must move is the sum of all positive net balances.

THE SIMPLE MATH

Money moved = sum of the amounts net receivers are owed

A worked example

If A owes B $100,000, B owes C $80,000, and C owes A $60,000, the original payments total $240,000. A ends up owing $40,000, while B and C each receive $20,000. Just $40,000 moves; $200,000 of movement disappears.

YOUR TURN / INTERACTIVE EXAMPLE

Watch the payments cancel out

Move a slider or choose a scenario. The numbers update immediately.

Less money moves. Everyone ends with the same net balance.

What this example assumes

This demo assumes every company can pay every other company, with unlimited route capacity, equal costs, one currency and no fees. The research model adds route costs, liquidity caps, eligibility and deadlines. Reduced payment volume is not profit.

The research formula, for the curious
THE MATHEMATICAL FOUNDATION

Every dollar has a better route.

minₓ Σₑ cₑxₑ

Ax = b · 0 ≤ xₑ ≤ Capₑ

b
Net obligation per counterparty
x
Settlement flow along a route
c
Cost per settlement route
Cap
Liquidity and counterparty limits

The interactive example isolates the core idea. Its assumptions are described above; it does not implement every part of the research model.

Further reading: OR-Tools: minimum-cost flow ↗