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.
- Uncertain programming models for multi-objective shortest path problem with uncertain parameters (Q2153668) (← links)
- Dealing with time in the multiple traveling salespersons problem with moving targets (Q2155136) (← links)
- The multiple Steiner TSP with order constraints: complexity and optimization algorithms (Q2156919) (← links)
- Input-output networks offer new insights of economic structure (Q2161726) (← links)
- Faster goal-oriented shortest path search for bulk and incremental detailed routing (Q2164671) (← links)
- Simple odd \(\beta \)-cycle inequalities for binary polynomial optimization (Q2164692) (← links)
- Deep policy dynamic programming for vehicle routing problems (Q2170197) (← links)
- On the analysis of optimization problems in arc-dependent networks (Q2172089) (← links)
- Time-optimal control of large-scale systems of systems using compositional optimization (Q2177769) (← links)
- Parameterized complexity of conflict-free matchings and paths (Q2182094) (← links)
- Robust routing, its price, and the tradeoff between routing robustness and travel time reliability in road networks (Q2183323) (← links)
- The median routing problem for simultaneous planning of emergency response and non-emergency jobs (Q2183877) (← links)
- Application of diffuse source functions for improved flow upscaling (Q2185963) (← links)
- Netscan: a procedure for generating reaction networks by size (Q2186531) (← links)
- Equilibria in routing games with edge priorities (Q2190414) (← links)
- Conflict-free routing of multi-stop warehouse trucks (Q2192993) (← links)
- Global minimum for a Finsler elastica minimal path approach (Q2193761) (← links)
- Algorithms for the minmax regret path problem with interval data (Q2198244) (← links)
- Bayesian generalized network design (Q2202025) (← links)
- Two polynomial time graph labeling algorithms optimizing max-norm-based objective functions (Q2203352) (← links)
- How do workers of the primitively eusocial wasp \textit{Ropalidia marginata} detect the presence of their queens? (Q2210096) (← links)
- A computational model for spatial cognition combining dorsal and ventral hippocampal place field maps: multiscale navigation (Q2210932) (← links)
- Hermitian normalized Laplacian matrix for directed networks (Q2215051) (← links)
- Endogenous stochastic optimisation for relief distribution assisted with unmanned aerial vehicles (Q2215567) (← links)
- Unsupervised representation learning with minimax distance measures (Q2217399) (← links)
- A parallel bio-inspired shortest path algorithm (Q2218449) (← links)
- Algorithm for overcoming the curse of dimensionality for state-dependent Hamilton-Jacobi equations (Q2220578) (← links)
- Minimum-weight combinatorial structures under random cost-constraints (Q2223474) (← links)
- Facing robustness as a multi-objective problem: a bi-objective shortest path problem in smart regions (Q2224924) (← links)
- Network flow with intermediate storage: models and algorithms (Q2226495) (← links)
- The single train shortest route problem in a railyard (Q2230785) (← links)
- Shortest path network problems with stochastic arc weights (Q2230798) (← links)
- Two new bidirectional search algorithms (Q2231042) (← links)
- Bounded-degree light approximate shortest-path trees in doubling metrics (Q2235274) (← links)
- Towards untrimmed NURBS: CAD embedded reparameterization of trimmed B-rep geometry using frame-field guided global parameterization (Q2236168) (← links)
- Using projection-based clustering to find distance- and density-based clusters in high-dimensional data (Q2236772) (← links)
- An exact approach for the personnel task rescheduling problem with task retiming (Q2242295) (← links)
- Ising formulations of some graph-theoretic problems in psychological research: models and methods (Q2244634) (← links)
- Computing the largest H-eigenvalue of large-scale tensors generated from directed hypergraphs (Q2244993) (← links)
- Dijkstra's algorithm and L-concave function maximization (Q2248748) (← links)
- Quickest path queries on transportation network (Q2249042) (← links)
- Distance spectra of graphs: a survey (Q2250935) (← links)
- Self-similar fractals: an algorithmic point of view (Q2254823) (← links)
- Sufficient conditions for uniform bounds in abstract polymer systems and explorative partition schemes (Q2254912) (← links)
- Approximation algorithms for constructing some required structures in digraphs (Q2255946) (← links)
- Gastroscopic image graph: application to noninvasive multitarget tracking under gastroscopy (Q2262724) (← links)
- A two-criterion lexicographic algorithm for finding all shortest paths in networks (Q2263347) (← links)
- Minimizing maximum risk for fair network connection with interval data (Q2267272) (← links)
- Fast paths in large-scale dynamic road networks (Q2268926) (← links)
- From normal surfaces to normal curves to geodesics on surfaces (Q2275137) (← links)
