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.
- The telephonic switching centre network problem: Formalization and computational experience (Q1093558) (← links)
- Experiments with parallel algorithms for combinatorial problems (Q1095034) (← links)
- Optimal piecewise linear motion of an object among obstacles (Q1098643) (← links)
- A new approach for crew pairing problems by column generation with an application to air transportation (Q1098764) (← links)
- Scheduling jobs with fixed start and end times (Q1098765) (← links)
- An \(O(ND)\) difference algorithm and its variations (Q1099955) (← links)
- Minimum deviation problems (Q1104246) (← links)
- On the use of ordered sets in problems of comparison and consensus of classifications (Q1104668) (← links)
- Shortest path between two simple polygons (Q1107993) (← links)
- Rectilinear shortest paths in the presence of rectangular barriers (Q1109046) (← links)
- A parallel shortest path algorithm (Q1112621) (← links)
- A computational study of efficient shortest path algorithms (Q1112733) (← links)
- An algorithmic approach to some problems in terrain navigation (Q1116366) (← links)
- An edge elimination test for the Steiner problem in graphs (Q1116902) (← links)
- An approximation algorithm for the TSP (Q1119485) (← links)
- Polyhedra of regular p-nary group problems (Q1121172) (← links)
- Reducing the hierarchical network design problem (Q1121181) (← links)
- State-variable planning under structural restrictions: algorithms and complexity (Q1128767) (← links)
- An optimal design of piping route in a CAD system for power plant (Q1129476) (← links)
- Depth-first K-trees and critical path analysis (Q1138380) (← links)
- Computation of the center and diameter of outerplanar graphs (Q1142786) (← links)
- An O(m log D) algorithm for shortest paths (Q1145158) (← links)
- A fast algorithm for Steiner trees (Q1145507) (← links)
- Complexity of spanning tree problems: Part I (Q1145635) (← links)
- Finding minimal spanning trees in a Euclidean coordinate space (Q1154282) (← links)
- A new algorithm to find the shortest paths between all pairs of nodes (Q1157967) (← links)
- A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation (Q1158108) (← links)
- On the connectivity of a network (Q1159084) (← links)
- Parallel algorithms for the single source shortest path problem (Q1162156) (← links)
- A bicriterion shortest path algorithm (Q1166423) (← links)
- Minimal spanning trees and partial sorting (Q1166430) (← links)
- Maximum flow in a network with fuzzy arc capacities (Q1167060) (← links)
- The ellipsoid method and its consequences in combinatorial optimization (Q1168215) (← links)
- The symmetric traveling salesman problem and edge exchanges in minimal 1- trees (Q1170119) (← links)
- The application of discrete programming to the design of delivery systems in large agglomerations (Q1172536) (← links)
- A new algorithm for finding the shortest path between a specified pair of nodes in a graph of nonnegative arcs (Q1173022) (← links)
- An algorithm to evaluate public transportation stops for minimizing passenger walking distance (Q1173527) (← links)
- Accessibility: A criterion for regularity and hierarchy in visual pattern codes (Q1176279) (← links)
- Efficient algorithms for divisive hierarchical clustering with the diameter criterion (Q1176597) (← links)
- Polynomial algorithms to finite Veber problem for a tree network (Q1176800) (← links)
- The space reduction method: A method to reduce the size of search spaces (Q1178225) (← links)
- Computing shortest paths in networks derived from recurrence relations (Q1179746) (← links)
- The multi-weighted Steiner tree problem (Q1179753) (← links)
- A fully polynomial time approximation scheme for minimum cost-reliability ratio problems (Q1183334) (← links)
- Shortest path and closure algorithms for banded matrices (Q1183497) (← links)
- Stability of an optimal schedule (Q1183618) (← links)
- On an instance of the inverse shortest paths problem (Q1184336) (← links)
- Shortest path algorithms: A computational study with the C programming language (Q1184466) (← links)
- A procedure to adjust transit trip departure times through minimizing the maximum headway (Q1186920) (← links)
- \(L_ 1\) shortest paths among polygonal obstacles in the plane (Q1188116) (← links)
