The following pages link to A nonlinear knapsack problem (Q1905070):
Displaying 50 items.
- Approximation algorithms on 0--1 linear knapsack problem with a single continuous variable (Q489742) (← links)
- A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems (Q623462) (← links)
- Simple solution methods for separable mixed linear and quadratic knapsack problem (Q693416) (← 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)
- A biobjective method for sample allocation in stratified sampling (Q856297) (← links)
- A particle swarm optimization approach to the nonlinear resource allocation problem (Q864762) (← links)
- Competitive facility location model with concave demand (Q877034) (← links)
- On a discrete nonlinear and nonseparable knapsack problem (Q920849) (← links)
- An exact algorithm for cost minimization in series reliability systems with multiple component choices (Q945416) (← links)
- Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method (Q946351) (← links)
- Nonconvex piecewise linear knapsack problems (Q948649) (← links)
- Solving knapsack problems with \(S\)-curve return functions (Q958108) (← links)
- Convergent Lagrangian and domain cut method for nonlinear knapsack problems (Q1001200) (← links)
- The submodular knapsack polytope (Q1040079) (← links)
- Inverse optimization for linearly constrained convex separable programming problems (Q1044084) (← links)
- A note on a general nonlinear knapsack problem (Q1081534) (← links)
- A hybrid method for solving nonlinear knapsack problems (Q1123129) (← links)
- The inverse-parametric knapsack problem (Q1388831) (← links)
- Fixed-charge continuous knapsack problems and pseudogreedy solutions (Q1586210) (← links)
- The nonlinear knapsack problem - algorithms and applications (Q1600928) (← links)
- Nonlinear integer programming for optimal allocation in stratified sampling (Q1610189) (← links)
- Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints (Q1651695) (← links)
- On the product knapsack problem (Q1653266) (← links)
- Fast integer-valued algorithms for optimal allocations under constraints in stratified sampling (Q1663138) (← links)
- Knapsack with variable weights satisfying linear constraints (Q1683329) (← links)
- Supermodular covering knapsack polytope (Q1751131) (← links)
- The packing while traveling problem (Q1751654) (← links)
- A continuous knapsack problem with separable convex utilities: approximation algorithms and applications (Q1785255) (← links)
- On speed scaling via integer programming (Q1785426) (← links)
- On the supermodular knapsack problem (Q1824552) (← links)
- Approximating the product knapsack problem (Q2230782) (← links)
- Approximation schemes for \(r\)-weighted minimization knapsack problems (Q2288864) (← links)
- Knapsack problems with sigmoid utilities: approximation algorithms via hybrid optimization (Q2356258) (← links)
- Knapsack problem with objective value gaps (Q2361124) (← links)
- A heuristic algorithm for a chance constrained stochastic program (Q2432880) (← links)
- A survey on the continuous nonlinear resource allocation problem (Q2456404) (← links)
- Complexity and algorithms for nonlinear optimization problems (Q2480263) (← links)
- Optimal multiple-objective resource allocation using hybrid particle swarm optimization and adaptive resource bounds technique (Q2483337) (← links)
- A branch-and-bound based method for solving monotone optimization problems (Q2501119) (← links)
- An approximate dynamic programming approach to convex quadratic knapsack problems (Q2566930) (← links)
- On a nonseparable convex maximization problem with continuous Knapsack constraints (Q2643790) (← links)
- An exact algorithm for linear integer programming problems with distributionally robust chance constraints (Q2698584) (← links)
- Distance confined path problem and separable integer programming (Q2841138) (← links)
- Packing a Knapsack of Unknown Capacity (Q2965490) (← links)
- (Q3138272) (← links)
- (Q3787789) (← links)
- Maximum likelihood estimation of cell probabilities in constrained multinomial models (Q4253300) (← links)
- Construction of efficient experimental designs under multiple resource constraints (Q4628716) (← links)
- HEURISTIC AND EXACT SOLUTION METHOD FOR CONVEX NONLINEAR KNAPSACK PROBLEM (Q4649881) (← links)
