Pages that link to "Item:Q4189072"

The following pages link to Enhancements Of Spanning Tree Labelling Procedures For Network Optimization (Q4189072):

Displaying 18 items.

• My experiences as a student and researcher in OR during the 1960's and 70's (Q537599) (← links)
• An improved branch and bound algorithm for minimum concave cost network flow problems (Q686988) (← links)
• A survey of dynamic network flows (Q917417) (← links)
• Parallel arc-allocation algorithms for optimizing generalized networks (Q918433) (← links)
• Network reoptimization procedures for multiobjective network problems (Q918434) (← links)
• New labeling procedures for the basis graph in generalized networks (Q1062633) (← links)
• Reoptimization procedures for bounded variable primal simplex network algorithms (Q1066818) (← links)
• Representing inverses in pure network flow optimization (Q1068691) (← links)
• The family constrained network problem (Q1076616) (← links)
• Network flow problems with one side constraint: A comparison of three solution methods (Q1102172) (← links)
• A comparative study of heuristics for a two-level routing-location problem (Q1143306) (← links)
• An in-depth empirical investigation of non-greedy approaches for the minimum spanning tree problem (Q1197938) (← links)
• An evaluation of mathematical programming and minicomputers (Q1250035) (← links)
• Variable neighborhood search for the degree-constrained minimum spanning tree problem (Q1348252) (← links)
• Applying steepest-edge techniques to a network primal-dual algorithm (Q1362969) (← links)
• Primal transportation and transshipment algorithms (Q3863694) (← links)
• The alternating basis algorithm for assignment problems (Q4159200) (← links)
• An extreme‐point tabu‐search algorithm for fixed‐charge network problems (Q6087082) (← links)