Non-additive shortest paths

DOI10.1007/978-3-540-30140-0_72MaRDI QIDQ5464640zbMATH OpenOpenAlexFDO

Authors George Tsaggouris, Christos Zaroliagis

Publication date 18 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b100428

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Non-additive shortest path in the context of traffic assignment
• Multi-objective and multi-constrained non-additive shortest path problems
• Routing with nonlinear multiattribute cost functions
• A Tchebycheff metric approach to the optimal path problem with nonlinear multiattribute cost functions
• scientific article; zbMATH DE number 1062626

Cited in

(8)

• A universal concept for robust solving of shortest path problems in dynamically reconfigurable graphs
• Non-additive shortest path in the context of traffic assignment
• A self-adaptive gradient projection algorithm for the nonadditive traffic equilibrium problem
• Decision-making based on approximate and smoothed Pareto curves
• Algorithms for non-linear and stochastic resource constrained shortest path
• Accelerating the gradient projection algorithm for solving the non-additive traffic equilibrium problem with the Barzilai-Borwein step size
• Shortest Paths with Bundles and Non-additive Weights Is Hard
• Multi-objective and multi-constrained non-additive shortest path problems

This page was built for publication: Non-additive shortest paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5464640)