Complexity of vehicle routing and scheduling problems | 1981/06/01 | English | 524 |
A generalized assignment heuristic for vehicle routing | 1981/06/01 | English | 488 |
A survey of gossiping and broadcasting in communication networks | 1988/12/01 | English | 440 |
Optimization approaches for civil applications of unmanned aerial vehicles (UAVs) or aerial drones: A survey | 2018/03/25 | English | 436 |
An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems | 2004/08/12 | English | 367 |
Total domination in graphs | 1980/09/01 | English | 299 |
Shortest‐path network interdiction | 2002/08/05 | English | 293 |
Conditional connectivity | 1983/09/01 | English | 291 |
Steiner problem in networks: A survey | 1987/01/01 | English | 277 |
On the Computational Complexity of Combinatorial Problems | 1975/01/01 | English | 265 |
Capacitated arc routing problems | 1981/09/01 | English | 263 |
A quick method for finding shortest pairs of disjoint paths | 1984/06/01 | English | 254 |
Parallel iterative search methods for vehicle routing problems | 1993/12/01 | English | 251 |
The prize collecting traveling salesman problem | 1989/10/01 | English | 245 |
Networks and vehicle routing for municipal waste collection | 1974/01/01 | English | 242 |
Disjoint paths in a network | 1974/01/01 | English | 241 |
The steiner problem in graphs | 1971/01/01 | English | 240 |
The flow deviation method: An approach to store‐and‐forward communication network design | 1973/01/01 | English | 236 |
Steiner tree problems | 1992/01/01 | English | 236 |
A dual algorithm for the constrained shortest path problem | 1980/12/01 | English | 231 |
On reliability evaluation of a capacitated‐flow network in terms of minimal pathsets | 1995/05/01 | English | 226 |
Towards a theory of domination in graphs | 1977/09/01 | English | 224 |
Independence properties of directed markov fields | 1990/08/01 | English | 206 |
Networks synthesis and optimum network design problems: Models, solution methods and applications | 1989/05/01 | English | 204 |
On cost allocation for a spanning tree: A game theoretic approach | 1976/01/01 | English | 195 |
An algorithm for the equilibrium assignment problem with random link times | 1982/06/01 | English | 192 |
SNDlib 1.0—Survivable Network Design Library | 2009/10/19 | English | 190 |
Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows | 2007/03/07 | English | 190 |
The complexity of the network design problem | 1978/12/01 | English | 186 |
Dynamic vehicle routing problems: Three decades and counting | 2015/08/17 | English | 185 |