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.
- roads (Q78130) (← links)
- cppRouting (Q81937) (← links)
- Swarm intelligence for self-organized clustering (Q86925) (← links)
- locationgamer (Q131991) (← links)
- Compact formulations of the Steiner traveling salesman problem and related problems (Q257227) (← links)
- Efficient computation of Lyapunov functions for Morse decompositions (Q258397) (← links)
- Fast algorithms for the undirected negative cost cycle detection problem (Q261362) (← links)
- A new novel local search integer-programming-based heuristic for PCB assembly on collect-and-place machines (Q266405) (← links)
- Large-scale optimization with the primal-dual column generation method (Q266408) (← links)
- Dimensionality reduction of collective motion by principal manifolds (Q282231) (← links)
- Geodesic distance and curves through isotropic and anisotropic heat equations on images and surfaces (Q283012) (← links)
- Parameter-free sampled fictitious play for solving deterministic dynamic programming problems (Q289136) (← links)
- General theory of fuzzy connectedness segmentations (Q294400) (← links)
- A maximum entropy fixed-point route choice model for route correlation (Q296288) (← links)
- Fast and fine quickest path algorithm (Q296816) (← links)
- Trip-based path algorithms using the transit network hierarchy (Q298925) (← links)
- Planning safe navigation routes through mined waters (Q299795) (← links)
- Optimal deployment of alternative fueling stations on transportation networks considering deviation paths (Q301092) (← links)
- A hybrid algorithm for constrained order packing (Q301159) (← links)
- Algebraic dynamic programming for multiple context-free grammars (Q301600) (← links)
- On estimation of the diagonal elements of a sparse precision matrix (Q302437) (← links)
- Approximate tree decompositions of planar graphs in linear time (Q306256) (← links)
- Using persistent homology and dynamical distances to analyze protein binding (Q306659) (← links)
- Algorithms for overcoming the curse of dimensionality for certain Hamilton-Jacobi equations arising in control theory and elsewhere (Q313401) (← links)
- Approximations for constructing tree-form structures using specific material with fixed length (Q315511) (← links)
- Network repair crew scheduling and routing for emergency relief distribution problem (Q320672) (← links)
- Fuel emissions optimization in vehicle routing problems with time-varying speeds (Q320788) (← links)
- Decomposition approaches for recoverable robust optimization problems (Q322768) (← links)
- Optimal design of compact and functionally contiguous conservation management areas (Q322808) (← links)
- The constrained shortest path problem with stochastic correlated link travel times (Q323479) (← links)
- Work-troop scheduling for road network accessibility after a major earthquake (Q325475) (← links)
- An adaptive multi-spline refinement algorithm in simulation based sailboat trajectory optimization using onboard multi-core computer systems (Q326224) (← links)
- A simple algorithm for replacement paths problem (Q327668) (← links)
- Survey of robot 3D path planning algorithms (Q328367) (← links)
- Convergence rate for the ordered upwind method (Q333193) (← links)
- hCHAC: a family of MOACO algorithms for the resolution of the bi-criteria military unit pathfinding problem (Q336313) (← links)
- A memetic algorithm for the travelling salesperson problem with hotel selection (Q336356) (← links)
- Enhanced compact models for the connected subgraph problem and for the shortest path problem in digraphs with negative cycles (Q336550) (← links)
- Finding the \(K\) shortest paths in a time-schedule network with constraints on arcs (Q336675) (← links)
- Location-arc routing problem: heuristic approaches and test instances (Q336937) (← links)
- An adaptive zero-variance importance sampling approximation for static network dependability evaluation (Q336964) (← links)
- A lower bound for the quickest path problem (Q337093) (← links)
- Dominance rules for the optimal placement of a finite-size facility in an existing layout (Q337129) (← links)
- The multi-depot vehicle routing problem with heterogeneous vehicle fleet: formulation and a variable neighborhood search implementation (Q337237) (← links)
- A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem (Q337491) (← links)
- PH-graphs for analyzing shortest path problems with correlated traveling times (Q337529) (← links)
- Solid T-spline construction from boundary representations for genus-zero geometry (Q337897) (← links)
- A Dijkstra-type algorithm for dynamic games (Q338209) (← links)
- Implementation of a three-stage approach for the dynamic resource-constrained shortest-path sub-problem in branch-and-price (Q339594) (← links)
- A simulated annealing for multi-criteria network path problems (Q339658) (← links)
