Branch-and-price-and-cut for the active-passive vehicle-routing problem

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Transportation science
1. Verfasser: Tilk, Christian (VerfasserIn)
Weitere Verfasser: Bianchessi, Nicola (VerfasserIn), Drexl, Michael (VerfasserIn), Irnich, Stefan (VerfasserIn), Meisel, Frank (VerfasserIn)
Format: UnknownFormat
Sprache:eng
Veröffentlicht: March-April 2018
Schlagworte:
vehicle-routing > synchronization > branch-and-price > linear vertex costs > Aufsatz in Zeitschrift
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Titel Jahr Verfasser
Editorial statement 2021 Smilowitz, Karen
Interval-based dynamic discretization discovery for solving the continuous-time service network design problem 2021 Marshall, Luke
Exact and heuristic algorithms for the carrier-vehicle traveling salesman problem 2021 Erdoğan, Güneş
Branch-and-cut and iterated local search for the weighted k-traveling repairman problem : an application to the maintenance of speed cameras 2021 Muritiba, Albert Einstein Fernandes
A stochastic programming approach for locating and dispatching two types of ambulances 2021 Yoon, Soovin
Credit-based mobility management considering travelers' budgeting behaviors under uncertainty 2021 Lin, Xi
Exact methods for the traveling salesman problem with drone 2021 Roberti, Roberto
A link queue model of network traffic flow 2021 Jin, Wen-Long
Multiclass traffic flow dynamics : an endogenous model 2021 Yuan, Kai
System dynamics in the predictive analytics of container freight rates 2021 Jeon, Jun-Woo
The competitive pickup and delivery orienteering problem for balancing car-sharing systems 2021 Martin, Layla
Equilibrium analysis of urban traffic networks with ride-sourcing services 2021 Xu, Zhengtian
The single-line design problem for demand-adaptive transit systems : a modeling framework and decomposition approach for the stationary-demand case 2021 Errico, Fausto
Hub location, routing, and route dimensioning : strategic and tactical intermodal transportation hub network design 2021 Yıldız, Bariş
Scheduling tugboats in a seaport 2021 Jia, Shuai
An exact algorithm for heterogeneous drone-truck routing problem 2021 Kang, Munjeong
A new algorithm for the single source weber problem with limited distances 2021 Righini, Giovanni
Optimizing disruption tolerance for rail transit networks under uncertainty 2021 Xu, Lei
Fast calibration of car-following models to trajectory data using the adjoint method 2021 Keane, Ronan
Workforce scheduling with order-picking assignments in distribution facilities 2021 Rijal, Arpan
Alle Artikel auflisten