{"id": "card_logistics_hardness", "kind": "reference", "title": "Hardness - routing is NP", "body": "The travelling salesman and vehicle routing are NP-hard; good heuristics get close - the solve path's get-close door.", "source": {"label": "Narrow Highway — logistics", "url": "", "authority_tier": "engine_derived"}, "shelf": "codex", "box": "logistics", "bands": ["logistics", "pillar", "hardness", "one map"], "subject": "Hardness - routing is NP", "connections": [{"to_card_id": "card_floor_logistics", "relationship": "part_of", "evidence": "a pillar (Hardness - routing is NP)"}, {"to_card_id": "card_floor_computer_science", "relationship": "connects_at", "evidence": "optimization and NP-hardness - the algorithms of logistics"}], "author": "engine", "created_at": 0.0, "updated_at": 0.0, "visibility": "public", "lifecycle_stage": "public", "volatility": "permanent", "surface": "secular", "generated": false, "call": "codex.logistics", "facets": {"subject": ["hardness", "one map", "pillar"]}, "presentation": {"glyph": "•", "kind_label": "logistics", "by": "Narrow Highway — logistics", "authority": "engine_derived", "posted": "", "standing": ""}, "neighbors": [{"id": "card_floor_logistics", "title": "Logistics — moving things at least cost", "relationship": "part of", "why": "a pillar (Hardness - routing is NP)", "href": "/card/card_floor_logistics", "resolved": true}, {"id": "card_floor_computer_science", "title": "Computer science — bits, logic, and what can be computed", "relationship": "connects at", "why": "optimization and NP-hardness - the algorithms of logistics", "href": "/card/card_floor_computer_science", "resolved": true}], "house": {"door": "FIND", "kind": "card", "trail": "connections", "seal": "/card/card_logistics_hardness", "next_step": {"do": "follow a connection: what this card rests on, and what rests on it", "door": "FIND", "tool": "card_connections", "params": {"id": "card_logistics_hardness"}}, "ends": "a verdict or a card · the trail · a seal · one next step"}}