Pages that link to "Item:Q1108931"

The following pages link to A surrogate relaxation based algorithm for a general quadratic multi- dimensional knapsack problem (Q1108931):

Displaying 22 items.

• Improving an exact approach for solving separable integer quadratic knapsack problems (Q434199) (← links)
• Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach (Q604257) (← links)
• A scatter search method for the bi-criteria multi-dimensional \(\{0,1\}\)-knapsack problem using surrogate relaxation (Q702759) (← links)
• Exact algorithm for concave knapsack problems: linear underestimation and partition method (Q811881) (← links)
• Exact solution method to solve large scale integer quadratic multidimensional knapsack problems (Q841599) (← links)
• Convergent Lagrangian and domain cut method for nonlinear knapsack problems (Q1001200) (← links)
• A Lagrangian dual and surrogate method for multi-dimensional quadratic knapsack problems (Q1013444) (← links)
• A surrogate relaxation based algorithm for a general quadratic multi- dimensional knapsack problem (Q1108931) (← links)
• An enumerative algorithm framework for a class of nonlinear integer programming problems (Q1278943) (← links)
• A dual ascent method for the portfolio selection problem with multiple constraints and linked proposals (Q1296022) (← links)
• Quadratic resource allocation with generalized upper bounds (Q1376263) (← links)
• Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions (Q1861918) (← links)
• On generalized surrogate duality in mixed-integer nonlinear programming (Q2118119) (← links)
• A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs (Q2301138) (← links)
• A nonlinear multidimensional knapsack problem in the optimal design of mixture experiments (Q2329497) (← links)
• Indefinite multi-constrained separable quadratic optimization: large-scale efficient solution (Q2424763) (← links)
• A survey on the continuous nonlinear resource allocation problem (Q2456404) (← links)
• An approximate dynamic programming approach to convex quadratic knapsack problems (Q2566930) (← links)
• On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming (Q5041755) (← links)
• Completely positive and copositive program modelling for quadratic optimization problems (Q5151542) (← links)
• Reformulation of the Quadratic Multidimensional Knapsack Problem as Copositive/Completely Positive Prorams (Q5214092) (← links)
• Surrogate dual method for multi-dimensional nonlinear knapsack problems (Q5456301) (← links)