Pages that link to "Item:Q78129"

The following pages link to A note on two problems in connexion with graphs (Q78129):

Displaying 50 items.

• New scaling algorithms for the assignment and minimum mean cycle problems (Q1190599) (← links)
• The functional dimension of inductive definitions (Q1193414) (← links)
• A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems (Q1194853) (← links)
• A multicriteria Pareto-optimal path algorithm (Q1196025) (← links)
• Efficient parallel algorithms for shortest paths in planar digraphs (Q1196454) (← links)
• A graph-theoretic heuristic for designing loop-layout manufacturing systems (Q1197695) (← links)
• Locating concentrators in centralized computer networks (Q1197789) (← links)
• Planning for optimal expansion of leased line communication networks (Q1197800) (← links)
• An in-depth empirical investigation of non-greedy approaches for the minimum spanning tree problem (Q1197938) (← links)
• Reasoning about qualitative temporal information (Q1204871) (← links)
• Network reduction for the acyclic constrained shortest path problem (Q1206607) (← links)
• Priority queues with update and finding minimum spanning trees (Q1222511) (← links)
• On the optimality of algorithms for finite state sequential decision processes (Q1228439) (← links)
• Travelling time on dense networks (Q1232970) (← links)
• Algebraic structures for transitive closure (Q1238415) (← links)
• A generalization of Dijkstra's algorithm (Q1240557) (← links)
• A probabilistic minimum spanning tree algorithm (Q1241278) (← links)
• An augmenting path method for solving linear bottleneck assignment problems (Q1244171) (← links)
• Algorithms for updating minimal spanning trees (Q1247334) (← links)
• An evaluation of mathematical programming and minicomputers (Q1250035) (← links)
• On the expected behaviors of the Dijkstra's shortest path algorithm for complete graphs (Q1254332) (← links)
• An augmenting path method for solving linear bottleneck transportation problems (Q1254950) (← links)
• Numerical investigations on the maximal flow algorithm of Karzanov (Q1255886) (← links)
• An algorithm to assign pedestrian groups dispersing at public gatherings based on pedestrian-traffic modelling (Q1256390) (← links)
• The value function of a mixed integer program. II (Q1258688) (← links)
• The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm (Q1260623) (← links)
• Establishment of economic production rate, production batch size, and production sequence in manufacturing systems with flexible routing (Q1261323) (← links)
• Testing the necklace condition for shortest tours and optimal factors in the plane (Q1262765) (← links)
• An efficient algorithm for facility location in the presence of forbidden regions (Q1266516) (← links)
• \(K\)-tree/\(K\)-subgraph: A program package for minimal weighted \(K\)-cardinlity trees and subgraphs (Q1268220) (← links)
• An addendum to the hierarchical network design problem (Q1268252) (← links)
• Formal derivation of graph algorithmic programs using partition-and-recur (Q1273073) (← links)
• Shortest path algorithms for nearly acyclic directed graphs (Q1274325) (← links)
• Class Steiner trees and VLSI-design (Q1276969) (← links)
• Dynamic lot-sizing with setup cost reduction (Q1278132) (← links)
• A robustness approach to uncapacitated network design problems (Q1278322) (← links)
• Locational optimization problems solved through Voronoi diagrams (Q1278720) (← links)
• Vehicle routing with a sparse feasibility graph (Q1278726) (← links)
• Efficient associative algorithm to find the least spanning tree of a graph with a node degree constraint (Q1286282) (← links)
• Some new algorithms for location problems on networks (Q1291656) (← links)
• Neural and delay based heuristics for the Steiner problem in networks (Q1296029) (← links)
• An improved general procedure for lexicographic bottleneck problems (Q1306359) (← links)
• The Steiner problem in distributed computing systems (Q1310949) (← links)
• A shortest-path algorithm for Manhattan graphs (Q1313705) (← links)
• The lower bounds on distributed shortest paths (Q1313759) (← links)
• The fuzzy shortest path problem and its most vital arcs (Q1315875) (← links)
• A variational inequality formulation of the dynamic traffic assignment problem (Q1322146) (← links)
• Trajectory planning in \(H\)-space (Q1329421) (← links)
• Computing the jump number on semi-orders is polynomial (Q1329825) (← links)
• Computing minimum length paths of a given homotopy class (Q1330462) (← links)