Pages that link to "Item:Q5670480"

The following pages link to Accelerated Algorithms for Labeling and Relabeling of Trees, with Applications to Distribution Problems (Q5670480):

Displaying 31 items.

• A genuinely polynomial primal simplex algorithm for the assignment problem (Q686416) (← links)
• Basis properties and algorithmic specializations for GUB transformed networks (Q786644) (← links)
• A survey of dynamic network flows (Q917417) (← links)
• Network reoptimization procedures for multiobjective network problems (Q918434) (← links)
• Solving embedded generalized network problems (Q1058978) (← links)
• Experimental comparisons of codes for long transportation problems (Q1086155) (← links)
• Network flow problems with one side constraint: A comparison of three solution methods (Q1102172) (← links)
• The multicommodity assignment problem: A network aggregation heuristic (Q1147630) (← links)
• The symmetric traveling salesman problem and edge exchanges in minimal 1- trees (Q1170119) (← links)
• Investments in stochastic maximum flow networks (Q1176860) (← links)
• The continuous modular design problem with linear separable side constraints (Q1178998) (← links)
• An improved bounding procedure for the constrained assignment problem (Q1184442) (← links)
• Solving singularly constrained generalized network problems (Q1245161) (← links)
• The generalized alternating path algorithm for transportation problems (Q1245652) (← links)
• An augmenting path method for solving linear bottleneck transportation problems (Q1254950) (← links)
• A variant of time minimizing assignment problem (Q1303581) (← links)
• Solution of constrained generalized transportation problems using the pivot and probe algorithm (Q1820696) (← links)
• Real-time task reallocation in fault-tolerant distributed computer systems (Q1821015) (← links)
• The transportation problem with exclusionary side constraints and two branch-and-bound algorithms (Q1848594) (← links)
• The continuous multiple-modular design problem (Q3321830) (← links)
• A heuristic procedure for allocating tasks in fault-tolerant distributed computer systems (Q3328229) (← links)
• On three basic methods for solving bottleneck transportation problems (Q3657782) (← links)
• A forward network simplex algorithm for solving multiperiod network flow problems (Q3731347) (← links)
• Primal transportation and transshipment algorithms (Q3863694) (← links)
• Computational experience on an algorithm for the transportation problem with nonlinear objective functions (Q3872218) (← links)
• Arc tolerances in shortest path and network flow problems (Q3899835) (← links)
• Cost operator algorithms for the transportation problem (Q4136922) (← links)
• The alternating basis algorithm for assignment problems (Q4159200) (← links)
• The simplex method for integral multicommodity networks (Q4165174) (← links)
• Testing of a large-scale network optimization program (Q4171521) (← links)
• A streamlined simplex approach to the singly constrained transportation problem (Q4178779) (← links)