A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems
From MaRDI portal
Publication:623462
DOI10.1007/S10107-009-0274-9zbMATH Open1206.90129OpenAlexW2054365069MaRDI QIDQ623462FDOQ623462
Authors: Thomas C. Sharkey, H. Edwin Romeijn, Joseph Geunes 
Publication date: 14 February 2011
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-009-0274-9
Recommendations
- A nonlinear knapsack problem
- Heuristic algorithms for the general nonlinear separable knapsack problem
- On a nonseparable convex maximization problem with continuous Knapsack constraints
- The nonlinear knapsack problem - algorithms and applications
- Relaxations and heuristics for the multiple non-linear separable knapsack problem
Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Production models (90B30)
Cites Work
- Title not available (Why is that?)
- On the solution of concave knapsack problems
- Warehouse-Retailer Network Design Problem
- Quadratic knapsack problems
- An Algorithm for Large Zero-One Knapsack Problems
- Title not available (Why is that?)
- A comparison of complete global optimization solvers
- Computing Partitions with Applications to the Knapsack Problem
- A Branch-and-Price Algorithm for the Multiperiod Single-Sourcing Problem
- A New and Efficient Algorithm for a Class of Portfolio Selection Problems
- The nonlinear knapsack problem - algorithms and applications
- Breakpoint searching algorithms for the continuous quadratic knapsack problem
- An O(n) algorithm for the multiple-choice knapsack linear program
- An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
- On the continuous quadratic knapsack problem
- About strongly polynomial time algorithms for quadratic optimization over submodular constraints
- On a nonseparable convex maximization problem with continuous Knapsack constraints
- Convex quadratic programming with one constraint and bounded variables
- Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables
- 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
- The Multiple-Choice Knapsack Problem
- Exact Solution of the Quadratic Knapsack Problem
- Target market selection and marketing effort under uncertainty: the selective newsvendor
- On a discrete nonlinear and nonseparable knapsack problem
- An upper bound for the zero-one knapsack problem and a branch and bound algorithm
- An Efficient Algorithm for the 0-1 Knapsack Problem
- An O(n) algorithm for the linear multiple choice knapsack problem and related problems
- An optimization algorithm for a penalized knapsack problem
- Economic ordering decisions with market choice flexibility
- The continuous-time single-sourcing problem with capacity expansion opportunities
- Simplex-inspired algorithms for solving a class of convex programming problems
Cited In (17)
- On a discrete nonlinear and nonseparable knapsack problem
- Relaxations and heuristics for the multiple non-linear separable knapsack problem
- The newsvendor problem with capacitated suppliers and quantity discounts
- Fixed-charge continuous knapsack problems and pseudogreedy solutions
- A two-phase method for solving continuous rank-one quadratic knapsack problems
- A nonlinear knapsack problem
- A Time–Cost Tradeoff Problem with Multiple Assessments and Release Times on a Chain Precedence Graph
- On the solution of multidimensional convex separable continuous knapsack problem with bounded variables
- A stochastic approach to handle resource constraints as knapsack problems in ensemble pruning
- Exact solution of a class of nonlinear knapsack problems
- A unified method for a class of convex separable nonlinear knapsack problems
- Nonconvex piecewise linear knapsack problems
- Simplex-inspired algorithms for solving a class of convex programming problems
- Integrated market selection and production planning: complexity and solution approaches
- A normal fan projection algorithm for low-rank optimization
- On a Reduction for a Class of Resource Allocation Problems
- On a nonseparable convex maximization problem with continuous Knapsack constraints
Uses Software
This page was built for publication: A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q623462)
