Discrete allocation of a linear resource according to a sum-of-products objective

DOI10.1016/0167-6377(84)90070-1zbMath0531.90074OpenAlexW2010611327MaRDI QIDQ788639

K. M. Mjelde

Publication date: 1984

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(84)90070-1

zbMATH Keywords

resource allocationoptimal solutionincremental algorithmtwo-step procedureallocation of a linear resource

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Dynamic programming (90C39)

Cites Work

• Unnamed Item
• Inspection and maintenance optimization methods
• Incremental allocation of a discrete and convex resource to concave activities
• ALGORITHMS FOR A VARIANT OF THE RESOURCE ALLOCATION PROBLEM
• A Branch and Bound Procedure for a Class of Discrete Resource Allocation Problems with Several Constraints
• Discrete Resource Allocation by a Branch and Bound Method
• Discrete Optimization Via Marginal Analysis