On a routing problem
From MaRDI portal
Publication:3249327
DOI10.1090/qam/102435zbMath0081.14403OpenAlexW2227557434WikidataQ56078226 ScholiaQ56078226MaRDI QIDQ3249327
Publication date: 1958
Published in: Quarterly of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/qam/102435
Related Items
Über ein Paradoxon aus der Verkehrsplanung, Unnamed Item, Compact Difference Bound Matrices, A Dimension-Reduction Algorithm for Multi-Stage Decision Problems with Returns in a Partially Ordered Set, A Coding-Based Approach to Robust Shortest-Path Routing, An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem, Optimal Screening of Populations with Heterogeneous Risk Profiles Under the Availability of Multiple Tests, Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems, Calendarization of time planning in MPM networks, Irreversible operations — A network analysis, Some constrained shortest-route problems, The selection of an optimal segmentation region in physiological signals, An exact two-phase approach to re-optimize tours in home care planning, Adaptive large neighborhood search for the vehicle routing problem with synchronization constraints at the delivery location, A novel approach for modeling order picking paths, Modeling and analysis of switching max-plus linear systems with discrete-event feedback, A polynomial algorithm for minimizing travel time in consistent time‐dependent networks with waits, A fishing route optimization decision support system: the case of the tuna purse seiner, Is sized typing for Coq practical?, On improving the regional transportation efficiency based on federated learning, An output-sensitive algorithm for all-pairs shortest paths in directed acyclic graphs, Interval graphs with side (and size) constraints, Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality, Graph-theoretical methods to construct entity-relationship databases, Online learning of energy consumption for navigation of electric vehicles, Jacobi's bound: Jacobi's results translated in Kőnig's, Egerváry's and Ritt's mathematical languages, Energy Büchi problems, Lower bounds for non-adaptive shortest path relaxation, Solver-free heuristics to retrieve feasible points for offshore wind farm collection system, Theory of graph neural networks: representation and learning, Devisenarbitrage als Flußprobleme, Relax-and-split method for nonconvex inverse problems, Unnamed Item, Unnamed Item, An efficient parallel algorithm for shortest paths in planar layered digraphs, A Branch-and-Bound Approach to the Traveling Salesman Problem with a Drone, Comparison of the Exact and Approximate Algorithms in the Random Shortest Path Problem, Unnamed Item, Algorithms for flows with parametric capacities, Finding real-valued single-source shortest paths in o(n 3) expected time, Intra-domain traffic engineering with shortest path routing protocols, Multicriteria path and tree problems: discussion on exact algorithms and applications, Shortest paths in almost acyclic graphs, From the physics of interacting polymers to optimizing routes on the London Underground, Intra-domain traffic engineering with shortest path routing protocols, The determination of the path with minimum-cost norm value, Unnamed Item, Some optimal path problems subject to improvements, Extensions of labeling algorithms for multi‐objective uncertain shortest path problems, On the shortest path problem with negative cost cycles, Survey on Directed Model Checking, Unnamed Item, Engineering Negative Cycle Canceling for Wind Farm Cabling, On Restricted Disjunctive Temporal Problems: Faster Algorithms and Tractability Frontier, Approximation Limitations of Pure Dynamic Programming, Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations, Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models, Faster algorithms for shortest path and network flow based on graph decomposition, Competitive Algorithms for Layered Graph Traversal, Finding the k Shortest Paths, A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths, Maximum-Stopping-Value Policies in Finite Markov Population Decision Chains, Unnamed Item, Unnamed Item, Algorithms for Weighted Matching Generalizations II: f-factors and the Special Case of Shortest Paths, Explainable dynamic programming, Distributed Exact Weighted All-Pairs Shortest Paths in Randomized Near-Linear Time, Parallel Algorithms for Network Routing Problems and Recurrences, An $O(n^2 )$ Algorithm for Coloring Proper Circular Arc Graphs, Finding reliable shortest paths in road networks under uncertainty, On the optimality of Bellman-Ford-Moore shortest path algorithm, Scaling algorithms for network problems, Richard Bellman's contributions to computer science, On BF-orderable graphs, Arrival time dependent routing policies in public transport, Greedy can beat pure dynamic programming, Approximation algorithms for solving the constrained arc routing problem in mixed graphs, Artificial pheromone for path selection by a foraging swarm of robots, New efficient shortest path simplex algorithm: Pseudo permanent labels instead of permanent labels, Configuration and the advantages of the shifting bottleneck procedure for optimizing the job shop total weighted tardiness scheduling problem, Parallel nested dissection for path algebra computations, Lower bounds for monotone counting circuits, An adaptive multi-spline refinement algorithm in simulation based sailboat trajectory optimization using onboard multi-core computer systems, The octagon abstract domain, hCHAC: a family of MOACO algorithms for the resolution of the bi-criteria military unit pathfinding problem, The stable fixtures problem with payments, A new two-stage heuristic for the recreational vehicle scheduling problem, Road network emergency accessibility planning after a major earthquake, New reformulations of distributionally robust shortest path problem, Optimal routing for maximizing the travel time reliability, An improved Dijkstra's shortest path algorithm for sparse network, Finding shortest path in the presence of barriers: an alternate approach, How to compute least infeasible flows, The capacity expansion path problem in networks, Two fast algorithms for all-pairs shortest paths, Optimal placement of UV-based communications relay nodes, Programming with C++ concepts, Activity nets: A guided tour through some recent developments, Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs, Enhancing local search algorithms for job shops with MIN-sum objectives by approximate move evaluation, A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem, The aircraft routing problem with refueling, A hybrid differential evolution and tree search algorithm for the job shop scheduling problem, Least possible time paths in stochastic, time-varying networks., Finding the shortest paths by node combination, Trichotomy for integer linear systems based on their sign patterns, An efficient label setting/correcting shortest path algorithm, 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, New models for shortest path problem with fuzzy arc lengths, Speeding up the Floyd-Warshall algorithm for the cycled shortest path problem, Shortest path problem with uncertain arc lengths, A knowledge-based analysis of global function computation, Complexity and approximation for precedence constrained scheduling problems with large communication delays, An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem, Inapproximability and polynomial-time approximation algorithm for UET tasks on structured processor networks, A reduction approach to the two-campus transport problem, Maximum probability shortest path problem, Shortest path algorithms: A computational study with the C programming language, Lower bounds for tropical circuits and dynamic programs, Sequence alignment with arbitrary steps and further generalizations, with applications to alignments in linguistics, Processing time-dependent shortest path queries without pre-computed speed information on road networks, Approximately matching context-free languages, Automatic generation of path conditions for concurrent timed systems, The problem of maximum flow with minimum attainable cost in a network, A new algorithm to compute Pareto-optimal paths in a multi objective fuzzy weighted network, Scheduling for single agile satellite, redundant targets problem using complex networks theory, Dynamic conditional value-at-risk model for routing and scheduling of hazardous material transportation networks, Coflow polyhedra, Finding a shortest non-zero path in group-labeled graphs via permanent computation, A language for generic programming in the large, Scheduling \(UET\)-tasks on a star network: complexity and approximation, Development of the tree-based link labeling algorithm for optimal path-finding in urban transportation networks, Integrated task assignment and path optimization for cooperating uninhabited aerial vehicles using genetic algorithms, Measuring agility of networked organizational structures via network entropy and mutual information, Single source shortest paths in \(H\)-minor free graphs, Group shops scheduling with makespan criterion subject to random release dates and processing times, The shortest path problem with forbidden paths, Characterization of facets of the hop constrained chain polytope via dynamic programming, High-performance simulation-based algorithms for an alpine ski racer's trajectory optimization in heterogeneous computer systems, Concurrent optimization of harvesting and road network layouts under steep terrain, Formal derivation of graph algorithmic programs using partition-and-recur, 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, Minimization algorithms for sequential transducers, On the \(K\) shortest path trees problem, A hybrid genetic algorithm for the open shop scheduling 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, Uncertain random shortest path problem, A large step random walk for minimizing total weighted tardiness in a job shop, Sorting can exponentially speed up pure dynamic programming, 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, Shortest paths in networks with vector weights, Decomposition methods for large job shops, The implicit general order complementarity problem, models and iterative methods, 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, Solving a system of difference constraints with variables restricted to a finite set, The multiperiod assignment problem: A multicommodity network flow model and specialized branch and bound algorithm, A parametric approach to solving bicriterion shortest path problems, Microcomputer-based algorithms for large scale shortest path problems, Locating stops along bus or railway lines -- a bicriteria problem, 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, Generalized zeon algebras: theory and application to multi-constrained path problems, Constrained energy variation for change point detection, A heuristic improvement of the Bellman-Ford algorithm, Scheduling in the presence of processor networks : complexity and approximation, The shortest path problem on networks with fuzzy parameters, Automated verification of the parallel Bellman-Ford algorithm, Some advances on the set covering polyhedron of circulant matrices, Optimal Embedding into Star Metrics, An efficient parallel algorithm for shortest paths in planar layered digraphs, On the equivalence between some shortest path algorithms, A strong flow-based formulation for the shortest path problem in digraphs with negative cycles, Path Problems in Complex Networks, A survey of combinatorial optimization problems in multicast routing, Shortest paths in stochastic networks with correlated link costs, Uncertain programming models for multi-objective shortest path problem with uncertain parameters, Convergence of successive approximations in the shortest route problem, Semi-Lipschitz functions and machine learning for discrete dynamical systems on graphs, Single-source shortest paths in the CONGEST model with improved bounds, A universal concept for robust solving of shortest path problems in dynamically reconfigurable graphs, On a scheduling problem in a robotized analytical system, Shortest paths algorithms: Theory and experimental evaluation, Computational techniques for reachability analysis of Max-Plus-Linear systems, Grouping tasks to save energy in a cyclic scheduling problem: a complexity study, Abstraction based verification of stability of polyhedral switched systems, An approach to the distributionally robust shortest path problem, A fully polynomial time approximation scheme for the probability maximizing shortest path problem, Parameterized complexity of conflict-free matchings and paths, Towards classifying the polynomial-time solvability of temporal betweenness centrality, A type of biased consensus-based distributed neural network for path planning, Incremental versus non-incremental dynamic programming, Netscan: a procedure for generating reaction networks by size, Algorithms for non-linear and stochastic resource constrained shortest path, Delay resistant line planning with a view towards passenger transfers, Distributed distance computation and routing with small messages, Qubits' mapping and routing for NISQ on variability of quantum gates, On the dominating set polytope, Dijkstra, Floyd and Warshall meet Kleene, Viscosity solutions of eikonal equations on topological networks, Dynamic programming and minimum risk paths, Solving RCPSP/max by lazy clause generation, Theory and application of reciprocal transformation of “path problem” and “time float problem”, 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, Speeding up Martins' algorithm for multiple objective shortest path problems, The minor inequalities in the description of the set covering polyhedron of circulant matrices, Shortest paths in a network with time-dependent flow speeds, Incremental closure for systems of two variables per inequality, Shortest path network problems with stochastic arc weights, Finding the shortest path in stochastic networks, Levelness of Order Polytopes, A new approximation algorithm for obtaining the probability distribution function for project completion time, Online linear optimization and adaptive routing, Algorithms for time-dependent bicriteria shortest path problems, A column generation approach for location-routing problems with pickup and delivery, An adapted ant colony optimization algorithm for the minimization of the travel distance of pickers in manual warehouses, New algorithms for multi objective shortest path problem., GNet: a generalized network model and its applications in qualitative spatial reasoning, A two-criterion lexicographic algorithm for finding all shortest paths in networks, Valid inequalities and lifting procedures for the shortest path problem in digraphs with negative cycles, Planar graphs, negative weight edges, shortest paths, and near linear time, A spectral approach to the shortest path problem, Heuristic shortest path algorithms for transportation applications: state of the art, Simultaneous solution of Lagrangean dual problems interleaved with preprocessing for the weight constrained shortest path problem, A fast parametric assignment algorithm with applications in max-algebra, Constrained decompositions of integer matrices and their applications to intensity modulated radiation therapy, Analyzing the benefits of an integrated mobility system using a matheuristic routing algorithm, MINIMUM FLOW VARIATION IN MAXIMUM FLOWS, Bi-criteria path problem with minimum length and maximum survival probability, Conditional reachability of uncertain max plus linear systems, The shortest route problem with constraints, The minimum concave cost network flow problem with fixed numbers of sources and nonlinear arc costs, Computation of the optimal value function in time-dependent networks, Optimal path discovery problem with homogeneous knowledge, On the complexity of algorithms for detecting \(k\)-length negative cost cycles, Fuzzy multi-objective chance-constrained programming model for hazardous materials transportation, The shortest route through a network with time-dependent internodal transit times, Solving the Nearly Symmetric All-Pairs Shortest-Path Problem, Efficient single-pair all-shortest-path query processing for massive dynamic networks, A Lyapunov analysis of the continuous-time adaptive Bellman-Ford algorithm, Energy-optimal routes for battery electric vehicles, The grid refinement technique, Fast approximate shortest paths in the congested clique, The Stable Fixtures Problem with Payments, An empirical investigation of some bicriterion shortest path algorithms, Tropical Complexity, Sidon Sets, and Dynamic Programming, Fast and efficient solution of path algebra problems, 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, Stratification and control of large systems with applications to chess and checkers, Solvable classes of discrete dynamic programming, Path problems in skew-symmetric graphs, Models and algorithm for stochastic shortest path problem, Incrementally closing octagons, NP-hardness of shortest path problems in networks with non-FIFO time-dependent travel times, Time-dependent shortest paths through a fixed sequence of nodes: application to a travel planning problem, Two-Levels-Greedy: a generalization of Dijkstra's shortest path algorithm, The minimum flow cost Hamiltonian cycle problem: a comparison of formulations, Branch-and-refine for solving time-expanded MILP formulations, A fuzzy set-based approach to origin-destination matrix estimation in urban traffic networks with imprecise data
