On a nonseparable convex maximization problem with continuous Knapsack constraints
From MaRDI portal
Publication:2643790
DOI10.1016/J.ORL.2006.01.010zbMATH Open1149.90395OpenAlexW2022568122MaRDI QIDQ2643790FDOQ2643790
Authors: H. Edwin Romeijn, Joseph Geunes, Kevin M. Taaffe 
Publication date: 27 August 2007
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2006.01.010
Recommendations
- A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems
- A unified method for a class of convex separable nonlinear knapsack problems
- A nonlinear knapsack problem
- On the solution of multidimensional convex separable continuous knapsack problem with bounded variables
- A continuous knapsack problem with separable convex utilities: approximation algorithms and applications
Cites Work
- Title not available (Why is that?)
- On the solution of concave knapsack problems
- Warehouse-Retailer Network Design Problem
- Quadratic knapsack problems
- Introduction to global optimization
- Markowitz revisited: mean-variance models in financial portfolio analysis
- Title not available (Why is that?)
- A New and Efficient Algorithm for a Class of Portfolio Selection Problems
- The nonlinear knapsack problem - algorithms and applications
- An Efficient Method for a Class of Continuous Nonlinear Knapsack Problems
- The Nonlinear Resource Allocation Problem
- 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
- On optimality conditions in nondifferentiable programming
- Contraction Mappings in the Theory Underlying Dynamic Programming
- Target market selection and marketing effort under uncertainty: the selective newsvendor
- On a discrete nonlinear and nonseparable knapsack problem
- Efficient Methods For Solving Quadratic 0–1 Knapsack Problems
- Economic ordering decisions with market choice flexibility
- The continuous-time single-sourcing problem with capacity expansion opportunities
- A nonlinear knapsack problem
- A note on a general nonlinear knapsack problem
Cited In (14)
- Solving knapsack problems with \(S\)-curve return functions
- Allocating procurement to capacitated suppliers with concave quantity discounts
- The symmetric quadratic knapsack problem: approximation and scheduling applications
- On the solution of multidimensional convex separable continuous knapsack problem with bounded variables
- Piecewise convex maximization approach to multiknapsack
- A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems
- A unified method for a class of convex separable nonlinear knapsack problems
- Nonconvex piecewise linear knapsack problems
- An Affine-Scaling Interior-Point Method for Continuous Knapsack Constraints with Application to Support Vector Machines
- Target market selection and marketing effort under uncertainty: the selective newsvendor
- A continuous knapsack problem with separable convex utilities: approximation algorithms and applications
- Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications
- Steering exact penalty DCA for nonsmooth DC optimisation problems with equality and inequality constraints
- On a Reduction for a Class of Resource Allocation Problems
Uses Software
This page was built for publication: On a nonseparable convex maximization problem with continuous Knapsack constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2643790)
