A linear-time algorithm for solving continuous maximin knapsack problems
DOI10.1016/0167-6377(91)90082-ZzbMATH Open0725.90066OpenAlexW2014181360MaRDI QIDQ2277359FDOQ2277359
Authors: Takahito Kuno, Hiroshi Konno, Eitan Zemel 
Publication date: 1991
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(91)90082-z
Recommendations
- On linear-time algorithms for the continuous quadratic Knapsack problem
- An Efficient Method for a Class of Continuous Nonlinear Knapsack Problems
- An algorithm for the continuous variable upper bound knapsack problem
- Linear Time Algorithms for Knapsack Problems with Bounded Weights
- An exact algorithm for the 0-1 linear knapsack problem with a single continuous variable
- scientific article; zbMATH DE number 6263683
- Constant-time approximation algorithms for the knapsack problem
- A fast algorithm for the linear multiple-choice knapsack problem
- Continuous maximin knapsack problems with GLB constraints
- An O(n) algorithm for the linear multiple choice knapsack problem and related problems
continuous knapsack problembinary searchlinear-time algorithmlinear maximin problemparametric variable elimination method
Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Abstract computational complexity for mathematical programming problems (90C60) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Existence of solutions for minimax problems (49J35)
Cites Work
- Title not available (Why is that?)
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Combinatorial Optimization with Rational Objective Functions
- An Algorithm for Large Zero-One Knapsack Problems
- A linear time randomizing algorithm for searching ranked functions
- An O(n) algorithm for the multiple-choice knapsack linear program
- Continuous maximin knapsack problems with GLB constraints
- Application of Programs with Maximin Objective Functions to Problems of Optimal Resource Allocation
- Minimax linear programming problem
- An O(n) algorithm for the linear multiple choice knapsack problem and related problems
- A Branch Search Algorithm for the Knapsack Problem
- The Linear Multiple Choice Knapsack Problem
- Selecting the Kth Element in $X + Y$ and $X_1 + X_2 + \cdots + X_m $
- Linear max-min programming
- A mofified gub algorithm for solving linear minimax problems
Cited In (17)
- Continuous maximin knapsack problems with GLB constraints
- Heuristic and reduction algorithms for the knapsack sharing problem
- Nature plays with dice - terrorists do not: Allocating resources to counter strategic versus probabilistic risks
- Sensitivity analysis of the Knapsack sharing problem: perturbation of the weight of an item
- Relaxation-based algorithms for minimax optimization problems with resource allocation applications
- Title not available (Why is that?)
- An algorithm for solving a structured class of linear programming problems
- An exact algorithm for the knapsack sharing problem with common items
- A pegging approach to the precedence-constrained knapsack problem
- Sensitivity analysis of the knapsack sharing problem: perturbation of the profit of an item
- Title not available (Why is that?)
- Linear Time Algorithms for Knapsack Problems with Bounded Weights
- On the complexity of the continuous unbounded knapsack problem with uncertain coefficients
- An exact algorithm for the 0-1 linear knapsack problem with a single continuous variable
- An exact algorithm for the knapsack sharing problem
- Max-max, max-min, min-max and min-min knapsack problems with a parametric constraint
- New upper bounds and exact methods for the knapsack sharing problem
This page was built for publication: A linear-time algorithm for solving continuous maximin knapsack problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2277359)
