A card from a free library — ask anything, no account, works offline. Every card carries its source.
Hardness - routing is NP
logistics
The travelling salesman and vehicle routing are NP-hard; good heuristics get close - the solve path's get-close door.
source
Narrow Highway — logistics
card id
card_logistics_hardness
address
WIT.codex.FCT/hardness-routing-is-np/REF.WITNESSED@narrow-highway
adjoining cards
- part of → Logistics — moving things at least cost — a pillar (Hardness - routing is NP)
- connects at → Computer science — bits, logic, and what can be computed — optimization and NP-hardness - the algorithms of logistics
Is this card incomplete? Tell the library — it will call out for more ↗