Algorithm 97

swMATH29730MaRDI QIDQ41444FDOQ41444

Author name not available (Why is that?)

Cited In (only showing first 100 items - show all)

• Reducing the hierarchical network design problem
• The \(p\)-hub center allocation problem
• Modeling Dynamic Vehicle Navigation in a Self-Organizing, Peer-to-Peer, Distributed Traffic Information System
• Routing with nonlinear multiattribute cost functions
• Distributed and sequential algorithms for bioinformatics
• A reduction approach to the repeated assignment problem
• Uniform embeddings for Robinson similarity matrices
• I/O-efficient algorithms for graphs of bounded treewidth
• Strong structural controllability of networks: comparison of bounds using distances and zero forcing
• Fast algorithms for the maximum convolution problem
• Two fast algorithms for all-pairs shortest paths
• Algebraic structures for transitive closure
• Monge sequences and a simple assignment algorithm
• Fast and efficient solution of path algebra problems
• A tree search algorithm for the p-median problem
• Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
• Universal construction mechanism for networks from one-dimensional symbol sequences
• 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
• Robust critical node selection by Benders decomposition
• Generalization of algebraic multiscale to algebraic multigrid
• A systolic array algorithm for the algebraic path problem (shortest paths; matrix inversion)
• On the Optimal Control of Boolean Control Networks
• Design method using hybrid of line-type and circular-type routes for transit network system optimization
• An all-pairs shortest path algorithm for bipartite graphs
• Approximation Limitations of Pure Dynamic Programming
• An efficient algorithm for finding ideal schedules
• Low‐Rank Smoothing Splines on Complicated Domains
• Dynamic programming bi-criteria combinatorial optimization
• A comparison of schedulability analysis methods using state and digraph models for the schedulability analysis of synchronous FSMs
• The impact of distance on location problems
• A new approach to regular \& indeterminate strings
• Tabu search algorithm for flexible flow path design of unidirectional automated-guided vehicle systems
• Computing periodic request functions to speed-up the analysis of non-cyclic task models
• Sorting can exponentially speed up pure dynamic programming
• All shortest distances in a graph. An improvement to Dantzig's inductive algorithm
• Processing time-dependent shortest path queries without pre-computed speed information on road networks
• The equivalence of two ways of computing distances from dissimilarities for arbitrary sets of stimuli
• Bounded budget betweenness centrality game for strategic network formations
• A priority queue for the all pairs shortest path problem
• Algorithms for two-machine flow-shop sequencing with precedence constraints
• Shortest paths in networks with vector weights
• Finding minimum and maximum termination time of timed automata models with cyclic behaviour
• Computing maximal weak and other bisimulations
• The cache-oblivious Gaussian elimination paradigm: Theoretical framework, parallelization and Experimental evaluation
• Uncertain random shortest path problem
• A note on the location of an obnoxious facility on a network
• Lock-free parallel dynamic programming
• Greedy can beat pure dynamic programming
• Caper
• Regular algebra applied to language problems
• Special cases of the quadratic shortest path problem
• Transitive closure and related semiring properties via eliminants
• Pareto optimal solutions providing optimal routes between every two different nodes in the cost-time trade-off routing network without the objectives being prioritized
• On distribution function of the diameter in uncertain graph
• Memory efficient algorithms for cactus graphs and block graphs
• Large-scale network analysis with applications to transportation, communication and inference networks
• A cutting plane method for solving harvest scheduling models with area restrictions
• Semiparametric regression during 2003--2007
• Approximate matching between a context-free grammar and a finite-state automaton
• Fast algorithms for the undirected negative cost cycle detection problem
• \texttt{VeriSIMPL 2}: an open-source software for the verification of max-plus-linear systems
• On the optimality of Bellman-Ford-Moore shortest path algorithm
• OAR lib: an open source arc routing library
• A branch-and-cut algorithm for the median-path problem
• Solving the shortest path tour problem
• Lower bounds for tropical circuits and dynamic programs
• Fractal and complex network analyses of protein molecular dynamics
• Tropical algebra based framework for error propagation analysis in systolic arrays
• 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
• A flow-based tabu search algorithm for the RCPSP with transfer times
• Personnel assignment by multiobjective programming
• The discretizable molecular distance geometry problem
• Generating all vertices of a polyhedron is hard
• Consistency in networks of relations
• Shortest path algorithms for nearly acyclic directed graphs
• Algorithms for finding k-best perfect matchings
• Locating service facilities whose reliability is distance dependent.
• Solving the all-pairs-shortest-length problem on chordal bipartite graphs
• Approximation algorithms for solving the constrained arc routing problem in mixed graphs
• Minimum-latency aggregation scheduling in wireless sensor network
• Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs
• A post-improvement procedure for the mixed load school bus routing problem
• Reachability analysis for timed automata using max-plus algebra
• Shortest path problem with uncertain arc lengths
• Solving the shortest-paths problem on bipartite permutation graphs efficiently
• A linear-time algorithm for solving the center problem on weighted cactus graphs
• Dijkstra, Floyd and Warshall meet Kleene
• A multi-criteria police districting problem for the efficient and effective design of patrol sector
• The shortest-path problem for graphs with random arc-lengths
• Minmax regret location--allocation problem on a network under uncertainty
• Solving all-pairs shortest path by single-source computations: theory and practice
• The geodesic distance on the generalized gamma manifold for texture image retrieval
• A modified evidential methodology of identifying influential nodes in weighted networks
• The constrained shortest path problem with stochastic correlated link travel times

This page was built for software: Algorithm 97