Multi-dimensional labelling approaches to solve the linear fractional elementary shortest path problem with time windows

DOI10.1080/10556780903483364zbMath1226.90123OpenAlexW2023908757WikidataQ58921369 ScholiaQ58921369MaRDI QIDQ3093046

Luigi Di Puglia Pugliese, Francesca Guerriero

Publication date: 12 October 2011

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556780903483364

zbMATH Keywords

shortest path problemfractional objective functiontime window constraintsbi-criteria networkmultiple labelling approaches

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Fractional programming (90C32)

Related Items (3)

The cross-entropy method for solving bi-criteria network flow problems in discrete-time dynamic networks ⋮ On the shortest path problem with negative cost cycles ⋮ An approximation algorithm for the longest path problem in solid grid graphs

This page was built for publication: Multi-dimensional labelling approaches to solve the linear fractional elementary shortest path problem with time windows