Pricing for customers with probabilistic valuations as a continuous knapsack problem
ICEC '06 Proceedings of the 8th international conference on Electronic commerce: The new e-commerce: innovations for conquering current barriers, obstacles and limitations to conducting successful business on the internet
A convergent decomposition algorithm for support vector machines
Computational Optimization and Applications
Convergent Lagrangian and domain cut method for nonlinear knapsack problems
Computational Optimization and Applications
Adaptive pricing for customers with probabilistic valuations
TADA/AMEC'06 Proceedings of the 2006 AAMAS workshop and TADA/AMEC 2006 conference on Agent-mediated electronic commerce: automated negotiation and strategy design for electronic markets
On a nonseparable convex maximization problem with continuous knapsack constraints
Operations Research Letters
The submodular knapsack polytope
Discrete Optimization
| Hi-index | 0.00 |
We propose a globally convergent method for the numerical solution of a class of continuous nonlinear knapsack problems arising, e.g., in chemical production service facilities.