A Branch and Bound Procedure for a Class of Discrete Resource Allocation Problems with Several Constraints

DOI10.1057/JORS.1977.77zbMATH Open0354.90045OpenAlexW1978805486MaRDI QIDQ4126044FDOQ4126044

Authors: Wei Shih 

Publication date: 1977

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

Full work available at URL: https://doi.org/10.1057/jors.1977.77

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Integer programming (90C10) Algorithms in computer science (68W99)

Cited In (8)

• Discrete Resource Allocation with Non-Decreasing Return and Cost Functions
• The use of relaxation techniques to solve certain mathematical decision‐making problems
• Location of a discrete resource and its allocation according to a fractional objective
• Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies
• 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
• Incremental allocation of a discrete and convex resource to concave activities

This page was built for publication: A Branch and Bound Procedure for a Class of Discrete Resource Allocation Problems with Several Constraints

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