Cost-effective allocations of bounded and binary resources in polynomial time

DOI10.1016/0377-2217(82)90112-6zbMATH Open0493.90084OpenAlexW2026717830MaRDI QIDQ1168898FDOQ1168898

K. M. Mjelde

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

zbMATH Keywords

algorithmsresource allocationupper boundpolynomial algorithmbinary effectiveness valuesconcave activitiesdiscrete resourceslinear resourcesratio optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Fractional programming (90C32) Integer programming (90C10)

Cites Work

• Title not available (Why is that?)
• Parameter-free convex equivalent and dual programs of fractional programming problems
• Programming with linear fractional functionals
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems
• Location of a discrete resource and its allocation according to a fractional objective
• Fractional Programming with Homogeneous Functions
• Bounded Allocations of Discrete and Binary Resources
• On Fulkerson's Conjecture About Consistent Labeling Processes

Cited In (1)

• A Fourth bibliography of fractional programming

This page was built for publication: Cost-effective allocations of bounded and binary resources in polynomial time

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