Cost-effective allocations of bounded and binary resources in polynomial time
From MaRDI portal
Publication:1168898
DOI10.1016/0377-2217(82)90112-6zbMath0493.90084MaRDI QIDQ1168898
Publication date: 1982
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(82)90112-6
algorithms; upper bound; resource allocation; polynomial algorithm; binary effectiveness values; concave activities; discrete resources; linear resources; ratio optimization
65K05: Numerical mathematical programming methods
90C10: Integer programming
90C32: Fractional programming
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Location of a discrete resource and its allocation according to a fractional objective
- Bounded Allocations of Discrete and Binary Resources
- On Fulkerson's Conjecture About Consistent Labeling Processes
- Parameter-free convex equivalent and dual programs of fractional programming problems
- Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems
- Fractional Programming with Homogeneous Functions
- Programming with linear fractional functionals