- Published on
Aspects of OR - Integer Programming (Part 1)
From LP to IP: why integrality matters, the combinatorial explosion, LP relaxations, and why rounding fails.
Optimization
Alle Beiträge
- english (28)
- graph-theory (17)
- deutsch (17)
- operations-research (11)
optimization (11)
- or (10)
- network-flows (7)
- llm (5)
- integer-programming (4)
- latex (4)
- linear-programming (3)
- tsp (3)
- ki (3)
- paper-talk (3)
- simplex (2)
- machine-learning (2)
- rag (2)
- architektur (2)
- embeddings (2)
- vektorsuche (2)
- regex (2)
- branch-and-bound (1)
- cutting-planes (1)
- branch-and-cut (1)
- duality (1)
- heuristics (1)
- metaheuristics (1)
- tool (1)
- tools (1)
- optimierung (1)
- mathematik (1)
- lineare-programmierung (1)
- softwarearchitektur (1)
- infrastruktur (1)
- markdown (1)
- graphs (1)
- openstreetmap (1)
- chrome-extension (1)
- networkx (1)
- tikz (1)
- scheduling (1)
- astronomie (1)
- graphentheorie (1)
- beweis (1)
- elliptic-curve (1)
- data-science (1)
- theoretische-informatik (1)
- automaten (1)
- formale-sprachen (1)
- programmierung (1)
- snomed (1)
- snowstorm (1)
- docker (1)
- vektordatenbanken (1)
- Published on
Aspects of OR - Integer Programming (Part 2)
Branch and bound: the workhorse algorithm for integer programming, explained with a complete example showing all three pruning types.- Published on
Aspects of OR - Integer Programming (Part 3)
Cutting planes: tightening LP relaxations by slicing off fractional solutions, with Gomory cuts and cover inequalities.- Published on
Aspects of OR - Integer Programming (Part 4)
Branch-and-cut and how modern IP solvers work: combining branch and bound with cutting planes, presolve, heuristics, and parallelism.- Published on
Aspects of OR - Linear Programming (Part 1)
An introduction to linear programming: definitions, standard form, geometric intuition, and practical examples.- Published on
Aspects of OR - Linear Programming (Part 2)
The simplex method explained: slack variables, tableaux, pivoting, degeneracy, and a complete worked example.- Published on
Aspects of OR - Linear Programming (Part 3)
Duality in linear programming: the dual problem, strong duality, complementary slackness, shadow prices, and sensitivity analysis.- Published on
Aspects of OR - Traveling Salesperson Problem - Heuristics (Part 2)
Construction and improvement heuristics for the TSP: nearest neighbor, greedy, 2-opt, 3-opt, and Or-opt.- Published on
Aspects of OR - Traveling Salesperson Problem - Metaheuristics (Part 3)
Metaheuristics for the TSP: simulated annealing, genetic algorithms, and ant colony optimization.- Published on
- Published on
Aspects of OR - Traveling Salesperson Problem (TSP)
A brief introduction to the Traveling Salesperson Problem (TSP)