Pages that link to "Item:Q4294732"

The following pages link to Strongly Polynomial Algorithms for the Quadratic Transportation Problem with a Fixed Number of Sources (Q4294732):

Displaying 24 items.

• Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies (Q319183) (← links)
• A quasi-linear algorithm for calculating the infimal convolution of convex quadratic functions (Q415217) (← links)
• A polynomial case of convex integer quadratic programming problems with box integer constraints (Q496616) (← links)
• Fast algorithm for singly linearly constrained quadratic programs with box-like constraints (Q513719) (← links)
• Simple solution methods for separable mixed linear and quadratic knapsack problem (Q693416) (← links)
• A binary integer program to maximize the agreement between partitions (Q734372) (← links)
• A Newton's method for the continuous quadratic knapsack problem (Q892383) (← links)
• Variable fixing algorithms for the continuous quadratic Knapsack problem (Q927220) (← links)
• A linear-time algorithm for the bottleneck transportation problem with a fixed number of sources (Q1306364) (← links)
• Strongly polynomial time algorithms for certain concave minimization problems on networks (Q1317011) (← links)
• A strongly polynomial algorithm for the transportation problem (Q1804365) (← links)
• A nonlinear knapsack problem (Q1905070) (← links)
• A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables (Q1919095) (← links)
• Variable fixing method by weighted average for the continuous quadratic knapsack problem (Q2074624) (← links)
• A survey on the continuous nonlinear resource allocation problem (Q2456404) (← links)
• Breakpoint searching algorithms for the continuous quadratic knapsack problem (Q2465658) (← links)
• Complexity and algorithms for nonlinear optimization problems (Q2480263) (← links)
• Faster strongly polynomial algorithms for the unbalanced transportation problem and assignment problem with Monge costs (Q2811304) (← links)
• A strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives (Q2817799) (← links)
• Efficient Minimum Cost Matching and Transportation Using the Quadrangle Inequality (Q4840222) (← links)
• Efficient projection onto the intersection of a half-space and a box-like set and its generalized Jacobian (Q5077165) (← links)
• On a Reduction for a Class of Resource Allocation Problems (Q5087712) (← links)
• An Efficient Hybrid Algorithm for the Separable Convex Quadratic Knapsack Problem (Q5270754) (← links)
• Effective algorithms for separable nonconvex quadratic programming with one quadratic and box constraints (Q6166654) (← links)