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.
- Finding shorter cycles in a weighted graph (Q5964975) (← links)
- On the complexity of the cable-trench problem (Q6048437) (← links)
- Supervised model predictive control of large‐scale electricity networks via clustering methods (Q6053667) (← links)
- Heuristic search of optimal machine teaching curricula (Q6053815) (← links)
- Reconfigurable timed graphs for the design of optimal scheduling in uncertain environments based on transition-timed Petri net (Q6053940) (← links)
- Coloring rings (Q6055414) (← links)
- Metaheuristics for the work‐troops scheduling problem (Q6056168) (← links)
- FlowLoc problems with maximum excess flow (Q6059592) (← links)
- A solution approach for multi‐trip vehicle routing problems with time windows, fleet sizing, and depot location (Q6065845) (← links)
- Geodesic simplex based multiobjective endmember extraction for nonlinear hyperspectral mixtures (Q6066176) (← links)
- A note on computational aspects of the Steiner traveling salesman problem (Q6066594) (← links)
- Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View (Q6068262) (← links)
- Logic-based Benders decomposition for wildfire suppression (Q6068720) (← links)
- DEA‐based centralized resource allocation with network flows (Q6070127) (← links)
- Constrained shortest path tour problem: models, valid inequalities, and Lagrangian heuristics (Q6070419) (← links)
- Performance comparison of some centrality measures used in detecting anomalies in directed social networks (Q6073570) (← links)
- A novel approach for modeling order picking paths (Q6076484) (← links)
- Path planning of mobile robot in unknown dynamic continuous environment using reward‐modified deep <scp>Q</scp>‐network (Q6078830) (← links)
- A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty (Q6079879) (← links)
- On the selection of an optimal outer approximation of a coherent lower probability (Q6081356) (← links)
- The Optimized Algorithm of Finding the Shortest Path in a Multiple Graph (Q6081673) (← links)
- The constrained forward shortest path tour problem: Mathematical modeling and GRASP approximate solutions (Q6087141) (← links)
- A novel pseudo‐polynomial approach for shortest path problems (Q6087148) (← links)
- Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems (Q6090149) (← links)
- Secure and efficient routing on nodes, edges, and arcs of simple‐graphs and of multi‐graphs (Q6092634) (← links)
- Effects of update frequencies in a dynamic capacitated arc routing problem (Q6092644) (← links)
- Online learning of network bottlenecks via minimax paths (Q6097144) (← links)
- On improving the regional transportation efficiency based on federated learning (Q6099854) (← links)
- On the all-pairs shortest path algorithm of Moffat and Takaoka (Q6102300) (← links)
- Variance-covariance from a metropolis chain on a curved, singular manifold (Q6108279) (← links)
- Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication (Q6108693) (← links)
- Solving simultaneous target assignment and path planning efficiently with time-independent execution (Q6108766) (← links)
- Minimum weight clustered dominating tree problem (Q6109249) (← links)
- Eco-routing problem for the delivery of perishable products (Q6109571) (← links)
- The Steiner bi-objective shortest path problem (Q6114902) (← links)
- An algebraic multiscale solver for the simulation of two-phase flow in heterogeneous and anisotropic porous media using general unstructured grids (AMS-U) (Q6135616) (← links)
- Conflict-tolerant and conflict-free multi-agent meeting (Q6136090) (← links)
- Targeted multiobjective Dijkstra algorithm (Q6139383) (← links)
- Graph-based representation of history-dependent material response in the data-driven computational mechanics framework (Q6144643) (← links)
- A Numerical Framework for Nonlinear Peridynamics on Two-Dimensional Manifolds Based on Implicit P-(EC)\(^{ {\boldsymbol k}}\) Schemes (Q6149801) (← links)
- Online learning of energy consumption for navigation of electric vehicles (Q6157210) (← links)
- On modelling and solving the shortest path problem with evidential weights (Q6160930) (← links)
- Jacobi's bound: Jacobi's results translated in Kőnig's, Egerváry's and Ritt's mathematical languages (Q6166083) (← links)
- An exact method for binary fortification games (Q6167322) (← links)
- Neural manifold analysis of brain circuit dynamics in health and disease (Q6172456) (← links)
- Schwarzschild Harmonic Path Planning and Tetrahedral Mesh Smoothing (Q6173533) (← links)
- Optimization of the risk functional to control the composition and structure of a heterogenous grouping of detection sensors in three-dimensional space (Q6178138) (← links)
- Integrated optimal scheduling and routing of repair crew and relief vehicles after disaster: a novel hybrid solution approach (Q6179230) (← links)
- Network augmentation for disaster‐resilience against geographically correlated failure (Q6179691) (← links)
- Generalized nash fairness solutions for bi‐objective minimization problems (Q6180043) (← links)
