Subgraph Atlas · centered on entity

Pickup and Delivery Problem

research topic1 mentions· velocity: stable

The vehicle routing problem (VRP) is a combinatorial optimization and integer programming problem which asks "What is the optimal set of routes for a fleet of vehicles to traverse in order to deliver to a given set of customers?" The problem first appeared, as the truck dispatching problem, in a pap

Two-hop subgraph: this entity, every entity it directly relates to, and every entity those neighbors relate to. Drag a node, scroll to zoom, click to inspect — or click any neighbor and re-center the atlas there.

0 nodes · 0 edges · loading…

companypersonai_modelproductresearch_labbenchmarkframework

drag to move · scroll to zoom · click a node

Top connections

CAADRLproduct

1 mentions

→ Center atlas here

How to read this: the white-ringed node is Pickup and Delivery Problem. Surrounding nodes are direct relationships; the second ring is what those neighbors connect to. Edge thickness scales with source-article evidence. Click any node and choose Center graph here to walk the graph.