Technical Note—On Min-Max Integer Allocation Problems

DOI10.1287/OPRE.32.2.449MaRDI QIDQ3321840zbMATH OpenOpenAlexFDO

Authors Tetsuo Ichimori

Publication date 1984

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.32.2.449

zbMATH Keywords

minmax optimizationbottleneck integer allocation problem

Mathematics Subject Classification ID

Integer programming (90C10)

Recommendations

• A Max-Min Allocation Problem: Its Solutions and Applications
• Approximation Algorithms for the Max-Min Allocation Problem
• A Min-Max-Sum Resource Allocation Problem and Its Applications
• Restricted max-min allocation: integrality gap and approximation algorithm
• scientific article; zbMATH DE number 2239572
• Restricted max-min allocation: approximation and integrality gap
• scientific article; zbMATH DE number 1305459
• On the integer max-linear programming problem
• A computational study of approximation algorithms for a minmax resource allocation problem
• scientific article; zbMATH DE number 1163112

Cited in

(6)

• Continuous maximin knapsack problems with GLB constraints
• A Max-Min Allocation Problem: Its Solutions and Applications
• scientific article; zbMATH DE number 3896668 (Why is no real title available?)
• Min-max optimization of several classical discrete optimization problems
• Solving knapsack sharing problems with general tradeoff functions
• scientific article; zbMATH DE number 3970510 (Why is no real title available?)

This page was built for publication: Technical Note—On Min-Max Integer Allocation Problems

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