Enhancements Of Spanning Tree Labelling Procedures For Network Optimization
From MaRDI portal
Publication:4189072
Cited in
(18)- A survey of dynamic network flows
- An improved branch and bound algorithm for minimum concave cost network flow problems
- New labeling procedures for the basis graph in generalized networks
- Representing inverses in pure network flow optimization
- Network reoptimization procedures for multiobjective network problems
- Parallel arc-allocation algorithms for optimizing generalized networks
- The family constrained network problem
- Variable neighborhood search for the degree-constrained minimum spanning tree problem
- Primal transportation and transshipment algorithms
- An in-depth empirical investigation of non-greedy approaches for the minimum spanning tree problem
- An evaluation of mathematical programming and minicomputers
- A comparative study of heuristics for a two-level routing-location problem
- The alternating basis algorithm for assignment problems
- Network flow problems with one side constraint: A comparison of three solution methods
- Reoptimization procedures for bounded variable primal simplex network algorithms
- Applying steepest-edge techniques to a network primal-dual algorithm
- My experiences as a student and researcher in OR during the 1960's and 70's
- An extreme‐point tabu‐search algorithm for fixed‐charge network problems
This page was built for publication: Enhancements Of Spanning Tree Labelling Procedures For Network Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4189072)
