Pages that link to "Item:Q1683122"
From MaRDI portal
The following pages link to Minimum spanning trees with neighborhoods: mathematical programming formulations and solution methods (Q1683122):
Displayed 11 items.
- Routing for unmanned aerial vehicles: touring dimensional sets (Q2076917) (← links)
- Minimum cost \(b\)-matching problems with neighborhoods (Q2082547) (← links)
- Solution methods for a min-max facility location problem with regional customers considering closest Euclidean distances (Q2301150) (← links)
- Ordered \(p\)-median problems with neighbourhoods (Q2419559) (← links)
- Coordinating drones with mothership vehicles: the mothership and drone routing problem with graphs (Q2669552) (← links)
- (Q5881545) (← links)
- A multiple-drone arc routing and mothership coordination problem (Q6047868) (← links)
- Facility location problems on graphs with non-convex neighborhoods (Q6047916) (← links)
- On hub location problems in geographically flexible networks (Q6071054) (← links)
- An extended model of coordination of an all‐terrain vehicle and a multivisit drone (Q6187240) (← links)
- Shortest Paths in Graphs of Convex Sets (Q6188512) (← links)