Discrete Resource Allocation by a Branch and Bound Method

DOI10.2307/3009479zbMath0391.90067OpenAlexW4239731254MaRDI QIDQ4173193

K. M. Mjelde

Publication date: 1978

Published in: The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/3009479

zbMATH Keywords

Branch and Bound AlgorithmDiscrete Resource Allocatio

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items (5)

Location of a discrete resource and its allocation according to a fractional objective ⋮ Incremental allocation of a discrete and convex resource to concave activities ⋮ 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

This page was built for publication: Discrete Resource Allocation by a Branch and Bound Method