Multi-criteria approximation schemes for the resource constrained shortest path problem

DOI10.1007/s11590-017-1212-zzbMath1400.90290OpenAlexW2766862316MaRDI QIDQ1749776

Markó Horváth, Tamás Kis

Publication date: 28 May 2018

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: http://eprints.sztaki.hu/9512/

zbMATH Keywords

resource constrained shortest pathmulti-budgeted combinatorial optimizationmulti-criteria approximation algorithms

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (5)

Analyzing the reachability problem in choice networks ⋮ Approximation Methods for Multiobjective Optimization Problems: A Survey ⋮ Reachability in choice networks ⋮ A bi-criteria optimization model for medical device sterilization ⋮ One-exact approximate Pareto sets

Cites Work

• Unnamed Item
• New approaches to multi-objective optimization
• A survey on multi-constrained optimal path computation: exact and approximate algorithms
• On the hardness of approximating minimum vertex cover
• An improved FPTAS for Restricted Shortest Path.
• Approximation Schemes for the Restricted Shortest Path Problem
• A simple efficient approximation scheme for the restricted shortest path problem

This page was built for publication: Multi-criteria approximation schemes for the resource constrained shortest path problem