Pages that link to "Item:Q920849"
From MaRDI portal
The following pages link to On a discrete nonlinear and nonseparable knapsack problem (Q920849):
Displaying 18 items.
- Maximizing a class of submodular utility functions with constraints (Q517299) (← links)
- Maximizing a class of submodular utility functions (Q543403) (← links)
- A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems (Q623462) (← links)
- Heuristic algorithms for the general nonlinear separable knapsack problem (Q709196) (← links)
- The newsvendor problem with capacitated suppliers and quantity discounts (Q724067) (← links)
- Competitive facility location model with concave demand (Q877034) (← links)
- A unified method for a class of convex separable nonlinear knapsack problems (Q930930) (← links)
- Nonconvex piecewise linear knapsack problems (Q948649) (← links)
- Efficient solution approaches for a discrete multi-facility competitive interaction model (Q1026599) (← links)
- A hybrid method for solving nonlinear knapsack problems (Q1123129) (← links)
- The nonlinear knapsack problem - algorithms and applications (Q1600928) (← links)
- Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints (Q1651695) (← links)
- Relaxations and heuristics for the multiple non-linear separable knapsack problem (Q1652581) (← links)
- Maximizing expected utility over a knapsack constraint (Q1785738) (← links)
- Augmented Lagrangian algorithms for solving the continuous nonlinear resource allocation problem (Q2077958) (← links)
- Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems (Q2097628) (← links)
- A stochastic approach to handle resource constraints as knapsack problems in ensemble pruning (Q2163207) (← links)
- On a nonseparable convex maximization problem with continuous Knapsack constraints (Q2643790) (← links)
