An algorithm to determine a path with minimal cost/capacity ratio

DOI10.1016/0166-218X(84)90100-8zbMath0572.90098OpenAlexW2001125358MaRDI QIDQ5902840

Ernesto Queirós Vieira Martins

Publication date: 1984

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(84)90100-8

zbMATH Keywords

computational experimentspolynomial algorithmoptimal pathspecified pair of nodes

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Numerical mathematical programming methods (65K05) Integer programming (90C10)

Related Items (7)

Paths with minimum range and ratio of arc lengths ⋮ The balanced traveling salesman problem ⋮ Constrained balanced optimization problems ⋮ Optimal paths in bi-attribute networks with fractional cost functions ⋮ Multicriteria path and tree problems: discussion on exact algorithms and applications ⋮ Ernesto de Queirós Vieira Martins (1945-2000): An appreciation by Mário S. Rosa ⋮ The quadratic balanced optimization problem

Cites Work

• On a special class of bicriterion path problems
• A bicriterion shortest path algorithm
• Shortest Path and Network Flow Algorithms
• Hyperbolic programming
• Unnamed Item

This page was built for publication: An algorithm to determine a path with minimal cost/capacity ratio