Network reduction for the acyclic constrained shortest path problem

DOI10.1016/0377-2217(92)90060-MzbMath0764.90085OpenAlexW2022506245MaRDI QIDQ1206607

Mohsen M. D. Hassan

Publication date: 1 April 1993

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(92)90060-m

zbMATH Keywords

transportationshortest pathacyclic digraph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (1)

A computer-aided process planning model based on genetic algorithms

Cites Work

• A note on two problems in connexion with graphs
• On a multicriteria shortest path problem
• Solving k-shortest and constrained shortest path problems efficiently
• The shortest path problem with two objective functions
• A bicriterion shortest path algorithm
• Improved convexity cuts for lattice point problems
• The shortest route problem with constraints
• Shortest-path algorithms: Taxonomy and annotation
• Note on Multiple Objective Dynamic Programming
• Computational experience with an algorithm for finding the k shortest paths in a network
• The constrained shortest path problem

This page was built for publication: Network reduction for the acyclic constrained shortest path problem