Minmax linear knapsack problem with grouped variables and gub
From MaRDI portal
Recommendations
- Minmax linear programmes with grouped variables
- Max-max, max-min, min-max and min-min knapsack problems with a parametric constraint
- A nonlinear minimax allocation problem with multiple knapsack constraints
- Continuous maximin knapsack problems with GLB constraints
- The knapsack problem with a minimum filling constraint
- Knapsack with variable weights satisfying linear constraints
- On a cardinality constrained linear programming knapsack problem
- STRUCTURE OF OPTIMAL SOLUTIONS OF A KNAPSACK PROBLEM SUBJECT TO A GIVEN TOTAL NUMBER OF VARIABLES USED
- Multi-constrained matroidal knapsack problems
- A note on the solution of group knapsack problems
Cites work
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- A graphical method to solve a family of allocation problems
- A graphical method to solve a maximin allocation problem
- A mofified gub algorithm for solving linear minimax problems
- A note on the knapsack problem with special ordered sets
- A o(n logn) algorithm for LP knapsacks with GUB constraints
- An O(n) algorithm for the linear multiple choice knapsack problem and related problems
- An O(n) algorithm for the multiple-choice knapsack linear program
- AnO (n)-algorithm for LP-knapsacks with a fixed number of GUB constraints
- Continuous maximin knapsack problems with GLB constraints
- The Knapsack Sharing Problem
Cited in
(3)
This page was built for publication: Minmax linear knapsack problem with grouped variables and gub
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3835625)
