On the greedy walk problem
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 964350 (Why is no real title available?)
- scientific article; zbMATH DE number 3193293 (Why is no real title available?)
- A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane
- An Analysis of Several Heuristics for the Traveling Salesman Problem
- Cost of sequential connection for points in space
- On the Stability of Greedy Polling Systems with General Service Policies
- Polling and greedy servers on a line
- Probability theory of classical Euclidean optimization problems
- Stability and performance of greedy server systems
- Stability of polling networks with state-dependent server routing
- Stability of polling systems with exhaustive service policies and state-dependent routing
Cited in
(11)- A Theory for Backtrack-Downweighted Walks
- THE NEAREST UNVISITED VERTEX WALK ON RANDOM GRAPHS
- scientific article; zbMATH DE number 1472156 (Why is no real title available?)
- The greedy walk on an inhomogeneous Poisson process
- Greedy clearing of persistent Poissonian dust
- On the complexity of the Eulerian closed walk with precedence path constraints problem
- On the complexity of the Eulerian closed walk with precedence path constraints problem
- Two queues with non-stochastic arrivals
- Greedy walk on the real line
- On the difficulty of finding walks of length k
- The critical greedy server on the integers is recurrent
This page was built for publication: On the greedy walk problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q383202)
