Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
On path ranking in time-dependent graphs - MaRDI portal

On path ranking in time-dependent graphs (Q2669544)

From MaRDI portal

Jump to:navigation, search

This is the item page for this Wikibase entity, intended for internal use and editing purposes.

Please use this page instead for the normal view: On path ranking in time-dependent graphs

scientific article; zbMATH DE number 7486247

Language	Label	Description	Also known as
English	On path ranking in time-dependent graphs	scientific article; zbMATH DE number 7486247

Statements

scholarly article

0 references

On path ranking in time-dependent graphs (English)

0 references

0 references

Gianpaolo Ghiani

0 references

Emanuela Guerriero

0 references

Computers \& Operations Research

0 references

publication date

9 March 2022

0 references

full work available at URL

https://arxiv.org/abs/2009.07588

0 references

zbMATH Keywords

time-dependent routing

0 references

path ranking invariance

0 references

describes a project that uses

0 references

MaRDI profile type

0 references

An enhanced lower bound for the time-dependent travelling salesman problem

0 references

An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation

0 references

Computational Complexity

0 references

A branch-and-cut algorithm for the profitable windy rural postman problem

0 references

A branch-and-bound algorithm for the time-dependent rural postman problem

0 references

Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem

0 references

Technical Note—An <i>n</i>-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem

0 references

Time-dependent routing problems: a review

0 references

Natural and extended formulations for the time-dependent traveling salesman problem

0 references

A classification of formulations for the (time-dependent) traveling salesman problem

0 references

The moving-target traveling salesman problem

0 references

Vehicle dispatching with time-dependent travel times

0 references

The next wave in computing, optimization, and decision technologies. Papers from the ninth INFORMS Computing Society conference (ICS 2005), Annapolis, MD, USA, January 5--7, 2005.

0 references

Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms

0 references

A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem

0 references

A Time-Dependent No-Overlap Constraint: Application to Urban Delivery Problems

0 references

An integer programming approach for the time-dependent TSP

0 references

An integer programming approach for the time-dependent traveling salesman problem with time windows

0 references

The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling

0 references

The time-dependent traveling salesman problem

0 references

A branch-and-cut algorithm for a production scheduling problem with sequence-dependent and time-dependent setup times

0 references

An integer programming approach for the Chinese postman problem with time-dependent travel time

0 references

An Integer Programming Approach for the Rural Postman Problem with Time Dependent Travel Times

0 references

Vehicle Routing

0 references

0 references

Identifiers

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

10.1016/J.COR.2021.105446

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2669544

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2669544&oldid=42191127"