|
|
System optimal routing of traffic flows with user constraints using linear programming sciencesconf.org:verolog2017:138026 |
Branch-and-Cut for the Split Delivery Vehicle Routing Problem with Time Windows sciencesconf.org:verolog2017:138778 |
The location-routing covering problem sciencesconf.org:verolog2017:138897 |
The time window assignment vehicle routing problem with time-dependent travel times sciencesconf.org:verolog2017:139459 |
The Electric Autonomous Dial-a-Ride Problem sciencesconf.org:verolog2017:140001 |
Branch-and-Price-and-Cut for the Clustered Vehicle-Routing Problem with Soft Cluster Constraints sciencesconf.org:verolog2017:140411 |
A Branch-and-cut algorithm for the Periodic Rural Postman Problem with Irregular Services on Mixed Graphs sciencesconf.org:verolog2017:140536 |
A two-commodity flow formulation for the truck and trailer routing problem sciencesconf.org:verolog2017:141231 |
A branch and price algorithm for the resource constrained vehicle routing problem sciencesconf.org:verolog2017:141273 |
An improved Branch-Cut-and-Price algorithm for heterogeneous vehicle routing problems sciencesconf.org:verolog2017:141397 |
Exact algorithms for the traveling salesman problem with time-dependent service times sciencesconf.org:verolog2017:141460 |
SAT solving for complex routing and scheduling problems sciencesconf.org:verolog2017:141468 |
Branch-and-Price Algorithm for Team Orienteering Problem with Time-Dependent Rewards sciencesconf.org:verolog2017:141537 |
Optimal charging station placement in a free-floating electric car sharing system sciencesconf.org:verolog2017:141566 |
The Multi-Depot Vehicle Routing Problem with vehicle interchanges sciencesconf.org:verolog2017:141592 |
An exact method for bi-objective vehicle routing problems sciencesconf.org:verolog2017:141756 |
The Split Delivery Vehicle Routing Problem with Time Windows and Customer Inconvenience Constraints sciencesconf.org:verolog2017:141763 |
The Pickup and Delivery Problem with time windows, split loads and transshipment - A branch-and-cut solution method sciencesconf.org:verolog2017:141788 |
A Benders Decomposition Approach for Solving the Electric Vehicle Routing Problem with Soft Time Windows sciencesconf.org:verolog2017:141841 |
New path elimination constraints for multi-depot routing problems sciencesconf.org:verolog2017:141853 |
The vehicle routing problem with time windows and a fragility constraint sciencesconf.org:verolog2017:141894 |
Two-phase hybrid algorithm for the vehicle routing problem with scarce, reusable resources sciencesconf.org:verolog2017:141904 |
A heuristic approach for the vehicle routing problem with scarce, reusable resources sciencesconf.org:verolog2017:141905 |
The Traveling Purchaser Problem with time-dependent quantities sciencesconf.org:verolog2017:144459 |
Exact solution of vehicle routing problems with multigraphs or road-network-type graphs sciencesconf.org:verolog2017:144480 |
On asymmetric multi-depot multiple traveling salesmen problem sciencesconf.org:verolog2017:144486 |
A new mixed integer programming formulation for the vehicle routing problem with drones sciencesconf.org:verolog2017:144566 |
Rail-rail containers transshipment: solution via mathematical programming sciencesconf.org:verolog2017:144592 |
Multi-criteria tourist trip planning sciencesconf.org:verolog2017:144615 |
The capacitated routing problem with profits and service level requirements sciencesconf.org:verolog2017:155110 |
Online user: 1 | RSS Feed |