A card from a free library — ask anything, no account, works offline. Every card carries its source.
Logistics — moving things at least cost
logistics
Getting goods from here to there at least cost: shortest paths, scheduling, inventory, the travelling salesman. The optimization arithmetic is already sealed on the logistics stick; this floor places it, resting on economics (cost and scarcity), computer science (the algorithms and the NP-hardness of routing) and game theory (competition and cooperation). No new stick (tools/seed_logistics.py).
source
Narrow Highway — logistics · stick_logistics_the_optimization_core_verified_and_sealed
card id
card_floor_logistics
address
WIT.codex.EXP/logistics-moving-things-at-least-cost/REF.WITNESSED@narrow-highway
adjoining cards
- has part → Flow - shortest paths and schedules — a pillar (Flow - shortest paths and schedules)
- has part → Hardness - routing is NP — a pillar (Hardness - routing is NP)
- has part → Strategy - competition and cooperation — a pillar (Strategy - competition and cooperation)
- part of → The Floor of Discovery — one floor, and by its design the fear of God — moving things at least cost on the one map, rooted in the Floor of Discovery
Is this card incomplete? Tell the library — it will call out for more ↗