A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems

DOI10.1007/s10107-009-0274-9zbMath1206.90129OpenAlexW2054365069MaRDI QIDQ623462

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

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Production models (90B30)

Related Items (7)

A stochastic approach to handle resource constraints as knapsack problems in ensemble pruning ⋮ On a Reduction for a Class of Resource Allocation Problems ⋮ A two-phase method for solving continuous rank-one quadratic knapsack problems ⋮ Simplex-inspired algorithms for solving a class of convex programming problems ⋮ Integrated market selection and production planning: complexity and solution approaches ⋮ The newsvendor problem with capacitated suppliers and quantity discounts ⋮ A Time–Cost Tradeoff Problem with Multiple Assessments and Release Times on a Chain Precedence Graph

Uses Software

• Knapsack

Cites Work

• Unnamed Item
• Unnamed Item
• An O(n) algorithm for the linear multiple choice knapsack problem and related problems
• An O(n) algorithm for quadratic knapsack problems
• Algorithms for the solution of quadratic knapsack problems
• On a discrete nonlinear and nonseparable knapsack problem
• An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
• Simplex-inspired algorithms for solving a class of convex programming problems
• On the continuous quadratic knapsack problem
• An upper bound for the zero-one knapsack problem and a branch and bound algorithm
• The nonlinear knapsack problem - algorithms and applications
• A comparison of complete global optimization solvers
• About strongly polynomial time algorithms for quadratic optimization over submodular constraints
• On the solution of concave knapsack problems
• Breakpoint searching algorithms for the continuous quadratic knapsack problem
• An optimization algorithm for a penalized knapsack problem
• Target market selection and marketing effort under uncertainty: the selective newsvendor
• On a nonseparable convex maximization problem with continuous Knapsack constraints
• An O(n) algorithm for the multiple-choice knapsack linear program
• A Branch-and-Price Algorithm for the Multiperiod Single-Sourcing Problem
• Warehouse-Retailer Network Design Problem
• Convex quadratic programming with one constraint and bounded variables
• An Algorithm for Large Zero-One Knapsack Problems
• A New and Efficient Algorithm for a Class of Portfolio Selection Problems
• Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables
• Quadratic knapsack problems
• Computing Partitions with Applications to the Knapsack Problem
• An Efficient Algorithm for the 0-1 Knapsack Problem
• The Multiple-Choice Knapsack Problem
• Exact Solution of the Quadratic Knapsack Problem
• Economic ordering decisions with market choice flexibility
• The continuous-time single-sourcing problem with capacity expansion opportunities
• The Nonlinear Resource Allocation Problem
• A pegging algorithm for the nonlinear resource allocation problem

This page was built for publication: A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems