Exact solution of a class of nonlinear knapsack problems

Authors:
Samir Elhedhli
Affiliations:
Department of Management Sciences, University of Waterloo, 200 University Avenue West, Waterloo, Ont., Canada N2L 3G1
Venue:
Operations Research Letters
Year:
2005

Citing 6
Cited 2

Solution procedures for the service system design problem

Computers and Operations Research
Simple but efficient approaches for the collapsing knapsack problem

Discrete Applied Mathematics
On a stochastic knapsack problem and generalizations

Advances in computational and stochastic optimization, logic programming, and heuristic search
A nonlinear Knapsack problem

Operations Research Letters
A branch and search algorithm for a class of nonlinear knapsack problems

Operations Research Letters
A note on multi-item inventory systems with limited capacity

Operations Research Letters

A Lagrangean Heuristic for Hub-and-Spoke System Design with Capacity Selection and Congestion

INFORMS Journal on Computing
Exact Algorithms for a Bandwidth Packing Problem with Queueing Delay Guarantees

INFORMS Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a class of nonlinear knapsack problems with applications in service systems design and facility location problems with congestion. We provide two linearizations and their respective solution approaches. The first is solved directly using a commercial solver. The second is a piecewise linearization that is solved by a cutting plane method.