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.
- Optimizing access to drinking water in remote areas. Application to Nepal (Q2669783) (← links)
- The restricted Chinese postman problems with penalties (Q2670442) (← links)
- A fully polynomial time approximation scheme for the probability maximizing shortest path problem (Q2670558) (← links)
- A survey of unsupervised learning methods for high-dimensional uncertainty quantification in black-box-type problems (Q2672767) (← links)
- Design of path planning and tracking control of quadrotor (Q2673425) (← links)
- Finding \(K\) dissimilar paths: single-commodity and discretized flow formulations (Q2676343) (← links)
- Coastline matching via a graph-based approach (Q2677371) (← links)
- Robot path planning based on concept lattice (Q2677852) (← links)
- Feature-aware reconstruction of trimmed splines using Ricci flow with metric optimization (Q2679326) (← links)
- Lipschitz regularization for fracture: the Lip-field approach (Q2679331) (← links)
- Characterizing diffusion processes in city traffic (Q2679909) (← links)
- The influence of maximum \((s,t)\)-cuts on the competitiveness of deterministic strategies for the Canadian traveller problem (Q2680863) (← links)
- Qubits' mapping and routing for NISQ on variability of quantum gates (Q2684345) (← links)
- Algorithms for the Pareto solution of the multicriteria traffic equilibrium problem with capacity constraints of arcs (Q2691347) (← links)
- Investigations on the influence of the boundary conditions when computing the effective crack energy of random heterogeneous materials using fast marching methods (Q2692886) (← links)
- Finding cheapest deadline paths (Q2695315) (← links)
- Construction of minimum edge-fault tolerant connected dominating set in a general graph (Q2698012) (← links)
- Novel cooling channel shapes in pressure die casting (Q2712168) (← links)
- Using chaos to generate variations on movement sequences (Q2727157) (← links)
- Point-to-point and multi-goal path planning for industrial robots (Q2745507) (← links)
- Multiple routing strategies in a labelled network (Q2765602) (← links)
- The pilot method: a strategy for heuristic repetition with application to the Steiner problem in graphs (Q2766100) (← links)
- Parameter estimation for resin transfer molding. (Q2777709) (← links)
- Global path planning of mobile robots using a memetic algorithm (Q2792934) (← links)
- Exact and heuristic algorithms for capacitated vehicle routing problems with quadratic costs structure (Q2802246) (← links)
- Computation of the optimal value function in time-dependent networks (Q2811299) (← links)
- A survey of resource constrained shortest path problems: exact solution approaches (Q2811308) (← links)
- A stochastic inventory routing problem for infectious medical waste collection (Q2811325) (← links)
- Core routing on dynamic time-dependent road networks (Q2815439) (← links)
- Fuzzy multi-objective chance-constrained programming model for hazardous materials transportation (Q2817091) (← links)
- Efficient computation of shortest paths in time-dependent multi-modal networks (Q2828194) (← links)
- Candidate sets for alternative routes in road networks (Q2828197) (← links)
- Dynamic maintenance of a shortest-path tree on homogeneous batches of updates: new algorithms and experiments (Q2828206) (← links)
- A novel linear algorithm for shortest paths in networks (Q2836524) (← links)
- Polynomial time recognition of uniform cocircuit graphs (Q2840512) (← links)
- Optimizing the throughput, service rate, and buffer allocation in finite queueing networks (Q2840535) (← links)
- A genetic algorithms to solve the bicriteria shortest path problem (Q2861502) (← links)
- Failure disjoint paths (Q2861540) (← links)
- Algorithmic techniques for maintaining shortest routes in dynamic networks (Q2864176) (← links)
- On Reynolds' dilatancy and shear band evolution: a new perspective (Q2866050) (← links)
- Dynamically Maintaining Shortest Path Trees under Batches of Updates (Q2868652) (← links)
- A mean-risk model for the traffic assignment problem with stochastic travel times (Q2875605) (← links)
- Search for the best compromise solution on multiobjective shortest path problem (Q2883625) (← links)
- Lagrangean decomposition/relaxation for the routing and wavelength assignment problem (Q2892159) (← links)
- Bidirectional \(A^*\) search on time-dependent road networks (Q2892160) (← links)
- Multiscale method for characterization of porous microstructures and their impact on macroscopic effective permeability (Q2894868) (← links)
- Modularity Maximization and Tree Clustering: Novel Ways to Determine Effective Geographic Borders (Q2913782) (← links)
- Path Problems in Complex Networks (Q2913787) (← links)
- A dual-response strategy for global logistics under uncertainty: a case study of a third-party logistics company (Q2914202) (← links)
- A Linear Logic Programming Language for Concurrent Programming over Graph Structures (Q2931260) (← links)
