COMMODITY FAMILY EXTENDED FORMULATIONS OF UNCAPACITATED FIXED CHARGE NETWORK FLOW PROBLEMS

Authors
Citation
Ph. Ng et Rl. Rardin, COMMODITY FAMILY EXTENDED FORMULATIONS OF UNCAPACITATED FIXED CHARGE NETWORK FLOW PROBLEMS, Networks, 30(1), 1997, pp. 57-71
Citations number
7
Categorie Soggetti
Computer Sciences","Computer Science Hardware & Architecture
Journal title
ISSN journal
00283045
Volume
30
Issue
1
Year of publication
1997
Pages
57 - 71
Database
ISI
SICI code
0028-3045(1997)30:1<57:CFEFOU>2.0.ZU;2-J
Abstract
Uncapacitated fixed charge network flow problems are single-commodity flow problems with (positive) fixed charges for opening some arcs and no capacities. Previous research has shown that much improved linear p rogramming relaxations can be obtained by reformulating these problems in terms of an extended variable set corresponding to flow commoditie s for each demand point. In this paper, we develop a theory of reformu lations generalizing to families of commodities defined by arbitrary d emand subsets. In particular, we show how to produce an extended formu lation for any suitable commodity family and isolate simple axioms cha racterizing the families that yield the most useful reformulations. (C ) 1997 John Wiley & Sons, Inc.