Algorithm 97
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Efficient reconstruction of metabolic pathways by bidirectional chemical search
- Computing the dilation of edge-augmented graphs in metric spaces
- Vertex fusion under distance constraints
- Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading
- A systolic array algorithm for the algebraic path problem (shortest paths; matrix inversion)
- A note on solving large p-median problems
- A polynomial time algorithm for finding the prime factors of Cartesian- product graphs
- On negative cycles in mixed graphs
- Allowable processing orders in the accelerated cascade algorithm
- The shortest-path problem for graphs with random arc-lengths
- Transitive closure and related semiring properties via eliminants
- Algorithms for finding k-best perfect matchings
- Experiments with parallel algorithms for combinatorial problems
- Parallel nested dissection for path algebra computations
- Monge sequences and a simple assignment algorithm
- A fast backtrack algorithm for graph isomorphism
- Large-scale network analysis with applications to transportation, communication and inference networks
- k-optimal solution sets for some polynomially solvable scheduling problems
- Reducing the hierarchical network design problem
- The impact of distance on location problems
- A fast algorithm for Steiner trees
- A new algorithm to find the shortest paths between all pairs of nodes
- A tree search algorithm for the p-median problem
- Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
- An algorithm to evaluate public transportation stops for minimizing passenger walking distance
- Polynomial algorithms to finite Veber problem for a tree network
- Fast primal and dual heuristics for the \(p\)-median location problem
- The hierarchical network design problem with transshipment facilities
- Shortest path and closure algorithms for banded matrices
- Efficient parallel algorithms for shortest paths in planar digraphs
- Locating concentrators in centralized computer networks
- Parallel search algorithms for graphs and trees
- Distances in orientations of graphs
- An algorithm of optimization for a special class of networks
- Consistency in networks of relations
- Algebraic structures for transitive closure
- Shortest path algorithms for nearly acyclic directed graphs
- Data-dependent bounds for the General and the Asymmetric Stacker-Crane problems
- GrGen
- LANGAGE
- Dynamic programming and graph optimization problems
- Detecting causal relationships in distributed computations: In search of the holy grail
- Fast algorithms for the maximum convolution problem
- Periodic sets of integers
- RelView
- SCADE
- Spanning trees and shortest paths in Monge graphs
- Solving linear, min and max constraint systems using CLP based on relational interval arithmetic
- Upper and lower bounds for the single source capacitated location problem.
- CP-nets
- Locating service facilities whose reliability is distance dependent.
- MDSM
- Computational analysis of a flexible assembly system design problem
- A note on the location of an obnoxious facility on a network
- A linear-time algorithm for solving the center problem on weighted cactus graphs
- Multifractal analysis and topological properties of a new family of weighted Koch networks
- 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
- 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
- A modified evidential methodology of identifying influential nodes in weighted networks
- Blossom V
- A comparison of Monte Carlo tree search and rolling horizon optimization for large-scale dynamic resource allocation problems
- Floyd-A algorithm solving the least-time itinerary planning problem in urban scheduled public transport network
- Heuristics for synthesizing robust networks with a diameter constraint
- A greedy approach for a rolling stock management problem using multi-interval constraint propagation. A greedy approach for a rolling stock management problem using multi-interval constraint propagation, ROADEF/EURO challenge 2014
- Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics
- Incremental closure for systems of two variables per inequality
- Affinity propagation clustering using path based similarity
- Minimizing cost travel in multimodal transport using advanced relation transitive closure
- Special cases of the quadratic shortest path problem
- Shortest path algorithms for functional environments
- An adapted ant colony optimization algorithm for the minimization of the travel distance of pickers in manual warehouses
- Consistent union and prioritized consistent union: new operations for preference aggregation
- An optimal parallel algorithm for solving all-pairs shortest paths problem on circular-arc graphs
- Network congestion analysis of gravity generated models
- Fractal and complex network analyses of protein molecular dynamics
- An algebraic framework for minimum spanning tree problems
- A biobjective and trilevel programming model for hub location problem in design of a resilient power projection network
- Conditional reachability of uncertain max plus linear systems
- Parameterized complexity of length-bounded cuts and multicuts
- A polynomial time algorithm for unloading boxes off a gravity conveyor
- Facilities layout generalized model solved by n-boundary shortest path heuristics
- An algorithm for drawing general undirected graphs
- Fast and efficient solution of path algebra problems
- Networks of constraints: Fundamental properties and applications to picture processing
- Genetic algorithms for rerouting shortest paths in dynamic and stochastic networks
- Computation of shortest path in cellular automata
- Shortest shortest path trees of a network
- Maxplus
- Dijkstra, Floyd and Warshall meet Kleene
- Semiparametric regression during 2003--2007
- SITATION
- MOD-DIST
- MENU-OKF
- Optimal computation of shortest paths on doubly convex bipartite graphs
This page was built for software: Algorithm 97
