A Two-Resource Allocation Problem Solvable in Linear Time

DOI10.1287/MOOR.10.1.7MaRDI QIDQ3678952zbMATH OpenOpenAlexFDO

Authors Nimrod Megiddo, Tetsuo Ichimori

Publication date 1985

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.10.1.7

zbMATH Keywords

linear time algorithmminimization of maximal completion timetwo-resource allocation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Recommendations

• Cost-effectiveness of a preventive counseling and support package for postnatal depression
• scientific article; zbMATH DE number 4093160
• scientific article; zbMATH DE number 4072697
• Discrete allocation of a linear resource according to a sum-of-products objective
• Time-optimal resource allocation under stepwise consumption constraints

Cited in

(6)

• A two-resource allocation algorithm with an application to large-scale zero-sum defensive games
• scientific article; zbMATH DE number 4089357 (Why is no real title available?)
• scientific article; zbMATH DE number 4093160 (Why is no real title available?)
• A nonlinear allocation problem
• Solving a class of two-resource allocation problem by equivalent load method
• Cost-effectiveness of a preventive counseling and support package for postnatal depression

This page was built for publication: A Two-Resource Allocation Problem Solvable in Linear Time

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