Continuous maximin knapsack problems with GLB constraints

DOI10.1007/BF02591994MaRDI QIDQ3028718zbMATH OpenFDO

Authors H. A. Eiselt

Publication date 1986

Published in Mathematical Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02591994

zbMATH Keywords

polynomial algorithmsmaximin problemsGLB constraints

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Recommendations

• A linear-time algorithm for solving continuous maximin knapsack problems
• Minmax linear knapsack problem with grouped variables and gub
• On the solution of concave knapsack problems
• Max-max, max-min, min-max and min-min knapsack problems with a parametric constraint
• A nonlinear minimax allocation problem with multiple knapsack constraints

Cites work

• 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 multiple-choice knapsack linear program
• Application of Programs with Maximin Objective Functions to Problems of Optimal Resource Allocation
• Linear max-min programming
• THE MULTIPLE-CHOICE KNAPSACK PROBLEM
• Technical Note—On Min-Max Integer Allocation Problems
• The Linear Multiple Choice Knapsack Problem
• The Multiple-Choice Knapsack Problem

Cited in

(16)

• Optimality conditions for distributive justice
• A linear-time algorithm for solving continuous maximin knapsack problems
• Minmax linear knapsack problem with grouped variables and gub
• A lexicographic minimax algorithm for multiperiod resource allocation
• Relaxation-based algorithms for minimax optimization problems with resource allocation applications
• Comparative error bound theory for three location models: continuous demand versus discrete demand
• Continuous equality knapsack with probit-style objectives
• Min-max optimization of several classical discrete optimization problems
• The continuous knapsack problem with capacities
• Asignacion de recuerdos max-min: Propiedades y algoritmos
• Solving knapsack sharing problems with general tradeoff functions
• Minimax resource allocation problems: Optimization and parametric analysis
• Discrete-time optimal control of an economic system using different objective functions
• Max-max, max-min, min-max and min-min knapsack problems with a parametric constraint
• An algorithm for separable nonlinear minimax problems
• A nonlinear minimax allocation problem with multiple knapsack constraints

This page was built for publication: Continuous maximin knapsack problems with GLB constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3028718)