Pages that link to "Item:Q3899825"
From MaRDI portal
The following pages link to A polynomially bounded algorithm for a singly constrained quadratic program (Q3899825):
Displaying 50 items.
- An efficient global algorithm for a class of indefinite separable quadratic programs (Q304230) (← links)
- Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies (Q319183) (← links)
- On the solution of multidimensional convex separable continuous knapsack problem with bounded variables (Q319990) (← links)
- Fast algorithm for singly linearly constrained quadratic programs with box-like constraints (Q513719) (← links)
- Approximation algorithms for indefinite quadratic programming (Q687094) (← links)
- A breakpoint search approach for convex resource allocation problems with bounded variables (Q691476) (← links)
- Simple solution methods for separable mixed linear and quadratic knapsack problem (Q693416) (← links)
- A polynomial algorithm for minimum quadratic cost flow problems (Q761341) (← links)
- An equivalent subproblem relaxation for improving the solution of a class of transportation scheduling problems (Q792216) (← links)
- An O(n) algorithm for quadratic knapsack problems (Q797501) (← links)
- The stochastic linear continuous type knapsack problem: A generalized P model (Q800831) (← links)
- Convex programming with single separable constraint and bounded variables (Q885824) (← links)
- A Newton's method for the continuous quadratic knapsack problem (Q892383) (← links)
- Towards a strongly polynomial algorithm for strictly convex quadratic programs: An extension of Tardos' algorithm (Q909582) (← links)
- On a discrete nonlinear and nonseparable knapsack problem (Q920849) (← links)
- An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds (Q922953) (← links)
- Variable fixing algorithms for the continuous quadratic Knapsack problem (Q927220) (← links)
- Solving embedded generalized network problems (Q1058978) (← links)
- Projections onto order simplexes (Q1065504) (← links)
- The asymmetric m-travelling salesman problem: A duality based branch-and- bound algorithm (Q1083379) (← links)
- The equal flow problem (Q1108179) (← links)
- Algorithms for bound constrained quadratic programming problems (Q1122320) (← links)
- Local minima for indefinite quadratic knapsack problems (Q1186274) (← links)
- On the continuous quadratic knapsack problem (Q1194858) (← links)
- Capacity planning in manufacturing and computer networks (Q1278227) (← links)
- A dual ascent method for the portfolio selection problem with multiple constraints and linked proposals (Q1296022) (← links)
- An \(O(n^ 2)\) active set method for solving a certain parametric quadratic program (Q1321144) (← links)
- An incremental primal-dual method for generalized networks (Q1342940) (← links)
- Applying steepest-edge techniques to a network primal-dual algorithm (Q1362969) (← links)
- Quadratic resource allocation with generalized upper bounds (Q1376263) (← links)
- On properties of multi-dimensional statistical tables (Q1410284) (← links)
- The nonlinear knapsack problem - algorithms and applications (Q1600928) (← links)
- Nonlinear integer programming for optimal allocation in stratified sampling (Q1610189) (← links)
- A heuristic solution procedure for multicommodity integer flows (Q1905088) (← links)
- An efficient Hessian based algorithm for singly linearly and box constrained least squares regression (Q2049105) (← links)
- On the long-only minimum variance portfolio under single factor model (Q2060386) (← links)
- Variable fixing method by weighted average for the continuous quadratic knapsack problem (Q2074624) (← links)
- The geometric properties of a class of nonsymmetric cones (Q2221076) (← links)
- Minimizing a stochastic convex function subject to stochastic constraints and some applications (Q2229571) (← links)
- On the solution of concave knapsack problems (Q2276878) (← links)
- Application of the dual active set algorithm to quadratic network optimization (Q2366828) (← links)
- Decision model and analysis for investment interest expense deduction and allocation (Q2379558) (← links)
- An optimal subgradient algorithm for large-scale bound-constrained convex optimization (Q2408897) (← links)
- Minimum variance allocation among constrained intervals (Q2423792) (← links)
- Issues in the implementation of the DSD algorithm for the traffic assignment problem (Q2433525) (← links)
- Finding the projection onto the intersection of a closed half-space and a variable box (Q2450616) (← 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)
- Convergent Lagrangian heuristics for nonlinear minimum cost network flows (Q2480971) (← links)
