swMATH29730MaRDI QIDQ41444FDOQ41444
Author name not available (Why is that?)
Official website: https://dl.acm.org/citation.cfm?doid=367766.368168
Cited In (only showing first 100 items - show all)
- Modeling Dynamic Vehicle Navigation in a Self-Organizing, Peer-to-Peer, Distributed Traffic Information System
- A mean-variance model for the minimum cost flow problem with stochastic arc costs
- Routing with nonlinear multiattribute cost functions
- An efficient link allocation algorithm for survivable ATM-based personal communication networks
- Uniform embeddings for Robinson similarity matrices
- I/O-efficient algorithms for graphs of bounded treewidth
- Parallel nested dissection for path algebra computations
- Efficient transitive closure of sparse matrices over closed semirings
- A fast backtrack algorithm for graph isomorphism
- Algebraic structures for transitive closure
- Efficient parallel algorithms for shortest paths in planar digraphs
- Monge sequences and a simple assignment algorithm
- Extensions of dynamic programming for multi-stage combinatorial optimization
- Fast and efficient solution of path algebra problems
- Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
- Computation of shortest path in cellular automata
- \(O(1)\) query time algorithm for all pairs shortest distances on permutation graphs
- Path optimization with limited sensing ability
- Fast primal and dual heuristics for the \(p\)-median location problem
- Shortest path network problems with stochastic arc weights
- Parameterized complexity of length-bounded cuts and multicuts
- Robust critical node selection by Benders decomposition
- Generalization of algebraic multiscale to algebraic multigrid
- Uncertain vertex coloring problem
- Efficient reconstruction of metabolic pathways by bidirectional chemical search
- Experiments with parallel algorithms for combinatorial problems
- An efficient algorithm for finding ideal schedules
- Accelerating worst case execution time analysis of timed automata models with cyclic behaviour
- Low‐Rank Smoothing Splines on Complicated Domains
- Vertex fusion under distance constraints
- Dynamic programming bi-criteria combinatorial optimization
- A comparison of schedulability analysis methods using state and digraph models for the schedulability analysis of synchronous FSMs
- A new approach to regular \& indeterminate strings
- Tabu search algorithm for flexible flow path design of unidirectional automated-guided vehicle systems
- Sorting can exponentially speed up pure dynamic programming
- All shortest distances in a graph. An improvement to Dantzig's inductive algorithm
- A priority queue for the all pairs shortest path problem
- Algorithms for two-machine flow-shop sequencing with precedence constraints
- A biased-randomized discrete-event heuristic for coordinated multi-vehicle container transport across interconnected networks
- Computational analysis of a flexible assembly system design problem
- Uncertain random shortest path problem
- The Migratory Beekeeping Routing Problem: Model and an Exact Algorithm
- On negative cycles in mixed graphs
- Allowable processing orders in the accelerated cascade algorithm
- Lock-free parallel dynamic programming
- Greedy can beat pure dynamic programming
- Caper
- Efficiency improvement in an \(n\)D systems approach to polynomial optimization
- Order batching using an approximation for the distance travelled by pickers
- Automatic generation of path conditions for concurrent timed systems
- Regular algebra applied to language problems
- Special cases of the quadratic shortest path problem
- Transitive closure and related semiring properties via eliminants
- ATISMART
- The hierarchical network design problem with transshipment facilities
- Locating concentrators in centralized computer networks
- Reducing the hierarchical network design problem
- The \(p\)-hub center allocation problem
- Distributed and sequential algorithms for bioinformatics
- A reduction approach to the repeated assignment problem
- A branch-and-cut algorithm for the median-path problem
- Strong structural controllability of networks: comparison of bounds using distances and zero forcing
- Fast algorithms for the maximum convolution problem
- Solving the shortest path tour problem
- Fractal and complex network analyses of protein molecular dynamics
- Two fast algorithms for all-pairs shortest paths
- A polynomial time algorithm for finding the prime factors of Cartesian- product graphs
- A comparison of Monte Carlo tree search and rolling horizon optimization for large-scale dynamic resource allocation problems
- Crossover can provably be useful in evolutionary computation
- Personnel assignment by multiobjective programming
- The discretizable molecular distance geometry problem
- A tree search algorithm for the p-median problem
- Universal construction mechanism for networks from one-dimensional symbol sequences
- Solving the nearly symmetric all-pairs shortest-path problem
- A post-improvement procedure for the mixed load school bus routing problem
- Reachability analysis for timed automata using max-plus algebra
- A linear-time algorithm for solving the center problem on weighted cactus graphs
- A systolic array algorithm for the algebraic path problem (shortest paths; matrix inversion)
- Dijkstra, Floyd and Warshall meet Kleene
- A multi-criteria police districting problem for the efficient and effective design of patrol sector
- Solving all-pairs shortest path by single-source computations: theory and practice
- Design method using hybrid of line-type and circular-type routes for transit network system optimization
- The geodesic distance on the generalized gamma manifold for texture image retrieval
- The constrained shortest path problem with stochastic correlated link travel times
- A new monotonic, clone-independent, reversal symmetric, and condorcet-consistent single-winner election method
- An all-pairs shortest path algorithm for bipartite graphs
- Finding the shortest paths by node combination
- Periodic sets of integers
- The pickup and delivery problem with alternative locations and overlapping time windows
- Group-based collective keyword querying in road networks
- An algebraic framework for minimum spanning tree problems
- Inverse problems of demand analysis and their applications to computation of positively-homogeneous Konüs-Divisia indices and forecasting
- Enhancements to two exact algorithms for solving the vertex \(P\)-center problem
- A practical greedy approximation for the directed Steiner tree problem
- Directed Steiner trees with diffusion costs
- Polynomial algorithms to finite Veber problem for a tree network
- The impact of distance on location problems
- Distances in orientations of graphs
- An interactive approach to identify the best compromise solution for two objective shortest path problems
- A metaheuristic approach to the urban transit routing problem
This page was built for software: Algorithm 97
