The following pages link to (Q3734141):
Displaying 14 items.
- A simulated annealing for multi-criteria network path problems (Q339658) (← links)
- On a particular quadratic network problem (Q580183) (← links)
- Maximum outflow in generalized flow networks (Q583080) (← links)
- An algorithm for ranking paths that may contain cycles (Q759658) (← links)
- On a special class of bicriterion path problems (Q793640) (← links)
- The structure of bases in bicircular matroids (Q912110) (← links)
- Use of penalties in a branch and bound procedure for the fixed charge transportation problem (Q915648) (← links)
- Solving many linear programs that differ only in the right-hand side (Q1108193) (← links)
- Probabilistic shortest path problems with budgetary constraints (Q1113810) (← links)
- A decomposition algorithm to determine the maximum flow in a generalized network (Q1121762) (← links)
- Recognizing hidden bicircular networks (Q1208462) (← links)
- An algorithm for the ranking of shortest paths (Q1309941) (← links)
- Activity nets: A guided tour through some recent developments (Q1388902) (← links)
- Optimization problems of transportation in communication networks with variable capacities (Q1743204) (← links)
