Pages that link to "Item:Q1081534"
From MaRDI portal
The following pages link to A note on a general nonlinear knapsack problem (Q1081534):
Displaying 20 items.
- An efficient algorithm for the Lagrangean dual of nonlinear knapsack problems with additional nested constraints (Q675985) (← links)
- Heuristic algorithms for the general nonlinear separable knapsack problem (Q709196) (← links)
- Exact algorithm for concave knapsack problems: linear underestimation and partition method (Q811881) (← links)
- A new lower bound for the linear knapsack problem with general integer variables (Q859686) (← links)
- A particle swarm optimization approach to the nonlinear resource allocation problem (Q864762) (← links)
- A solution procedure for general knapsack problems with a few constraints (Q908852) (← links)
- Nonconvex piecewise linear knapsack problems (Q948649) (← links)
- Convergent Lagrangian and domain cut method for nonlinear knapsack problems (Q1001200) (← links)
- A hybrid method for solving nonlinear knapsack problems (Q1123129) (← links)
- The nonlinear knapsack problem - algorithms and applications (Q1600928) (← links)
- Nonlinear integer programming for optimal allocation in stratified sampling (Q1610189) (← links)
- On the supermodular knapsack problem (Q1824552) (← links)
- A nonlinear knapsack problem (Q1905070) (← links)
- A heuristic algorithm for a chance constrained stochastic program (Q2432880) (← links)
- A survey on the continuous nonlinear resource allocation problem (Q2456404) (← links)
- Optimal multiple-objective resource allocation using hybrid particle swarm optimization and adaptive resource bounds technique (Q2483337) (← links)
- On a nonseparable convex maximization problem with continuous Knapsack constraints (Q2643790) (← links)
- (Q4896280) (← links)
- An efficient algorithm for nonlinear integer programming problems arising in series–parallel reliability systems (Q5481688) (← links)
- A pegging algorithm for the nonlinear resource allocation problem (Q5959400) (← links)