|
|
Stronger bounds for the asymmetric traveling salesman problem sciencesconf.org:verolog2019:238394 |
A Periodic Multi-Vehicle Arc Routing Problem sciencesconf.org:verolog2019:247827 |
Branch-cut-and-price algorithms for the vehicle routing problem with backhauls sciencesconf.org:verolog2019:248180 |
A Branch-and-Price Algorithm for a Vehicle Routing-allocation Problem sciencesconf.org:verolog2019:248203 |
Drone and truck deliveries: solving the parallel drone scheduling traveling salesman problem sciencesconf.org:verolog2019:248444 |
A Branch and-Cut Algorithm for the Distance Constrained Close-Enough Arc Routing Problem sciencesconf.org:verolog2019:248456 |
A Branch-and-Cut-and-Price algorithm for the Two-Echelon Capacitated Vehicle Routing Problem sciencesconf.org:verolog2019:248596 |
Dynamic Time Window Reassignment sciencesconf.org:verolog2019:248816 |
Improved branch-and-cut algorithm for the inventory routing problem sciencesconf.org:verolog2019:249172 |
A Branch-and-Check Approach for a Tourist Trip Design Problem with Rich Constraints sciencesconf.org:verolog2019:249220 |
The Multi-period Multi-trip Containers Drayage Problem with Due and Release Dates sciencesconf.org:verolog2019:249377 |
Exact formulation for the dial a ride problem with transfers sciencesconf.org:verolog2019:249400 |
TSP with one truck and one or multiple drones sciencesconf.org:verolog2019:249648 |
Decomposition approach for the distributionally robust vehicle routing problem with time window assignments sciencesconf.org:verolog2019:249898 |
An exact algorithm for the agile earth observation satellite scheduling with time-dependent profits sciencesconf.org:verolog2019:249943 |
Valid Inequalities and a Branch-and-Cut Algorithm for multi-depot vehicle routing problems sciencesconf.org:verolog2019:250473 |
Exact solution methods for the multi-period vehicle routing problem with due dates sciencesconf.org:verolog2019:251703 |
The Urban Transit Network Design Problem sciencesconf.org:verolog2019:252535 |
Online user: 1 | RSS Feed |