Solving the -shortest path problem with time windows in a time varying network

Konstantinos N. Androutsopoulos; Konstantinos G. Zografos

doi:10.1016/j.orl.2008.07.003

ScienceGate Book Chapters

JOURNAL ARTICLE

Solving the -shortest path problem with time windows in a time varying network

Konstantinos N. Androutsopoulos Konstantinos G. Zografos

Year: 2008 Journal: Operations Research Letters Vol: 36 (6)Pages: 692-695 Publisher: Elsevier BV

DOI: 10.1016/j.orl.2008.07.003

Get Full-Text PDF Get Analytical Report

Keywords:

Shortest path problem Path (computing) Computer science Time complexity Mathematical optimization Mathematics Algorithm Theoretical computer science Graph Computer network

Metrics

Cited By

0.67

FWCI (Field Weighted Citation Impact)

Refs

0.70

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Data Management and Algorithms

Physical Sciences → Computer Science → Signal Processing

Transportation Planning and Optimization

Social Sciences → Social Sciences → Transportation

Vehicle Routing Optimization Methods

Physical Sciences → Engineering → Industrial and Manufacturing Engineering

Solving the -shortest path problem with time windows in a time varying network

Metrics

Citation History

Topics

Related Documents

A wave time-varying neural network for solving the time-varying shortest path problem

Shortest path tour problem with time windows

A SHORTEST PATH PROBLEM ON THE NETWORK WITH AGV-TYPE TIME-WINDOWS

A generalized shortest path tour problem with time windows

A time-delay neural network for solving time-dependent shortest path problem