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