Pages that link to "Item:Q1600928"
From MaRDI portal
The following pages link to The nonlinear knapsack problem - algorithms and applications (Q1600928):
Displaying 31 items.
- Approximation schemes for \(r\)-weighted minimization knapsack problems (Q2288864) (← links)
- A nonlinear multidimensional knapsack problem in the optimal design of mixture experiments (Q2329497) (← links)
- Knapsack problems with sigmoid utilities: approximation algorithms via hybrid optimization (Q2356258) (← links)
- Development of a hybrid dynamic programming approach for solving discrete nonlinear Knapsack problems (Q2371518) (← links)
- Weighted search games (Q2378340) (← links)
- Indefinite multi-constrained separable quadratic optimization: large-scale efficient solution (Q2424763) (← links)
- A heuristic algorithm for a chance constrained stochastic program (Q2432880) (← links)
- A survey on the continuous nonlinear resource allocation problem (Q2456404) (← links)
- Product selection, machine time allocation, and scheduling decisions for manufacturing perishable products subject to a deadline (Q2459400) (← 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)
- A penalty algorithm for solving convex separable knapsack problems (Q2660092) (← links)
- An exact algorithm for linear integer programming problems with distributionally robust chance constraints (Q2698584) (← links)
- A control based on a knapsack problem for solar hydrogen production (Q2826788) (← links)
- Resource-Constrained Assignment Problems with Shared Resource Consumption and Flexible Demand (Q2962557) (← links)
- A metaheuristic for security budget allocation in utility networks (Q2968500) (← links)
- Initial Shipment Decisions for New Products at Zara (Q3453326) (← links)
- A specially structured nonlinear integer resource allocation problem (Q4456095) (← links)
- A Level-Set Method for Convex Optimization with a Feasible Solution Path (Q4562247) (← links)
- HEURISTIC AND EXACT SOLUTION METHOD FOR CONVEX NONLINEAR KNAPSACK PROBLEM (Q4649881) (← links)
- A new exact algorithm for concave knapsack problems with integer variables (Q5031798) (← links)
- Method for solving the Backpack Problem with an additional restriction on the number of items types (Q5053523) (← links)
- An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating (Q5139608) (← links)
- An efficient algorithm for multi-dimensional nonlinear knapsack problems (Q5423360) (← links)
- Surrogate dual method for multi-dimensional nonlinear knapsack problems (Q5456301) (← links)
- A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables (Q6043104) (← links)
- Integer knapsack problems with profit functions of the same value range (Q6054010) (← links)
- Resource allocation problems with expensive function evaluations (Q6106771) (← links)
- Approximating single- and multi-objective nonlinear sum and product knapsack problems (Q6108919) (← links)
- On the paper ``Augmented Lagrangian algorithms for solving the continuous nonlinear resource allocation problem'' (Q6555200) (← links)
- A fully parallelized and budgeted multilevel Monte Carlo method and the application to acoustic waves (Q6645123) (← links)
