The nonlinear knapsack problem - algorithms and applications
From MaRDI portal
Publication:1600928
DOI10.1016/S0377-2217(01)00179-5zbMath1003.90036WikidataQ27986324 ScholiaQ27986324MaRDI QIDQ1600928
Bala Shetty, Kurt M. Bretthauer
Publication date: 16 June 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
surveyalgorithmsinteger programmingnonlinear optimizationnonlinear resource allocation problemnonlinear knapsack problemgeneralized upper bounds
Related Items (70)
A new exact algorithm for concave knapsack problems with integer variables ⋮ Development of a hybrid dynamic programming approach for solving discrete nonlinear Knapsack problems ⋮ Integer optimization with penalized fractional values: the knapsack case ⋮ An efficient global algorithm for a class of indefinite separable quadratic programs ⋮ Exact solution method to solve large scale integer quadratic multidimensional knapsack problems ⋮ Method for solving the Backpack Problem with an additional restriction on the number of items types ⋮ Initial Shipment Decisions for New Products at Zara ⋮ Weighted search games ⋮ Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies ⋮ Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ On a nonseparable convex maximization problem with continuous Knapsack constraints ⋮ Relaxations and heuristics for the multiple non-linear separable knapsack problem ⋮ A Level-Set Method for Convex Optimization with a Feasible Solution Path ⋮ A penalty algorithm for solving convex separable knapsack problems ⋮ Competitive facility location model with concave demand ⋮ Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach ⋮ Single-period stochastic demand fulfillment in customer hierarchies ⋮ A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables ⋮ Integer knapsack problems with profit functions of the same value range ⋮ A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems ⋮ Resource allocation problems with expensive function evaluations ⋮ Approximating single- and multi-objective nonlinear sum and product knapsack problems ⋮ Indefinite multi-constrained separable quadratic optimization: large-scale efficient solution ⋮ Resource-Constrained Assignment Problems with Shared Resource Consumption and Flexible Demand ⋮ A heuristic algorithm for a chance constrained stochastic program ⋮ A metaheuristic for security budget allocation in utility networks ⋮ Improving an exact approach for solving separable integer quadratic knapsack problems ⋮ An exact algorithm for linear integer programming problems with distributionally robust chance constraints ⋮ Allocating procurement to capacitated suppliers with concave quantity discounts ⋮ An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating ⋮ A unified method for a class of convex separable nonlinear knapsack problems ⋮ Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods ⋮ A survey on the continuous nonlinear resource allocation problem ⋮ Product selection, machine time allocation, and scheduling decisions for manufacturing perishable products subject to a deadline ⋮ Nonconvex piecewise linear knapsack problems ⋮ HEURISTIC AND EXACT SOLUTION METHOD FOR CONVEX NONLINEAR KNAPSACK PROBLEM ⋮ Supermodular covering knapsack polytope ⋮ The packing while traveling problem ⋮ Solving knapsack problems with \(S\)-curve return functions ⋮ A breakpoint search approach for convex resource allocation problems with bounded variables ⋮ Simple solution methods for separable mixed linear and quadratic knapsack problem ⋮ A heuristic approach for allocation of data to RFID tags: a data allocation knapsack problem (DAKP) ⋮ Capacity-constrained multiple-market price discrimination ⋮ An efficient algorithm for multi-dimensional nonlinear knapsack problems ⋮ Workweek optimization of experimental designs: exact designs for variable sampling costs ⋮ An approach for solving nonlinear multi-objective separable discrete optimization problem with one constraint ⋮ Heuristic algorithms for the general nonlinear separable knapsack problem ⋮ Allocation planning under service-level contracts ⋮ The stochastic transportation problem with single sourcing ⋮ A continuous knapsack problem with separable convex utilities: approximation algorithms and applications ⋮ On speed scaling via integer programming ⋮ Optimizing facility location and design ⋮ The newsvendor problem with capacitated suppliers and quantity discounts ⋮ Approximation schemes for \(r\)-weighted minimization knapsack problems ⋮ Surrogate dual method for multi-dimensional nonlinear knapsack problems ⋮ A control based on a knapsack problem for solar hydrogen production ⋮ Efficient solution approaches for a discrete multi-facility competitive interaction model ⋮ An efficient algorithm of dead-end controls for solving combinatorial optimization problems ⋮ The submodular knapsack polytope ⋮ Augmented Lagrangian algorithms for solving the continuous nonlinear resource allocation problem ⋮ Bicriteria robotic operation allocation in a flexible manufacturing cell ⋮ Exact and heuristic methods for the selective maintenance problem ⋮ Inverse optimization for linearly constrained convex separable programming problems ⋮ A nonlinear multidimensional knapsack problem in the optimal design of mixture experiments ⋮ An approximate dynamic programming approach to convex quadratic knapsack problems ⋮ Cooperative and axiomatic approaches to the knapsack allocation problem ⋮ Exact algorithm for concave knapsack problems: linear underestimation and partition method ⋮ Exact solution of a class of nonlinear knapsack problems ⋮ Knapsack problems with sigmoid utilities: approximation algorithms via hybrid optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A branch and search algorithm for a class of nonlinear knapsack problems
- An O(n) algorithm for quadratic knapsack problems
- Algorithms for the solution of quadratic knapsack problems
- Capacity planning in manufacturing networks with discrete options
- On a discrete nonlinear and nonseparable knapsack problem
- An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
- A note on a general nonlinear knapsack problem
- A note on multi-item inventory systems with limited capacity
- Solving certain singly constrained convex optimization problems in production planning
- On the continuous quadratic knapsack problem
- Linear programming for the \(0-1\) quadratic knapsack problem
- Lagrangean methods for the 0-1 quadratic knapsack problem
- Quadratic resource allocation with generalized upper bounds
- Nonlinear integer programming for optimal allocation in stratified sampling
- A nonlinear knapsack problem
- About strongly polynomial time algorithms for quadratic optimization over submodular constraints
- A note on adapting methods for continuous global optimization to the discrete case
- On the solution of concave knapsack problems
- Constrained multi-item inventory systems: An implicit approach
- Algorithms for Separable Nonlinear Resource Allocation Problems
- A Parallel Projection for the Multicommodity Network Model
- Convex quadratic programming with one constraint and bounded variables
- Tradeoff Curves, Targeting and Balancing in Manufacturing Queueing Networks
- Fast Approximation Algorithms for Knapsack Problems
- Simple Ranking Methods for Allocation of One Resource
- A New and Efficient Algorithm for a Class of Portfolio Selection Problems
- A polynomially bounded algorithm for a singly constrained quadratic program
- Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables
- Quadratic knapsack problems
- Solution techniques for some allocation problems
- Solving Large Sparse Nonlinear Programs Using GRG
- Massively Parallel Algorithms for Singly Constrained Convex Programs
- Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems
- Efficient Methods For Solving Quadratic 0–1 Knapsack Problems
- Exact Solution of the Quadratic Knapsack Problem
- Cost-effectiveness of a preventive counseling and support package for postnatal depression
- A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems
- A Projection Method for the Integer Quadratic Knapsack Problem
- The Nonlinear Resource Allocation Problem
- A Massively Parallel Algorithm for Nonlinear Stochastic Network Problems
- Contraction Mappings in the Theory Underlying Dynamic Programming
- A pegging algorithm for the nonlinear resource allocation problem
This page was built for publication: The nonlinear knapsack problem - algorithms and applications
