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.
- The most critical path in a PERT network: A heuristic approach (Q1341990) (← links)
- A new algorithm for shortest paths among obstacles in the plane (Q1356167) (← links)
- On the exponent of all pairs shortest path problem (Q1356884) (← links)
- The \(k\)-cardinality assignment problem (Q1363745) (← links)
- An efficient P-D algorithm for shortest path problem (Q1367256) (← links)
- A greedy algorithm for the optimal basis problem (Q1371665) (← links)
- Paths with minimum range and ratio of arc lengths (Q1377658) (← links)
- Spanning trees and shortest paths in Monge graphs (Q1382772) (← links)
- Estimation and determination of shortest path length in a road network with obstacles (Q1388932) (← links)
- An effective genetic algorithm approach to the quadratic minimum spanning tree problem (Q1389197) (← links)
- A two-phase shortest path algorithm for networks with node coordinates (Q1390292) (← links)
- Improved shortest path algorithms for nearly acyclic graphs (Q1395429) (← links)
- Finding the most vital node of a shortest path. (Q1401266) (← links)
- Multicriteria heuristic search. (Q1405227) (← links)
- On the robust shortest path problem. (Q1406645) (← links)
- Minimum time paths in a network with mixed time constraints. (Q1406690) (← links)
- Optimal path planning based on visibility (Q1411497) (← links)
- Combination of geographical information system and efficient routing algorithms for real life distribution operations. (Q1412749) (← links)
- A new algorithm for reoptimizing shortest paths when the arc costs change (Q1413907) (← links)
- Accurate calculation of hazardous materials transport risks. (Q1413919) (← links)
- A branch and bound algorithm for the robust shortest path problem with interval data. (Q1426725) (← links)
- Finding the first \(K\) shortest paths in a time-window network. (Q1427091) (← links)
- The tree longest detour problem in a biconnected graph. (Q1427585) (← links)
- Heuristic and exact algorithms for the simultaneous assignment problem (Q1572972) (← links)
- The Spatial Semantic Hierarchy (Q1575186) (← links)
- Minimization algorithms for sequential transducers (Q1575676) (← links)
- Hybrid fiber co-axial CATV network design with variable capacity optical network units (Q1577122) (← links)
- Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees (Q1577774) (← links)
- An evolutionary approach for finding optimal trees in undirected networks (Q1579498) (← links)
- On some relations between 2-trees and tree metrics (Q1584450) (← links)
- Nearest route problem (Q1584634) (← links)
- Semi-dynamic breadth-first search in digraphs (Q1589436) (← links)
- Terminal-pair reliability in ATM virtual path networks (Q1591928) (← links)
- Strategies of node selection in search procedures for solving combinatorial optimization problems: A survey and a general formalization (Q1592632) (← links)
- Fuzzy route choice model for traffic assignment (Q1595189) (← links)
- Solving some lexicographic multi-objective combinatorial problems (Q1598728) (← links)
- Finding all the negative cycles in a directed graph (Q1602697) (← links)
- Optimal vertex ordering of graphs (Q1607014) (← links)
- A walk over the shortest path: Dijkstra's algorithm viewed as fixed-point computation. (Q1607102) (← links)
- The shortest path in parallel (Q1607105) (← links)
- Nurse scheduling with tabu search and strategic oscillation (Q1609902) (← links)
- Sampling social networks using shortest paths (Q1618330) (← links)
- A hybrid routing model for mitigating congestion in networks (Q1618456) (← links)
- Dynamic origin-to-destination routing of wirelessly connected, autonomous vehicles on a congested network (Q1620639) (← links)
- Arrival time dependent routing policies in public transport (Q1627847) (← links)
- Trajectory planning for autonomous underwater vehicles in the presence of obstacles and a nonlinear flow field using mixed integer nonlinear programming (Q1628043) (← links)
- A numerical simulation of neural fields on curved geometries (Q1628359) (← links)
- Exact algorithms for multi-criteria multi-modal shortest path with transfer delaying and arriving time-window in urban transit network (Q1630202) (← links)
- Reachability for airline networks: fast algorithm for shortest path problem with time windows (Q1630997) (← links)
- From large deviations to semidistances of transport and mixing: coherence analysis for finite Lagrangian data (Q1631302) (← links)
