| Optimization approaches for civil applications of unmanned aerial vehicles (UAVs) or aerial drones: A survey |
63 |
| Same-day delivery with heterogeneous fleets of drones and vehicles |
21 |
| Dynamic programming approaches for the traveling salesman problem with drone |
21 |
| Drone delivery from trucks: Drone scheduling for given truck routes |
13 |
| An iterative two-step heuristic for the parallel drone scheduling traveling salesman problem |
10 |
| Virtual function placement for service chaining with partial orders and anti-affinity rules |
7 |
| An empirical validation and data-driven extension of continuum approximation approaches for urban route distances |
6 |
| The cost of incentive compatibility in auction-based mechanisms for carrier collaboration |
6 |
| Drone arc routing problems |
5 |
| Decomposable robust two-stage optimization: An application to gas network operations under uncertainty |
5 |
| A branch-and-bound algorithm for the time-dependent travelling salesman problem |
4 |
| Vehicle routing problems with road-network information: State of the art |
4 |
| Network design with probabilistic capacities |
4 |
| Solving the bifurcated and nonbifurcated robust network loading problem with k-adaptive routing |
4 |
| Optimal wind farm cable routing: Modeling branches and offshore transformer modules |
4 |
| On maximum degree-based -quasi-clique problem: Complexity and exact approaches |
4 |
| Algorithmic results for potential-based flows: Easy and hard cases |
4 |
| The most reliable flight itinerary problem |
4 |
| Detecting critical node structures on graphs: A mathematical programming approach |
3 |
| Impact of congestion pricing schemes on costs and emissions of commercial fleets in urban areas |
3 |
| An adjustable sample average approximation algorithm for the stochastic production-inventory-routing problem |
3 |
| Polyhedral results, branch-and-cut and Lagrangian relaxation algorithms for the adjacent only quadratic minimum spanning tree problem |
3 |
| Combining and projecting flow models for the (precedence constrained) asymmetric traveling salesman problem |
3 |
| An exact bidirectional A(⋆) approach for solving resource-constrained shortest path problems |
3 |
| A flow-first route-next heuristic for liner shipping network design |
3 |
| Heuristics for the strong generalized minimum label spanning tree problem |
2 |
| Some properties of transportation network cooperative games |
2 |
| An adaptive large neighborhood search with path relinking for a class of vehicle-routing problems with simultaneous pickup and delivery |
2 |
| A two-phase Pareto local search heuristic for the bi-objective pollution-routing problem |
2 |
| Optimizing ground station networks for free space optical communications: Maximizing the data transfer |
2 |
| An exact method for a class of robust shortest path problems with scenarios |
2 |
| Safe sets, network majority on weighted trees |
2 |
| Multi-budgeted matching problems |
2 |
| Towards simulation based mixed-integer optimization with differential equations |
2 |
| A branch-and-price algorithm for the vehicle routing problem with time windows on a road network |
2 |
| A note on scheduling container storage operations of two non-passing stacking cranes |
2 |
| Probabilistic N-k failure-identification for power systems |
2 |
| Stochastic network interdiction with incomplete preference |
2 |
| Anticipation versus reactive reoptimization for dynamic vehicle routing with stochastic requests |
2 |
| Inverse optimization in minimum cost flow problems on countably infinite networks |
2 |
| Complexity of edge coloring with minimum reload/changeover costs |
2 |
| Deterministic gathering with crash faults |
2 |
| On uniformly most reliable two-terminal graphs |
2 |
| Algorithms for node-weighted Steiner tree and maximum-weight connected subgraph |
2 |
| Integer programming formulations for minimum deficiency interval coloring |
1 |
| Lifting and separation of robust cover inequalities |
1 |
| The forwarder planning problem in a two-echelon network |
1 |
| A new algorithm for the shortest-path problem |
1 |
| Max flow vitality in general and st-planar graphs |
1 |
| A decomposition approach to solve the selective graph coloring problem in some perfect graph families |
1 |
