Pages that link to "Item:Q4835455"

The following pages link to A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems (Q4835455):

Displaying 31 items.

• Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies (Q319183) (← links)
• Improving an exact approach for solving separable integer quadratic knapsack problems (Q434199) (← links)
• Simple solution methods for separable mixed linear and quadratic knapsack problem (Q693416) (← links)
• Integer quadratic optimization (Q759647) (← links)
• The quadratic knapsack problem -- a survey (Q875597) (← 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 unified method for a class of convex separable nonlinear knapsack problems (Q930930) (← links)
• The nonlinear knapsack problem - algorithms and applications (Q1600928) (← links)
• Capacity-constrained multiple-market price discrimination (Q1761955) (← links)
• A nonlinear knapsack problem (Q1905070) (← links)
• Variable fixing method by weighted average for the continuous quadratic knapsack problem (Q2074624) (← links)
• A branch-and-bound algorithm for the quadratic multiple knapsack problem (Q2076914) (← 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)
• On linear-time algorithms for the continuous quadratic Knapsack problem (Q2471117) (← links)
• A relaxed projection method for general integer quadratic knapsack problem. (Q2477123) (← links)
• An approximate dynamic programming approach to convex quadratic knapsack problems (Q2566930) (← links)
• A penalty algorithm for solving convex separable knapsack problems (Q2660092) (← links)
• A cut-and-branch algorithm for the quadratic knapsack problem (Q2673234) (← links)
• A roof linearization algorithm to obtain a tight upper bound for integer nonseparable quadratic programming (Q2883573) (← links)
• A new Lagrangian based branch and bound algorithm for the 0-1 knapsack problem (Q2883626) (← links)
• New algorithm for quadratic integer knapsack problems (Q2994046) (← links)
• HEURISTIC AND EXACT SOLUTION METHOD FOR CONVEX NONLINEAR KNAPSACK PROBLEM (Q4649881) (← links)
• A Projection Method for the Integer Quadratic Knapsack Problem (Q4887719) (← links)
• A tight upper bound for quadratic knapsack problems in grid-based wind farm layout optimization (Q5058729) (← links)
• An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating (Q5139608) (← links)
• A direct algorithm of separable quadratic knapsack problem (Q5499413) (← links)
• A Lagrangian relaxation approach to the edge-weighted clique problem (Q5937353) (← links)
• A pegging algorithm for the nonlinear resource allocation problem (Q5959400) (← links)