Location of a discrete resource and its allocation according to a fractional objective
From MaRDI portal
Publication:1136705
DOI10.1016/0377-2217(80)90039-9zbMath0426.90085OpenAlexW2016169135MaRDI QIDQ1136705
Publication date: 1979
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(80)90039-9
Related Items (2)
Cost-effective allocations of bounded and binary resources in polynomial time ⋮ Bibliography in fractional programming
Cites Work
- Unnamed Item
- Unnamed Item
- Allocation of resources according to a fractional objective
- The Optimality of an Incremental Solution of a Problem Related to Distribution of Effort
- A Branch and Bound Procedure for a Class of Discrete Resource Allocation Problems with Several Constraints
- Convex-concave fractional programming with each variable occurring in a single constraint
- Discrete Resource Allocation by a Branch and Bound Method
- Discrete Allocation and Replenishment of Resources with Binary Effectiveness
- Einzelschrittverfahren zur Lösung konvexer und dual‐konvexer Minimierungsprobleme
- Fractional Programming with Homogeneous Functions
- On Nonlinear Fractional Programming
This page was built for publication: Location of a discrete resource and its allocation according to a fractional objective