On a routing problem
From MaRDI portal
Cited in
(only showing first 100 items - show all)- A new bidirectional search algorithm with shortened postprocessing
- The tricriterion shortest path problem with at least two bottleneck objective functions
- Maximum weight bipartite matching in matrix multiplication time
- On the \(K\) shortest path trees problem
- A stochastic dynamic traveling salesman problem with hard time windows
- A practical approach for robust and flexible vehicle routing using metaheuristics and Monte Carlo sampling
- An O(qn) algorithm to q-color a proper family of circular arcs
- An extension of set partitioning with application to scheduling problems
- Dominating sets and domatic number of circular arc graphs
- The multiperiod assignment problem: A multicommodity network flow model and specialized branch and bound algorithm
- Microcomputer-based algorithms for large scale shortest path problems
- Scaling algorithms for network problems
- Richard Bellman's contributions to computer science
- On BF-orderable graphs
- Parallel nested dissection for path algebra computations
- A new algorithm to find the shortest paths between all pairs of nodes
- On the connectivity of a network
- Routing through a network with maximum reliability
- Shortest path algorithms: A computational study with the C programming language
- Coflow polyhedra
- Formal derivation of graph algorithmic programs using partition-and-recur
- The implicit general order complementarity problem, models and iterative methods
- How to compute least infeasible flows
- Activity nets: A guided tour through some recent developments
- Least possible time paths in stochastic, time-varying networks.
- The shortest path problem with forbidden paths
- Minimization algorithms for sequential transducers
- A hybrid genetic algorithm for the open shop scheduling problem
- A large step random walk for minimizing total weighted tardiness in a job shop
- An intermodal optimum path algorithm for multimodal networks with dynamic arc travel times and switching delays
- Using intelligent backtracking to improve branch-and-bound methods: An application to Open-Shop problems
- Decomposition methods for large job shops
- Solving a system of difference constraints with variables restricted to a finite set
- Arrival time dependent routing policies in public transport
- Greedy can beat pure dynamic programming
- Artificial pheromone for path selection by a foraging swarm of robots
- The stable fixtures problem with payments
- A new two-stage heuristic for the recreational vehicle scheduling problem
- A universal concept for robust solving of shortest path problems in dynamically reconfigurable graphs
- A type of biased consensus-based distributed neural network for path planning
- Delay resistant line planning with a view towards passenger transfers
- Checking dynamic consistency of conditional hyper temporal networks via mean payoff games. Hardness and (pseudo) singly-exponential time algorithm
- Hyper temporal networks. A tractable generalization of simple temporal networks and its relation to mean payoff games
- Incremental closure for systems of two variables per inequality
- An adapted ant colony optimization algorithm for the minimization of the travel distance of pickers in manual warehouses
- Conditional reachability of uncertain max plus linear systems
- The minimum concave cost network flow problem with fixed numbers of sources and nonlinear arc costs
- An empirical investigation of some bicriterion shortest path algorithms
- Fast and efficient solution of path algebra problems
- An efficient parallel algorithm for shortest paths in planar layered digraphs
- On a scheduling problem in a robotized analytical system
- Shortest paths algorithms: Theory and experimental evaluation
- Dijkstra, Floyd and Warshall meet Kleene
- Viscosity solutions of eikonal equations on topological networks
- Shortest paths in a network with time-dependent flow speeds
- A column generation approach for location-routing problems with pickup and delivery
- Valid inequalities and lifting procedures for the shortest path problem in digraphs with negative cycles
- A spectral approach to the shortest path problem
- Analyzing the benefits of an integrated mobility system using a matheuristic routing algorithm
- On the complexity of algorithms for detecting \(k\)-length negative cost cycles
- Efficient single-pair all-shortest-path query processing for massive dynamic networks
- A Lyapunov analysis of the continuous-time adaptive Bellman-Ford algorithm
- Fast approximate shortest paths in the congested clique
- Link prediction techniques, applications, and performance: a survey
- Dealing with multiple experts and non-stationarity in inverse reinforcement learning: an application to real-life problems
- Project scheduling with generalized precedence relations: a new method to analyze criticalities and flexibilities
- NP-hardness of shortest path problems in networks with non-FIFO time-dependent travel times
- Branch-and-refine for solving time-expanded MILP formulations
- Constrained energy variation for change point detection
- Automated verification of the parallel Bellman-Ford algorithm
- Uncertain programming models for multi-objective shortest path problem with uncertain parameters
- Semi-Lipschitz functions and machine learning for discrete dynamical systems on graphs
- Single-source shortest paths in the CONGEST model with improved bounds
- Grouping tasks to save energy in a cyclic scheduling problem: a complexity study
- Abstraction based verification of stability of polyhedral switched systems
- Parameterized complexity of conflict-free matchings and paths
- Netscan: a procedure for generating reaction networks by size
- Shortest path network problems with stochastic arc weights
- A two-criterion lexicographic algorithm for finding all shortest paths in networks
- Bi-criteria path problem with minimum length and maximum survival probability
- Optimal path discovery problem with homogeneous knowledge
- Energy-optimal routes for battery electric vehicles
- Incrementally closing octagons
- The minimum flow cost Hamiltonian cycle problem: a comparison of formulations
- A fuzzy set-based approach to origin-destination matrix estimation in urban traffic networks with imprecise data
- Generalized zeon algebras: theory and application to multi-constrained path problems
- A heuristic improvement of the Bellman-Ford algorithm
- The shortest path problem on networks with fuzzy parameters
- A survey of combinatorial optimization problems in multicast routing
- Shortest paths in stochastic networks with correlated link costs
- Convergence of successive approximations in the shortest route problem
- Computational techniques for reachability analysis of Max-Plus-Linear systems
- Incremental versus non-incremental dynamic programming
- Algorithms for non-linear and stochastic resource constrained shortest path
- Distributed distance computation and routing with small messages
- On the dominating set polytope
- Dynamic programming and minimum risk paths
- Solving RCPSP/max by lazy clause generation
- Speeding up Martins' algorithm for multiple objective shortest path problems
- The minor inequalities in the description of the set covering polyhedron of circulant matrices
This page was built for publication: On a routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3249327)
