Enhancements Of Spanning Tree Labelling Procedures For Network Optimization
From MaRDI portal
Publication:4189072
DOI10.1080/03155986.1979.11731713zbMath0403.90083OpenAlexW1545925697MaRDI QIDQ4189072
Fred Glover, Richard S. Barr, Darwin D. Klingman
Publication date: 1979
Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03155986.1979.11731713
Related Items
The family constrained network problem ⋮ Variable neighborhood search for the degree-constrained minimum spanning tree problem ⋮ Network flow problems with one side constraint: A comparison of three solution methods ⋮ Applying steepest-edge techniques to a network primal-dual algorithm ⋮ An extreme‐point tabu‐search algorithm for fixed‐charge network problems ⋮ A comparative study of heuristics for a two-level routing-location problem ⋮ A survey of dynamic network flows ⋮ Parallel arc-allocation algorithms for optimizing generalized networks ⋮ Network reoptimization procedures for multiobjective network problems ⋮ An in-depth empirical investigation of non-greedy approaches for the minimum spanning tree problem ⋮ An improved branch and bound algorithm for minimum concave cost network flow problems ⋮ My experiences as a student and researcher in OR during the 1960's and 70's ⋮ Primal transportation and transshipment algorithms ⋮ The alternating basis algorithm for assignment problems ⋮ An evaluation of mathematical programming and minicomputers ⋮ New labeling procedures for the basis graph in generalized networks ⋮ Reoptimization procedures for bounded variable primal simplex network algorithms ⋮ Representing inverses in pure network flow optimization
