Shipping problems with body clock constraints.
From MaRDI portal
Publication:1423446
DOI10.1016/S0305-0548(02)00054-0zbMath1105.90333MaRDI QIDQ1423446
Publication date: 14 February 2004
Published in: Computers \& Operations Research (Search for Journal in Brave)
Applications of mathematical programming (90C90) Deterministic network models in operations research (90B10) Case-oriented studies in operations research (90B90)
Related Items (1)
Cites Work
- A reoptimization algorithm for the shortest path problem with time windows
- The pickup and delivery problem with time windows
- Critical path in an activity network with time constraints
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem
- Vehicle Routing with Time Windows
- Lagrangian Relaxation Methods for Solving the Minimum Fleet Size Multiple Traveling Salesman Problem with Time Windows
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints
- An Optimization Algorithm for the Vehicle Routing Problem with Time Windows Based on Lagrangian Relaxation
- An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
- Fibonacci heaps and their uses in improved network optimization algorithms
- Simple Heuristics for the Vehicle Routeing Problem with Soft Time Windows
- Probabilistic Analyses and Practical Algorithms for the Vehicle Routing Problem with Time Windows
This page was built for publication: Shipping problems with body clock constraints.