Algorithm 97

swMATH29730MaRDI QIDQ41444

No author found.

Related Items (only showing first 100 items - show all)

Caper ⋮ Efficient parallel algorithms for shortest paths in planar graphs ⋮ Routing with delays when storage is costly ⋮ Searching among intervals and compact routing tables ⋮ Simple Rectangle-Based Functional Programs for Computing Reflexive-Transitive Closures ⋮ Faster All-Pairs Shortest Paths via Circuit Complexity ⋮ Tabu search algorithm for flexible flow path design of unidirectional automated-guided vehicle systems ⋮ On the route construction in changing environments using solutions of the eikonal equation ⋮ A dynamic path planning approach for dense, large, grid-based automated guided vehicle systems ⋮ Isotropic random geometric networks in two dimensions with a penetrable cavity ⋮ No-idle parallel-machine scheduling of unit-time jobs with a small number of distinct release dates and deadlines ⋮ A swarm intelligence graph-based pathfinding algorithm (SIGPA) for multi-objective route planning ⋮ Multiple allocation tree of hubs location problem for non-complete networks ⋮ Power-Law Noises over General Spatial Domains and on Nonstandard Meshes ⋮ Hadwiger Number of Graphs with Small Chordality ⋮ The restricted Chinese postman problems with penalties ⋮ Some problems in discrete optimization ⋮ A survey of unsupervised learning methods for high-dimensional uncertainty quantification in black-box-type problems ⋮ A recommender system for train routing: when concatenating two minimum length paths is not the minimum length path ⋮ Host-graph-sensitive RETE nets for incremental graph pattern matching with nested graph conditions ⋮ Minimum Weight Polygon Triangulation Problem in Sub-Cubic Time Bound ⋮ A note on tree realizations of matrices ⋮ On merging two trust-networks in one with bipolar preferences ⋮ New algorithms for solving tropical linear systems ⋮ Network structure of two-dimensional decaying isotropic turbulence ⋮ On the Optimal Control of Boolean Control Networks ⋮ Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems ⋮ Universal construction mechanism for networks from one-dimensional symbol sequences ⋮ Computational Complexity of SRIC and LRIC Indices ⋮ Efficiency improvement in an \(n\)D systems approach to polynomial optimization ⋮ Comparison of the Exact and Approximate Algorithms in the Random Shortest Path Problem ⋮ An algorithm for the determination of longest distances in a graph ⋮ Personnel assignment by multiobjective programming ⋮ Reduktion von Präzedenzstrukturen ⋮ Solving an urban waste collection problem using ants heuristics ⋮ Quasi-isometric parameterization for texture mapping ⋮ Causal Semantics for BPP Nets with Silent Moves ⋮ Minimal functional routes in directed graphs with dependent edges ⋮ Shortest-path queries in static networks ⋮ Low‐Rank Smoothing Splines on Complicated Domains ⋮ A branch-and-cut algorithm for the median-path problem ⋮ Modeling Dynamic Vehicle Navigation in a Self-Organizing, Peer-to-Peer, Distributed Traffic Information System ⋮ A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem ⋮ Communication lower bounds and optimal algorithms for numerical linear algebra ⋮ A mean-variance model for the minimum cost flow problem with stochastic arc costs ⋮ Two-phase algorithms for the parametric shortest path problem ⋮ Minimum-latency aggregation scheduling in wireless sensor network ⋮ On the shortest path problem with negative cost cycles ⋮ A Novel Discrete Differential Evolution Algorithm for the Vehicle Routing Problem in B2C E-Commerce ⋮ Robust Critical Node Selection by Benders Decomposition ⋮ Unnamed Item ⋮ Approximation Limitations of Pure Dynamic Programming ⋮ Complex networks as a unified framework for descriptive analysis and predictive modeling in climate science ⋮ A Strongly Polynomial Algorithm for a Class of Minimum-Cost Flow Problems with Separable Convex Objectives ⋮ Solving the Nearly Symmetric All-Pairs Shortest-Path Problem ⋮ Minimum weight resolving sets of grid graphs ⋮ Generating all vertices of a polyhedron is hard ⋮ Tropical Complexity, Sidon Sets, and Dynamic Programming ⋮ Ein Algorithmus zur Ermittlung k-bester Kantenfolgen zwischen allen Ecken eines Graphen ⋮ \({\mathfrak R}\)-Netzwerke und Matrixalgorithmen ⋮ All shortest distances in a graph. An improvement to Dantzig's inductive algorithm ⋮ The Migratory Beekeeping Routing Problem: Model and an Exact Algorithm ⋮ Optimum Experimental Design for Interface Identification Problems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Optimal systolic array algorithms for tensor product ⋮ Searching for spreads and packings ⋮ Nonlocal pagerank ⋮ From Circuit Complexity to Faster All-Pairs Shortest Paths ⋮ Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic $\tilde{O}(n^{5/3})$ Time ⋮ How to Keep an Eye on Small Things ⋮ Modifications of the Floyd-Warshall algorithm with nearly quadratic expected-time ⋮ An approach for efficient ship routing ⋮ Study of the numerical efficiency of structured abs-normal forms ⋮ A decomposition algorithm for shortest paths in a network with many strongly connected components ⋮ Power Tree Filter: A Theoretical Framework Linking Shortest Path Filters and Minimum Spanning Tree Filters ⋮ Dynamic programming and graph optimization problems ⋮ Detecting causal relationships in distributed computations: In search of the holy grail ⋮ Multifractal analysis and topological properties of a new family of weighted Koch networks ⋮ Fast algorithms for the maximum convolution problem ⋮ The geodesic distance on the generalized gamma manifold for texture image retrieval ⋮ Efficient transitive closure of sparse matrices over closed semirings ⋮ Arrival time dependent routing policies in public transport ⋮ Greedy can beat pure dynamic programming ⋮ From large deviations to semidistances of transport and mixing: coherence analysis for finite Lagrangian data ⋮ Periodic sets of integers ⋮ A biased-randomized discrete-event heuristic for coordinated multi-vehicle container transport across interconnected networks ⋮ Benders decomposition applied to profit maximizing hub location problem with incomplete hub network ⋮ The pickup and delivery problem with alternative locations and overlapping time windows ⋮ Truck routing and scheduling ⋮ Global similarity tests of physical designs of circuits: a complex network approach ⋮ A Benders decomposition based framework for solving cable trench problems ⋮ A cutting plane algorithm for the site layout planning problem with travel barriers ⋮ \(p\)-hub median problem for non-complete networks ⋮ Priority inheritance with backtracking for iterative multi-agent path finding ⋮ Computation of shortest path in cellular automata ⋮ Shortest shortest path trees of a network ⋮ Solving all-pairs shortest path by single-source computations: theory and practice ⋮ A modified evidential methodology of identifying influential nodes in weighted networks ⋮ Spanning trees and shortest paths in Monge graphs

This page was built for software: Algorithm 97