Algorithm 97

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)

• 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
• Minmax regret location--allocation problem on a network under uncertainty
• 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
• Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading
• 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
• Detecting causal relationships in distributed computations: In search of the holy grail
• 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
• The Floyd-Warshall algorithm on graphs with negative cycles
• Computing periodic request functions to speed-up the analysis of non-cyclic task models
• HPStream
• A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem
• On the optimal control of Boolean control networks
• Processing time-dependent shortest path queries without pre-computed speed information on road networks
• Computing a fuzzy shortest path in a network with mixed fuzzy arc lengths using \(\alpha \)-cuts
• An optimal parallel algorithm for solving all-pairs shortest paths problem on circular-arc graphs
• Analysis of average shortest-path length of scale-free network
• A fast algorithm for Steiner trees
• Data-dependent bounds for the General and the Asymmetric Stacker-Crane problems
• 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
• A two-criterion lexicographic algorithm for finding all shortest paths in networks
• The cache-oblivious Gaussian elimination paradigm: Theoretical framework, parallelization and Experimental evaluation
• New algorithms for solving tropical linear systems
• Two-phase algorithms for the parametric shortest path problem
• A note on the location of an obnoxious facility on a network
• Computing the dilation of edge-augmented graphs in metric spaces
• Solving an urban waste collection problem using ants heuristics
• Genetic algorithms for rerouting shortest paths in dynamic and stochastic networks
• Approximation limitations of pure dynamic programming
• 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
• Lower bounds for tropical circuits and dynamic programs
• Tropical algebra based framework for error propagation analysis in systolic arrays
• A flow-based tabu search algorithm for the RCPSP with transfer times
• 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
• Shortest path problem with uncertain arc lengths
• Solving the shortest-paths problem on bipartite permutation graphs efficiently
• The shortest-path problem for graphs with random arc-lengths
• A modified evidential methodology of identifying influential nodes in weighted networks
• Network structure of two-dimensional decaying isotropic turbulence
• GrGen
• LANGAGE

This page was built for software: Algorithm 97