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...
Main Authors: | Thais Ávila, Ángel Corberán, Isaac Plana, José M. Sanchis |
---|---|
Format: | Article |
Language: | English |
Published: |
Elsevier
2017-09-01
|
Series: | EURO Journal on Computational Optimization |
Subjects: | |
Online Access: | http://www.sciencedirect.com/science/article/pii/S2192440621000848 |
Similar Items
-
An exact approach for the multi-constraint graph partitioning problem
by: Diego Recalde, et al.
Published: (2020-10-01) -
Improved integral simplex using decomposition for the set partitioning problem
by: Abdelouahab Zaghrouti, et al.
Published: (2018-06-01) -
Formulations and algorithms for the recoverable Γ-robust knapsack problem
by: Christina Büsing, et al.
Published: (2019-03-01) -
An efficient mathematical model for solving one-dimensional cutting stock problem using sustainable trim
by: Ravi Vishwakarma, et al.
Published: (2021-11-01) -
A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints
by: C. Gentile, et al.
Published: (2017-03-01)