A linear-time algorithm for solving continuous maximin knapsack problems

Authors:
Takahito Kuno;Hiroshi Konno;Eitan Zemel
Affiliations:
Department of Social Engineering, Tokyo Institute of Technology, 2-12-1 Oh-okayama, Meguro-ku, Tokyo 152, Japan;Institute of Human and Social Sciences, Tokyo Institute of Technology, 2-12-1 Oh-okayama, Meguro-ku, Tokyo 152, Japan;J.L. Kellogg, Graduate School of Management, Northwestern University, Leverone Hall, Evanston, IL 60208, USA
Venue:
Operations Research Letters
Year:
1991

Citing 5
Cited 1

An O(n) algorithm for the linear multiple choice knapsack problem and related problems

Information Processing Letters
Continuous maximin knapsack problems with GLB constraints

Mathematical Programming: Series A and B
Applying Parallel Computation Algorithms in the Design of Serial Algorithms

Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Minimax linear programming problem

Operations Research Letters

Sensitivity analysis of the knapsack sharing problem: Perturbation of the weight of an item

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces a special class of mathematical programming problem which maximizes the minimal value of a set of linear functions subject to a single linear constraint and upper bounding constraint on each variable. An O(n) algorithm for solving this problem is described by exploiting its special structure.