The following pages link to (Q4742310):
Displayed 25 items.
- Applications of lattice theory to graph decomposition (Q911609) (← links)
- The quickest path problem (Q912765) (← links)
- Richard Bellman's contributions to computer science (Q1081590) (← links)
- A decomposition algorithm for multi-terminal network flows (Q1085042) (← links)
- An algorithm for determining an opaque minimal forest of a convex polygon (Q1107998) (← links)
- A branch-and-bound algorithm to solve the equal-execution-time job scheduling problem with precedence constraint and profile (Q1121783) (← links)
- A polynomial-time algorithm for message routing in hierarchical communication networks (Q1129965) (← links)
- Ancestor tree for arbitrary multi-terminal cut functions (Q1179737) (← links)
- Testing the optimality of alphabetic trees (Q1186607) (← links)
- I/O- and CPU-optimal recognition of strongly connected components (Q1209333) (← links)
- The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm (Q1260623) (← links)
- The single most vital arc in the most economical path problem -- a parametric analysis (Q1317083) (← links)
- Dynamic programming and graph optimization problems (Q1327180) (← links)
- Efficient inference in Bayes networks as a combinatorial optimization problem (Q1332727) (← links)
- Characterizing the flow equivalent trees of a network (Q1811121) (← links)
- A label-setting algorithm for finding a quickest path (Q1886505) (← links)
- Minimizing the total cost in an integrated vendor-managed inventory system (Q2491326) (← links)
- GENERALIZED FUNDAMENTAL EQUATION IN PANSYSTEMS NETWORK ANALYSIS (Q3738956) (← links)
- Foreground memory management in data path synthesis (Q4014019) (← links)
- HIGH-PERFORMANCE COMPUTING FOR ROBOT DYNAMIC PARAMETERS LEARNING (Q4301870) (← links)
- An approach to production planning and scheduling in cyclically scheduled manufacturing systems (Q4394238) (← links)
- THE DERIVATION OF UNIFORM RECURRENCE EQUATIONS FOR THE KNAPSACK PROBLEM (Q4819960) (← links)
- DEVELOPMENT OF A NEW THEORY WITH GENERALITY TO UNIFY DIVERSE DISCIPLINES OF KNOWLEDGE AND CAPABILITY OF APPLICATIONS (Q4861646) (← links)
- Optimal binary search trees (Q5906917) (← links)
- A sum of disjoint products algorithm for reliability evaluation of flow networks (Q5935396) (← links)