- Published on
From LP to IP: why integrality matters, the combinatorial explosion, LP relaxations, and why rounding fails.
Integer-programming
Alle Beiträge
- english (28)
- graph-theory (17)
- optimization (11)
- operations-research (10)
- or (10)
- deutsch (9)
- network-flows (7)
integer-programming (4)
- latex (4)
- linear-programming (3)
- tsp (3)
- paper-talk (2)
- branch-and-bound (1)
- cutting-planes (1)
- branch-and-cut (1)
- simplex (1)
- duality (1)
- heuristics (1)
- metaheuristics (1)
- tool (1)
- tools (1)
- markdown (1)
- graphs (1)
- openstreetmap (1)
- chrome-extension (1)
- networkx (1)
- tikz (1)
- scheduling (1)
- astronomie (1)
- machine-learning (1)
- elliptic-curve (1)
- data-science (1)
- regex (1)
- snomed (1)
- snowstorm (1)
- docker (1)
- Published on
Branch and bound: the workhorse algorithm for integer programming, explained with a complete example showing all three pruning types.- Published on
Cutting planes: tightening LP relaxations by slicing off fractional solutions, with Gomory cuts and cover inequalities.- Published on
Branch-and-cut and how modern IP solvers work: combining branch and bound with cutting planes, presolve, heuristics, and parallelism.