A Selection Problem of Shared Fixed Costs and Network Flows

Published Online:https://doi.org/10.1287/mnsc.17.3.200

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.

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.