Limited memory rank-1 cuts for vehicle routing problems
Year of publication: |
May 2017
|
---|---|
Authors: | Pecin, Diego ; Pessoa, Artur ; Poggi, Marcus ; Uchoa, Eduardo ; Santos, Haroldo Gambini |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 45.2017, 3, p. 206-209
|
Subject: | Set Partitioning | Polyhedral combinatorics | Branch-cut-and-price algorithms | Tourenplanung | Vehicle routing problem | Theorie | Theory | Mathematik | Mathematics | Mathematische Optimierung | Mathematical programming |
-
Mathematical programming guides air-ambulance routing at Ornge
Carnes, Timothy A., (2013)
-
An improved formulation for the maximum coverage patrol routing problem
Çapar, İbrahim, (2015)
-
Two-phase branch-and-cut for the mixed capacitated general routing problem
Irnich, Stefan, (2015)
- More ...
-
New benchmark instances for the capacitated vehicle routing problem
Uchoa, Eduardo, (2017)
-
Efficient elementary and restricted non-elementary route pricing
Martinelli, Rafael, (2014)
-
Efficient elementary and restricted non-elementary route pricing
Martinelli, Rafael, (2014)
- More ...