2006•Discrete OptimizationOpen access

Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints

Giovanni Righini, Matteo Salani

Open full text 360 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 360 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Vehicle routing problem, Mathematical optimization, Shortest path problem, Column generation, Benchmark (surveying), K shortest path routing, Equal-cost multi-path routing, Dynamic programming

Back to paper search Browse research topics Original source

Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints — Research Paper | ScholarLens