Integer and combinatorial optimization
Integer and combinatorial optimization
Randomized rounding: a technique for provably good algorithms and algorithmic proofs
Combinatorica - Theory of Computing
Flight scheduling and maintenance base planning
Management Science
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
The convex hull of two core capacitated network design problems
Mathematical Programming: Series A and B
A branch-first, cut-second approach for locomotive assignment
Management Science
Flight String Models for Aircraft Fleeting and Routing
Transportation Science
Multimodal Express Package Delivery: a Service Network Design Application
Transportation Science
Railroad Blocking: A Network Design Application
Operations Research
An Assurance Interval for the Non-Archimedean Epsilon in DEA Models
Operations Research
Scaling algorithms for multicommodity flow problems and network flow problems with side constraints
Scaling algorithms for multicommodity flow problems and network flow problems with side constraints
Large-scale transportation service network design: models, algorithms and applications
Large-scale transportation service network design: models, algorithms and applications
A simulated annealing approach for the multi-periodic rail-car fleet sizing problem
Computers and Operations Research
Hub location for time definite transportation
Computers and Operations Research
Large-Scale, Less-than-Truckload Service Network Design
Operations Research
Tabu assisted guided local search approaches for freight service network design
Information Sciences: an International Journal
A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment
Computers and Operations Research
Logistics service network design for time-critical delivery
PATAT'04 Proceedings of the 5th international conference on Practice and Theory of Automated Timetabling
| Hi-index | 0.00 |
Service network design problems arise at airlines (passenger and cargo), trucking companies, railroads, etc., wherever there is a need to determine cost minimizing routes and schedules, given constraints on resource availability and level of service. We focus on a particular service network design application, namely, the express shipment delivery problem, and we develop models and a solution technique designed specifically for large-scale express delivery problems with time windows. Using data from an express delivery company, we demonstrate that our approach can produce savings in total operating costs and provide a valuable tool for making decisions at strategic and tactical levels.