Solving the constrained shortest path problem using random search strategy

DOI10.1007/s11431-010-4105-2zbMath1225.90145OpenAlexW2099742000MaRDI QIDQ546424

Lixing Yang, Tao Tang, Keping Li, Zi-You Gao

Publication date: 24 June 2011

Published in: Science China. Technological Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11431-010-4105-2

zbMATH Keywords

optimizationconstrained shortest pathdeterministic random walk

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20)

Cites Work

• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Deterministic walks in random environments
• Goldbug variations
• The rotor-router shape is spherical
• A Multicommodity Network-Flow Problem with Side Constraints on Paths Solved by Column Generation
• Random walk with persistence and external bias
• Shortest-path algorithms: Taxonomy and annotation
• Simulating a Random Walk with Constant Error
• An algorithm for the resource constrained shortest path problem
• A dual algorithm for the constrained shortest path problem
• Finding the k Shortest Paths
• Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem
• A Set Partitioning Approach to the Crew Scheduling Problem
• Efficient Algorithms for Solving the Shortest Covering Path Problem

This page was built for publication: Solving the constrained shortest path problem using random search strategy