Cited in
(only showing first 100 items - show all)- Large-scale network analysis with applications to transportation, communication and inference networks
- The \(p\)-hub center allocation problem
- Locating concentrators in centralized computer networks
- Reducing the hierarchical network design problem
- Approximation limitations of pure dynamic programming
- Spanning trees and shortest paths in Monge graphs
- A cutting plane method for solving harvest scheduling models with area restrictions
- Improved distance queries and cycle counting by Frobenius normal form
- Multiple allocation tree of hubs location problem for non-complete networks
- Semiparametric regression during 2003--2007
- Facilities layout generalized model solved by n-boundary shortest path heuristics
- Minimum weight resolving sets of grid graphs
- Routing with nonlinear multiattribute cost functions
- 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 shortest path problem with negative cost cycles
- On the optimality of Bellman-Ford-Moore shortest path algorithm
- Distributed and sequential algorithms for bioinformatics
- A reduction approach to the repeated assignment problem
- An efficient link allocation algorithm for survivable ATM-based personal communication networks
- A mean-variance model for the minimum cost flow problem with stochastic arc costs
- Solving linear, min and max constraint systems using CLP based on relational interval arithmetic
- Modeling Dynamic Vehicle Navigation in a Self-Organizing, Peer-to-Peer, Distributed Traffic Information System
- Uniform embeddings for Robinson similarity matrices
- I/O-efficient algorithms for graphs of bounded treewidth
- OAR lib: an open source arc routing library
- Complex networks as a unified framework for descriptive analysis and predictive modeling in climate science
- Optimal systolic array algorithms for tensor product
- A branch-and-cut algorithm for the median-path problem
- Parallel nested dissection for path algebra computations
- Some theoretical links between shortest path filters and minimum spanning tree filters
- Strong structural controllability of networks: comparison of bounds using distances and zero forcing
- 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
- Fast algorithms for the maximum convolution problem
- Simple rectangle-based functional programs for computing reflexive-transitive closures
- An approach for efficient ship routing
- Lower bounds for tropical circuits and dynamic programs
- Solving the shortest path tour problem
- Fractal and complex network analyses of protein molecular dynamics
- Tropical algebra based framework for error propagation analysis in systolic arrays
- Two fast algorithms for all-pairs shortest paths
- Incrementally closing octagons
- Voronoi diagrams on planar graphs, and computing the diameter in deterministic \(\tilde{O}(n^{5/3})\) time
- The octagon abstract domain for continuous constraints
- Efficient transitive closure of sparse matrices over closed semirings
- A polynomial time algorithm for finding the prime factors of Cartesian- product graphs
- A fast backtrack algorithm for graph isomorphism
- Algebraic structures for transitive closure
- Affinity propagation clustering using path based similarity
- Minimizing cost travel in multimodal transport using advanced relation transitive closure
- An algorithm for the determination of longest distances in a graph
- 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
- Location of facility based on simulated annealing and ``ZKW algorithms
- Efficient parallel algorithms for shortest paths in planar digraphs
- Reduktion von Präzedenzstrukturen
- Bounds on maximum concurrent flow in random bipartite graphs
- A flow-based tabu search algorithm for the RCPSP with transfer times
- scientific article; zbMATH DE number 7204408 (Why is no real title available?)
- Modifications of the Floyd-Warshall algorithm with nearly quadratic expected-time
- Multifractal analysis and topological properties of a new family of weighted Koch networks
- Monge sequences and a simple assignment algorithm
- Study of the numerical efficiency of structured ABS-normal forms
- Some problems in discrete optimization
- Power-law noises over general spatial domains and on nonstandard meshes
- Extensions of dynamic programming for multi-stage combinatorial optimization
- Fast and efficient solution of path algebra problems
- Dynamic temporal decoupling
- Flexibility and decoupling in simple temporal networks
- The discretizable molecular distance geometry problem
- Personnel assignment by multiobjective programming
- A tree search algorithm for the p-median problem
- Faster all-pairs shortest paths via circuit complexity
- Arrival time dependent routing policies in public transport
- From large deviations to semidistances of transport and mixing: coherence analysis for finite Lagrangian data
- Consistency in networks of relations
- Generating all vertices of a polyhedron is hard
- A Benders decomposition based framework for solving cable trench problems
- \(p\)-hub median problem for non-complete networks
- k-optimal solution sets for some polynomially solvable scheduling problems
- Shortest path algorithms for nearly acyclic directed graphs
- Extensions to a Lagrangean relaxation approach for the capacitated warehouse location 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
- scientific article; zbMATH DE number 7310280 (Why is no real title available?)
- Algorithms for finding k-best perfect matchings
- Solving the all-pairs-shortest-length problem on chordal bipartite graphs
- Approximation algorithms for solving the constrained arc routing problem in mixed graphs
- Locating service facilities whose reliability is distance dependent.
- Universal construction mechanism for networks from one-dimensional symbol sequences
- A cutting plane algorithm for the site layout planning problem with travel barriers
- Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs
- A spectral approach to the shortest path problem
- Consistent union and prioritized consistent union: new operations for preference aggregation
- A post-improvement procedure for the mixed load school bus routing problem
- Solving the nearly symmetric all-pairs shortest-path problem
- Minimum-latency aggregation scheduling in wireless sensor network
This page was built for software: Algorithm 97
