Pages that link to "Item:Q3890442"

The following pages link to Technical Note—Computational Comparison among Three Multicommodity Network Flow Algorithms (Q3890442):

Displaying 15 items.

• Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies (Q319183) (← links)
• Column generation algorithms for nonlinear optimization. II: Numerical investigations (Q609805) (← links)
• A survey of dynamic network flows (Q917417) (← links)
• Analysis of relaxations for the multi-item capacitated lot-sizing problem (Q922259) (← links)
• A unified method for a class of convex separable nonlinear knapsack problems (Q930930) (← links)
• Reoptimization procedures for bounded variable primal simplex network algorithms (Q1066818) (← links)
• The multicommodity assignment problem: A network aggregation heuristic (Q1147630) (← links)
• On the continuous quadratic knapsack problem (Q1194858) (← links)
• An implementation of linear and nonlinear multicommodity network flows (Q1268228) (← links)
• Multicommodity network flows: The impact of formulation on decomposition (Q1321667) (← links)
• A survey on the continuous nonlinear resource allocation problem (Q2456404) (← links)
• A linear model for compound multicommodity network flow problems (Q2654399) (← links)
• A polynomially bounded algorithm for a singly constrained quadratic program (Q3899825) (← links)
• (Q5020878) (← links)
• Multi-commodity flow problem on lossy network with partial lane reversals (Q6170570) (← links)