A Selection Problem of Shared Fixed Costs and Network Flows

1 November 1970

journal article
Published by Institute for Operations Research and the Management Sciences (INFORMS) in Management Science

Vol. 17 (3) , 200-207
https://doi.org/10.1287/mnsc.17.3.200

Abstract

An apparently combinatorial problem is defined, and a method given for solution by reduction to a network flow problem. The basic problem defined is that of assessing the desirability of incurring a number of fixed costs, when the benefits to be obtained cannot be related to individual cost-incurring items (facilities) but only to combinations.

Keywords

NETWORK FLOWS
PROBLEM DEFINED
SELECTION PROBLEM
APPARENTLY COMBINATORIAL
FLOW PROBLEM
SHARED FIXED
INCURRING ITEMS
COST INCURRING
COMBINATORIAL PROBLEM

This publication has 0 references indexed in Scilit: