Accelerated Algorithms for Labeling and Relabeling of Trees, with Applications to Distribution Problems

DOI10.1145/321724.321734zbMath0255.90071OpenAlexW2053993781MaRDI QIDQ5670480

No author found.

Publication date: 1972

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/321724.321734

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Numerical mathematical programming methods (65K05) Deterministic network models in operations research (90B10)

Related Items

Experimental comparisons of codes for long transportation problems, Network flow problems with one side constraint: A comparison of three solution methods, A forward network simplex algorithm for solving multiperiod network flow problems, The multicommodity assignment problem: A network aggregation heuristic, A survey of dynamic network flows, Network reoptimization procedures for multiobjective network problems, The symmetric traveling salesman problem and edge exchanges in minimal 1- trees, Investments in stochastic maximum flow networks, The continuous modular design problem with linear separable side constraints, An improved bounding procedure for the constrained assignment problem, A genuinely polynomial primal simplex algorithm for the assignment problem, The continuous multiple-modular design problem, A heuristic procedure for allocating tasks in fault-tolerant distributed computer systems, Cost operator algorithms for the transportation problem, Primal transportation and transshipment algorithms, The alternating basis algorithm for assignment problems, Computational experience on an algorithm for the transportation problem with nonlinear objective functions, Solving singularly constrained generalized network problems, The simplex method for integral multicommodity networks, The generalized alternating path algorithm for transportation problems, Testing of a large-scale network optimization program, An augmenting path method for solving linear bottleneck transportation problems, A streamlined simplex approach to the singly constrained transportation problem, Arc tolerances in shortest path and network flow problems, Solution of constrained generalized transportation problems using the pivot and probe algorithm, Real-time task reallocation in fault-tolerant distributed computer systems, On three basic methods for solving bottleneck transportation problems, Basis properties and algorithmic specializations for GUB transformed networks, The transportation problem with exclusionary side constraints and two branch-and-bound algorithms, A variant of time minimizing assignment problem, Solving embedded generalized network problems