<script type="text/javascript">
<!--
document.write('<div id="oa_widget"></div>');
document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=undefined&type=result"></script>');
-->
</script>

COPY SCRIPT

For further information contact us at helpdesk@openaire.eu

Reoptimization procedures in shortest path problem

Name: Reoptimization procedures in shortest path problem
Creator: Giorgio Gallo
Keywords: algorithm, Dial's label-setting algorithm, 05 social sciences, 0211 other engineering and technologies, shortest-path problem, Integer programming, 02 engineering and technology, Programming involving graphs or networks, Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.), numerical efficiency

Reoptimization procedures in shortest path problems

descriptionPublicationkeyboard_double_arrow_right Article 01 Mar 1980Publisher:Springer Science and Business Media LLCJournal:Rivista di Matematica per le Scienze Economiche e Sociali, volume 3, pages 3-13 (issn: 1593-8883, eissn: 1129-6569,

Authors: Giorgio Gallo;

doi: 10.1007/bf02092136

Reoptimization procedures in shortest path problem

- Summary
- Subjects
- Metrics

Abstract

In most algorithms for Transportation and Communication Models a sequence of Shortest Path Problems must be solved, where each problem is only slightly different from the preceding. Computational procedures are proposed to find the new shortest paths starting from the old shortest paths in two cases: i) the node from which the shortest paths are to be determined is changed; ii) the cost of one are is modified (either increased or decreased).

Keywords

algorithm, Dial's label-setting algorithm, shortest-path problem, Integer programming, Programming involving graphs or networks, Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.), numerical efficiency, Numerical mathematical programming methods, transportation networks, re-optimization, computational comparisons

Impact byBIP!

	citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	29
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average