Cost-effective allocations of bounded and binary resources in polynomial time
type: Item
instance of: scholarly article
title: Cost-effective allocations of bounded and binary resources in polynomial time
zbMATH Open document ID: 0493.90084
DOI: 10.1016/0377-2217(82)90112-6
author: K. M. Mjelde
published in: European Journal of Operational Research
publication date: 1982-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C32
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 3777279
zbMATH Keywords: resource allocation
zbMATH Keywords: ratio optimization
zbMATH Keywords: polynomial algorithm
zbMATH Keywords: linear resources
zbMATH Keywords: discrete resources
zbMATH Keywords: concave activities
zbMATH Keywords: binary effectiveness values
zbMATH Keywords: algorithms
zbMATH Keywords: upper bound
MaRDI profile type: Publication
full work available at URL: 0377-2217(82)90112-6
OpenAlex ID: W2026717830
cites work: Fractional Programming with Homogeneous Functions
cites work: Programming with linear fractional functionals
cites work: Q3844775
cites work: Q3292914
cites work: Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems
cites work: Q3318566
cites work: Q4197641
cites work: On Fulkerson's Conjecture About Consistent Labeling Processes
cites work: Location of a discrete resource and its allocation according to a fractional objective
cites work: Bounded Allocations of Discrete and Binary Resources
cites work: Parameter-free convex equivalent and dual programs of fractional programming problems
description: scientific article; zbMATH DE number 3777279