Pages that link to "Item:Q594771"
From MaRDI portal
The following pages link to A branch and search algorithm for a class of nonlinear knapsack problems (Q594771):
Displayed 30 items.
- Improving an exact approach for solving separable integer quadratic knapsack problems (Q434199) (← links)
- An exact penalty function approach for nonlinear integer programming problems (Q580179) (← links)
- Exact algorithm for concave knapsack problems: linear underestimation and partition method (Q811881) (← links)
- Exact solution of a class of nonlinear knapsack problems (Q813968) (← links)
- Exact solution method to solve large scale integer quadratic multidimensional knapsack problems (Q841599) (← links)
- Solving knapsack problems with \(S\)-curve return functions (Q958108) (← links)
- Convergent Lagrangian and domain cut method for nonlinear knapsack problems (Q1001200) (← links)
- Inverse optimization for linearly constrained convex separable programming problems (Q1044084) (← links)
- A note on a general nonlinear knapsack problem (Q1081534) (← links)
- A surrogate relaxation based algorithm for a general quadratic multi- dimensional knapsack problem (Q1108931) (← links)
- A hybrid method for solving nonlinear knapsack problems (Q1123129) (← links)
- Two backtrack algorithms for the ratio frequency intermodulation problem (Q1140540) (← 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)
- The nonlinear knapsack problem - algorithms and applications (Q1600928) (← links)
- A hybrid dynamic programming for solving fixed cost transportation with discounted mechanism (Q1659226) (← links)
- A nonlinear knapsack problem (Q1905070) (← links)
- A branch-and-bound algorithm for the quadratic multiple knapsack problem (Q2076914) (← links)
- Development of a hybrid dynamic programming approach for solving discrete nonlinear Knapsack problems (Q2371518) (← 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)
- An exact algorithm for linear integer programming problems with distributionally robust chance constraints (Q2698584) (← links)
- Allocation of discrete resource in order transmission hierarchical organization (Q3804439) (← links)
- A new exact algorithm for concave knapsack problems with integer variables (Q5031798) (← links)
- An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating (Q5139608) (← links)
- An efficient algorithm for nonlinear integer programming problems arising in series–parallel reliability systems (Q5481688) (← links)
- A simple procedure for solving a continuous quadratic mathematical model. (Q5931607) (← links)
- A pegging algorithm for the nonlinear resource allocation problem (Q5959400) (← links)
- A general purpose exact solution method for mixed integer concave minimization problems (Q6112823) (← links)