Pages that link to "Item:Q78129"
From MaRDI portal
The following pages link to A note on two problems in connexion with graphs (Q78129):
Displaying 50 items.
- An ordered upwind method with precomputed stencil and monotone node acceptance for solving static convex Hamilton-Jacobi equations (Q2276405) (← links)
- An auction-based approach for the re-optimization shortest path tree problem (Q2282822) (← links)
- Bi-criteria path problem with minimum length and maximum survival probability (Q2284640) (← links)
- The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances (Q2286911) (← links)
- Subregion graph: a path planning acceleration structure for characters with various motion types in very large environments (Q2288106) (← links)
- Low-altitude aircraft routing (Q2290516) (← links)
- Ordered line integral methods for solving the eikonal equation (Q2291900) (← links)
- Disk-based shortest path discovery using distance index over large dynamic graphs (Q2292955) (← links)
- OAR lib: an open source arc routing library (Q2293658) (← links)
- 3D intelligent scissors for dental mesh segmentation (Q2299923) (← links)
- Optimal path discovery problem with homogeneous knowledge (Q2300623) (← links)
- A review and proposal of (fuzzy) clustering for nonlinearly separable data (Q2302802) (← links)
- Progressive simplification of polygonal curves (Q2306367) (← links)
- Bundling all shortest paths (Q2306586) (← links)
- Isogeometric analysis-suitable trivariate NURBS models from standard B-Rep models (Q2308567) (← links)
- Energy-optimal routes for battery electric vehicles (Q2309482) (← links)
- From diffuse damage to strain localization from an eikonal non-local (ENL) continuum damage model with evolving internal length (Q2310731) (← links)
- Gene expression and protein-protein interaction data for identification of colon cancer related genes using \(f\)-information measures (Q2311250) (← links)
- Corner cases, singularities, and dynamic factoring (Q2316184) (← links)
- The minimum routing cost tree problem. State of the art and a core-node based heuristic algorithm (Q2317621) (← links)
- Finding the shortest path with vertex constraint over large graphs (Q2325209) (← links)
- A shared memory parallel multi-mesh fast marching method for re-distancing (Q2326766) (← links)
- Safe path planning of mobile robot based on improved A\(^*\) algorithm in complex terrains (Q2331445) (← links)
- Improved approximation algorithms for the combination problem of parallel machine scheduling and path (Q2331579) (← links)
- Chamfer distances on the isometric grid: a structural description of minimal distances based on linear programming approach (Q2331593) (← links)
- A multilevel simplification algorithm for computing the average shortest-path length of scale-free complex network (Q2336171) (← links)
- Weighted cache location problem with identical servers (Q2336558) (← links)
- Variations on the bottleneck paths problem (Q2339446) (← links)
- A new separation algorithm for the Boolean quadric and cut polytopes (Q2339832) (← links)
- Clique partitioning with value-monotone submodular cost (Q2339847) (← links)
- Primal convergence from dual subgradient methods for convex optimization (Q2340335) (← links)
- A third order fast sweeping method with linear computational complexity for eikonal equations (Q2341118) (← links)
- Distance measure and the \(p\)-median problem in rural areas (Q2341206) (← links)
- A fast metaheuristic for the travelling salesperson problem with hotel selection (Q2342916) (← links)
- Optimal shortest path set problem in undirected graphs (Q2343975) (← links)
- Generalized Canadian traveller problems (Q2343992) (← links)
- Stable lexicographic rules for shortest path games (Q2345157) (← links)
- The minimum flow cost Hamiltonian cycle problem: a comparison of formulations (Q2348064) (← links)
- A combination of flow shop scheduling and the shortest path problem (Q2354293) (← links)
- Solving the shortest path tour problem (Q2356016) (← links)
- Survey: finite-state technology in natural language processing (Q2357102) (← links)
- Discrete geodesic graph (DGG) for computing geodesic distances on polyhedral surfaces (Q2357709) (← links)
- Single vehicle routing with predefined client sequence and multiple warehouse returns: the case of two warehouses (Q2358165) (← links)
- Interval type 2 fuzzy set in fuzzy shortest path problem (Q2358209) (← links)
- On the minimum routing cost clustered tree problem (Q2359809) (← links)
- Generalized zeon algebras: theory and application to multi-constrained path problems (Q2361017) (← links)
- Evasion of a moving object from detection by a system of heterogeneous observers in the threat environment (Q2362380) (← links)
- Efficient chains in a network with time-cost trade-off function on each arc (Q2367391) (← links)
- A heuristic improvement of the Bellman-Ford algorithm (Q2367969) (← links)
- Multiobjective routing of hazardous materials in stochastic networks (Q2368293) (← links)
