Pages that link to "Item:Q4126044"
From MaRDI portal
The following pages link to A Branch and Bound Procedure for a Class of Discrete Resource Allocation Problems with Several Constraints (Q4126044):
Displaying 8 items.
- Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies (Q319183) (← links)
- Discrete allocation of a linear resource according to a sum-of-products objective (Q788639) (← links)
- Inspection and maintenance optimization methods (Q798253) (← links)
- Discrete resource allocation with tree constraints by an incremental method (Q799478) (← links)
- Location of a discrete resource and its allocation according to a fractional objective (Q1136705) (← links)
- Incremental allocation of a discrete and convex resource to concave activities (Q1163341) (← links)
- Discrete Resource Allocation with Non-Decreasing Return and Cost Functions (Q3666596) (← links)
- The use of relaxation techniques to solve certain mathematical decision‐making problems (Q3865861) (← links)
