Using dual feasible functions to construct fast lower bounds for routing and location problems - Archive ouverte HAL Access content directly
Journal Articles Discrete Applied Mathematics Year : 2015

Dates and versions

hal-02542682 , version 1 (14-04-2020)

Identifiers

Cite

Daniel Cosmin Porumbel, Gilles Goncalves. Using dual feasible functions to construct fast lower bounds for routing and location problems. Discrete Applied Mathematics, 2015, 196, pp.83-99. ⟨10.1016/j.dam.2014.05.017⟩. ⟨hal-02542682⟩
33 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More