A linear-time algorithm for solving continuous maximin knapsack problems

A linear-time algorithm for solving continuous maximin knapsack problems

0.00 Avg rating0 Votes
Article ID: iaor19912102
Country: Netherlands
Volume: 10
Issue: 1
Start Page Number: 23
End Page Number: 26
Publication Date: Feb 1991
Journal: Operations Research Letters
Authors: , ,
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.

Reviews

Required fields are marked *. Your email address will not be published.