Pages that link to "Item:Q78129"

The following pages link to A note on two problems in connexion with graphs (Q78129):

Displaying 50 items.

• Objectives and methods in multi-objective routing problems: a survey and classification scheme (Q2029300) (← links)
• Solving the maximum edge disjoint path problem using a modified Lagrangian particle swarm optimisation hybrid (Q2030326) (← links)
• An efficient column generation approach for practical railway crew scheduling with attendance rates (Q2030362) (← links)
• The multiple shortest path problem with path deconfliction (Q2030451) (← links)
• Min-max controllable risk problems (Q2040608) (← links)
• The effect of attacks on the railway network of Hungary (Q2045622) (← links)
• Combinatorial optimization algorithms for detecting collapse mechanisms of concrete slabs (Q2046697) (← links)
• Weighted parsing for grammar-based language models over multioperator monoids (Q2051800) (← links)
• Collective motion planning for a group of robots using intermittent diffusion (Q2053372) (← links)
• Efficient single-pair all-shortest-path query processing for massive dynamic networks (Q2055599) (← links)
• The randomized slicer for CVPP: sharper, faster, smaller, batchier (Q2055682) (← links)
• Rooted spanning superpixels (Q2056121) (← links)
• A Lyapunov analysis of the continuous-time adaptive Bellman-Ford algorithm (Q2059483) (← links)
• Multi-stencils fast marching method for factored eikonal equations with quadratic anisotropy (Q2060238) (← links)
• Network disconnection games: a game theoretic approach to checkpoint evaluation in networks (Q2064296) (← links)
• Spanners in randomly weighted graphs: independent edge lengths (Q2065765) (← links)
• Probabilistic model based path planning (Q2066244) (← links)
• Efficient routing strategy with transmission history information and its surrogate analysis (Q2068433) (← links)
• Link prediction techniques, applications, and performance: a survey (Q2070200) (← links)
• A solution to the path planning problem via algebraic geometry and reinforcement learning (Q2071234) (← links)
• Approximation algorithms for constructing required subgraphs using stock pieces of fixed length (Q2082192) (← links)
• A mesoscale agent based modeling framework for flow-mediated infection transmission in indoor occupied spaces (Q2083219) (← links)
• Strategy-based transit stochastic user equilibrium model with capacity and number-of-transfers constraints (Q2083941) (← links)
• Different costs of therapeutic resistance in cancer: short- and long-term impact of population heterogeneity (Q2085123) (← links)
• Phases of small worlds: a mean field formulation (Q2087733) (← links)
• The grid based approach, a fast local evaluation technique for line planning (Q2095522) (← links)
• Incorporating auxiliary information in betweenness measure for input-output networks (Q2096770) (← links)
• On decay centrality (Q2098971) (← links)
• Abstract network flow with intermediate storage for evacuation planning (Q2103018) (← links)
• An exact reduction technique for the k-colour shortest path problem (Q2108122) (← links)
• Branch-and-refine for solving time-expanded MILP formulations (Q2108138) (← links)
• Min-cost-flow preserving bijection between subgraphs and orientations (Q2111782) (← links)
• Fast 3D computations of compressible flow discharge in buildings and complex networks (Q2112515) (← links)
• Nonparametric Bayes subject to overidentified moment conditions (Q2116355) (← links)
• Reliability in public transit networks considering backup itineraries (Q2116902) (← links)
• Equilibrium traffic flow assignment in a multi-subnet urban road network (Q2117612) (← links)
• Divide-and-conquer large scale capacitated arc routing problems with route cutting off decomposition (Q2123554) (← links)
• The geodesic distance on the generalized gamma manifold for texture image retrieval (Q2127293) (← links)
• Metric and ultrametric inequalities for directed graphs (Q2127613) (← links)
• Local routing in sparse and lightweight geometric graphs (Q2134745) (← links)
• Modified Floyd-Warshall's algorithm for maximum connectivity in wireless sensor networks under uncertainty (Q2135475) (← links)
• Computing the trajectories for the development of optimal routes (Q2139150) (← links)
• An efficient heuristic for minimizing the number of moves for the retrieval of a single item in a puzzle-based storage system with multiple escorts (Q2140139) (← links)
• An \(\Omega (n^d)\) lower bound on the number of cell crossings for weighted shortest paths in \(d\)-dimensional polyhedral structures (Q2144452) (← links)
• On the spanning and routing ratios of the directed \(\Theta_6\)-graph (Q2144459) (← links)
• An efficient jet marcher for computing the quasipotential for 2D SDEs. Enhancing accuracy and efficiency of quasipotential solvers (Q2144963) (← links)
• Automated verification of the parallel Bellman-Ford algorithm (Q2145339) (← links)
• A greedy randomized adaptive search procedure (GRASP) for the multi-vehicle prize collecting arc routing for connectivity problem (Q2147067) (← links)
• Data-driven optimization and statistical modeling to improve meter reading for utility companies (Q2147136) (← links)
• Dynamic threshold P systems with delay on synapses for shortest path problems (Q2152438) (← links)