Pages that link to "Item:Q2276878"

The following pages link to On the solution of concave knapsack problems (Q2276878):

Displaying 29 items.

• An efficient global algorithm for a class of indefinite separable quadratic programs (Q304230) (← links)
• On the solution of multidimensional convex separable continuous knapsack problem with bounded variables (Q319990) (← links)
• A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems (Q623462) (← links)
• Approximation algorithms for indefinite quadratic programming (Q687094) (← links)
• Open questions in complexity theory for numerical optimization (Q687097) (← links)
• The newsvendor problem with capacitated suppliers and quantity discounts (Q724067) (← links)
• Interior-point algorithms for global optimization (Q804475) (← links)
• Allocating procurement to capacitated suppliers with concave quantity discounts (Q924901) (← links)
• Nonconvex piecewise linear knapsack problems (Q948649) (← links)
• Solving knapsack problems with \(S\)-curve return functions (Q958108) (← links)
• Scheduling jobs with time-resource tradeoff via nonlinear programming (Q1040086) (← links)
• Inverse optimization for linearly constrained convex separable programming problems (Q1044084) (← links)
• Local minima for indefinite quadratic knapsack problems (Q1186274) (← links)
• The nonlinear knapsack problem - algorithms and applications (Q1600928) (← links)
• A continuous knapsack problem with separable convex utilities: approximation algorithms and applications (Q1785255) (← links)
• Necessary and sufficient condition for local minima of a class of nonconvex quadratic programs (Q1906278) (← links)
• The symmetric quadratic knapsack problem: approximation and scheduling applications (Q1936656) (← links)
• On the complexity of finding a local minimizer of a quadratic function over a polytope (Q2089789) (← links)
• Knapsack problems with sigmoid utilities: approximation algorithms via hybrid optimization (Q2356258) (← links)
• Tight bounds on indefinite separable singly-constrained quadratic programs in linear-time (Q2364490) (← links)
• Indefinite multi-constrained separable quadratic optimization: large-scale efficient solution (Q2424763) (← links)
• A heuristic algorithm for a chance constrained stochastic program (Q2432880) (← links)
• A survey on the continuous nonlinear resource allocation problem (Q2456404) (← links)
• Sufficient optimality criterion for linearly constrained, separable concave minimization problems (Q2569195) (← links)
• Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications (Q2630817) (← links)
• On a nonseparable convex maximization problem with continuous Knapsack constraints (Q2643790) (← links)
• A general purpose exact solution method for mixed integer concave minimization problems (Q6112823) (← links)
• Effective algorithms for separable nonconvex quadratic programming with one quadratic and box constraints (Q6166654) (← links)
• An efficient global algorithm for indefinite separable quadratic knapsack problems with box constraints (Q6166655) (← links)