Pages that link to "Item:Q3496126"

The following pages link to A Parallel Projection for the Multicommodity Network Model (Q3496126):

Displaying 18 items.

• Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies (Q319183) (← links)
• A Newton's method for the continuous quadratic knapsack problem (Q892383) (← links)
• Variable fixing algorithms for the continuous quadratic Knapsack problem (Q927220) (← links)
• Nonsmooth optimization methods for parallel decomposition of multicommodity flow problems (Q1308671) (← links)
• Quadratic resource allocation with generalized upper bounds (Q1376263) (← links)
• The nonlinear knapsack problem - algorithms and applications (Q1600928) (← links)
• Variable fixing method by weighted average for the continuous quadratic knapsack problem (Q2074624) (← links)
• Decision model and analysis for investment interest expense deduction and allocation (Q2379558) (← links)
• A survey on the continuous nonlinear resource allocation problem (Q2456404) (← links)
• Breakpoint searching algorithms for the continuous quadratic knapsack problem (Q2465658) (← links)
• A relaxed projection method for general integer quadratic knapsack problem. (Q2477123) (← links)
• Symmetric and asymmetric parallelization of a cost-decomposition algorithm for multicommodity flow problems (Q2884565) (← links)
• Parallel Decomposition of Multicommodity Network Flows Using a Linear-Quadratic Penalty Algorithm (Q4030924) (← links)
• (Q5020878) (← links)
• An Efficient Hybrid Algorithm for the Separable Convex Quadratic Knapsack Problem (Q5270754) (← links)
• A pegging algorithm for the nonlinear resource allocation problem (Q5959400) (← links)
• A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables (Q6043104) (← links)
• Effective algorithms for separable nonconvex quadratic programming with one quadratic and box constraints (Q6166654) (← links)