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.
- Improved algorithms for replacement paths problems in restricted graphs (Q2488196) (← links)
- Congestion network problems and related games (Q2488915) (← links)
- Product line selection and pricing analysis: impact of genetic relaxations (Q2489113) (← links)
- Lower and upper bounds on obtaining history independence (Q2490116) (← links)
- Hedging uncertainty: approximation algorithms for stochastic optimization problems (Q2494510) (← links)
- Simulating anisotropic frictional response using smoothly interpolated traction fields (Q2494953) (← links)
- A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem (Q2496041) (← links)
- A road timetable\(^{\text{TM}}\) to aid vehicle routing and scheduling (Q2496052) (← links)
- Planar graphs, negative weight edges, shortest paths, and near linear time (Q2496320) (← links)
- Heuristic shortest path algorithms for transportation applications: state of the art (Q2499162) (← links)
- A set oriented approach to optimal feedback stabilization (Q2504515) (← links)
- Graph-based normalization and whitening for non-linear data analysis (Q2506523) (← links)
- Automatic target tracking on multi-resolution terrain (Q2508297) (← links)
- Table design in dynamic programming (Q2509355) (← links)
- Security and trust for wireless autonomic networks. Systems and control methods (Q2512096) (← links)
- Shortest paths in piecewise continuous time-dependent networks (Q2517795) (← links)
- Heuristically guided search and chromosome matching (Q2542412) (← links)
- A generalized permanent label setting algorithm for the shortest path between specified nodes (Q2551743) (← links)
- Die Bestimmung kürzester Pfade in Graphen und passende Datenstrukturen (Q2552748) (← links)
- All shortest distances in a graph. An improvement to Dantzig's inductive algorithm (Q2559493) (← links)
- Zwei Verfahren zur Suche negativer Zyklen in bewerteten Digraphen (Q2561166) (← links)
- Solvable classes of discrete dynamic programming (Q2563309) (← links)
- Path problems in skew-symmetric graphs (Q2563512) (← links)
- Rectilinear paths among rectilinear obstacles (Q2563920) (← links)
- A proximal trust-region algorithm for column generation stabilization (Q2571184) (← links)
- Models and algorithm for stochastic shortest path problem (Q2572036) (← links)
- Principles of cost minimisation in wireless networks (Q2573007) (← links)
- Globally optimal geodesic active contours (Q2573045) (← links)
- Searching for spreads and packings (Q2573120) (← links)
- Exact and approximate balanced data gathering in energy-constrained sensor networks (Q2575091) (← links)
- Some inverse optimization problems under the Hamming distance (Q2575571) (← links)
- Time-dependent shortest paths through a fixed sequence of nodes: application to a travel planning problem (Q2581622) (← links)
- A fast search algorithm for the quorumcast routing problem. (Q2583541) (← links)
- A survey of the all-pairs shortest paths problem and its variants in graphs (Q2629565) (← links)
- A PTAS for the metric case of the optimum weighted source-destination communication spanning tree problem (Q2632008) (← links)
- On the connectivity preserving minimum cut problem (Q2637652) (← links)
- A general heuristic bottom-up procedure for searching AND/OR graphs (Q2639647) (← links)
- Tabu search algorithm for flexible flow path design of unidirectional automated-guided vehicle systems (Q2642307) (← links)
- On small world semiplanes with generalised Schubert cells (Q2642616) (← links)
- A partitioning algorithm for the network loading problem (Q2654332) (← links)
- Approximating the Canadian traveller problem with online randomization (Q2663716) (← links)
- Centrality analysis in a drug network and its application to drug repositioning (Q2663827) (← links)
- A dynamic path planning approach for dense, large, grid-based automated guided vehicle systems (Q2664379) (← links)
- A hybrid iterated local search heuristic for the traveling salesperson problem with hotel selection (Q2668646) (← links)
- An approach to the distributionally robust shortest path problem (Q2668652) (← links)
- An improved multiobjective shortest path algorithm (Q2669519) (← links)
- An enhanced simulation-based iterated local search metaheuristic for gravity fed water distribution network design optimization (Q2669525) (← links)
- Selective routing problem with synchronization (Q2669549) (← links)
- A discrete optimisation approach for target path planning whilst evading sensors (Q2669689) (← links)
- Exact bidirectional algorithm for the least expected travel-time path problem on stochastic and time-dependent networks (Q2669733) (← links)
