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 | Algorithmus | Algorithm |
-
An employee transporting problem
Yüceer, Ümit, (2013)
-
Liu, Tian, (2018)
-
Optimal multi-agent pickup and delivery using branch-and-cut-and-price algorithms
Lam, Edward, (2025)
- More ...
-
New benchmark instances for the capacitated vehicle routing problem
Uchoa, Eduardo, (2017)
-
Efficient elementary and restricted non-elementary route pricing
Martinelli, Rafael, (2014)
-
Improved lower bounds for the Split Delivery Vehicle Routing Problem
Moreno, Lorenza, (2010)
- More ...