A Branch and Bound Procedure for a Class of Discrete Resource Allocation Problems with Several Constraints
From MaRDI portal
Publication:4126044
DOI10.1057/jors.1977.77zbMath0354.90045OpenAlexW1978805486MaRDI QIDQ4126044
Publication date: 1977
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/jors.1977.77
Numerical mathematical programming methods (65K05) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Algorithms in computer science (68W99)
Related Items
Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies ⋮ Location of a discrete resource and its allocation according to a fractional objective ⋮ Incremental allocation of a discrete and convex resource to concave activities ⋮ The use of relaxation techniques to solve certain mathematical decision‐making problems ⋮ Discrete Resource Allocation with Non-Decreasing Return and Cost Functions ⋮ Discrete allocation of a linear resource according to a sum-of-products objective ⋮ Inspection and maintenance optimization methods ⋮ Discrete resource allocation with tree constraints by an incremental method
