Continuous maximin knapsack problems with GLB constraints
From MaRDI portal
Publication:3028718
DOI10.1007/BF02591994zbMath0625.90055MaRDI QIDQ3028718
Publication date: 1986
Published in: Mathematical Programming (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Related Items (13)
Relaxation-based algorithms for minimax optimization problems with resource allocation applications ⋮ An algorithm for separable nonlinear minimax problems ⋮ Comparative error bound theory for three location models: continuous demand versus discrete demand ⋮ A nonlinear minimax allocation problem with multiple knapsack constraints ⋮ Optimality conditions for distributive justice ⋮ A lexicographic minimax algorithm for multiperiod resource allocation ⋮ Minimax resource allocation problems: Optimization and parametric analysis ⋮ Minmax linear knapsack problem with grouped variables and gub ⋮ Discrete-time optimal control of an economic system using different objective functions ⋮ A linear-time algorithm for solving continuous maximin knapsack problems ⋮ Asignacion de recuerdos max-min: Propiedades y algoritmos ⋮ Min-max optimization of several classical discrete optimization problems ⋮ Solving knapsack sharing problems with general tradeoff functions
Cites Work
- A note on the knapsack problem with special ordered sets
- An O(n) algorithm for the multiple-choice knapsack linear program
- Technical Note—On Min-Max Integer Allocation Problems
- A o(n logn) algorithm for LP knapsacks with GUB constraints
- The Linear Multiple Choice Knapsack Problem
- Linear max-min programming
- THE MULTIPLE-CHOICE KNAPSACK PROBLEM
- The Multiple-Choice Knapsack Problem
- Application of Programs with Maximin Objective Functions to Problems of Optimal Resource Allocation
This page was built for publication: Continuous maximin knapsack problems with GLB constraints
