Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem
The generalized directed rural postman problem is an arc routing problem with many interesting real-life applications, such as routing for meter reading. In this application, a vehicle with a receiver travels through a series of neighborhoods. If the vehicle gets closer than a certain distance to a...
Guardado en:
Autores principales: | Thais Ávila, Ángel Corberán, Isaac Plana, José M. Sanchis |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
Elsevier
2017
|
Materias: | |
Acceso en línea: | https://doaj.org/article/93c8b2370ace48008f469dc1890230c0 |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
An exact approach for the multi-constraint graph partitioning problem
por: Diego Recalde, et al.
Publicado: (2020) -
A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints
por: C. Gentile, et al.
Publicado: (2017) -
Optimal capacitated ring trees
por: Alessandro Hill, et al.
Publicado: (2016) -
The complete vertex p-center problem
por: F.Antonio Medrano
Publicado: (2020) -
Formulations and algorithms for the recoverable Γ-robust knapsack problem
por: Christina Büsing, et al.
Publicado: (2019)