Solving fixed charge network problems with group theory‐based penalties

R. L. Rardin and V. E. Unger

Naval Research Logistics Quarterly, 1976, vol. 23, issue 1, 67-84

Abstract: Many well‐known transportation, communication, and facilities location problems in operations research can be formulated as fixed charge network problems, i.e. as minimum cost flow problems on a capacitated network in one commodity where some arcs have both fixed and variable costs. One approach to solving such problems is to use group theoretic concepts from the theory of integer programming to provide bounds for a branch‐and‐bound procedure. This paper presents such a group‐theory based algorithm for exact solution of fixed charge network problems which exploits the special structures of network problems. Computational results are reported for problems with as many as 100 fixed charge arcs.

Date: 1976
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
https://doi.org/10.1002/nav.3800230108

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navlog:v:23:y:1976:i:1:p:67-84:1

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().