An Exact Algorithm for the Min-Cost Network Containment Problem

Networks

Volumn 43, Issue 2, 2004, Pages 87-102

  Pesenti, Raffaele ^a   Rinaldi, Franca ^b   Ukovich, Walter ^c  

^a UNIVERSITY OF PALERMO   (Italy)

^b UNIVERSITY OF UDINE   (Italy)

^c UNIVERSITY OF TRIESTE   (Italy)

Author keywords

Max weight directed cut; Network design; Polyhedra containment

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COSTS; PARAMETER ESTIMATION; PROBLEM SOLVING; SYSTEMS ANALYSIS; VECTORS;

BILATERAL CONTRACTS; DEMAND VECTOR; MIN-COST NETWORK CONTAINMENT PROBLEM; NETWORK CONTAINMENT PROBLEM; NETWORK DESIGN; POLYHEDRA CONTAINMENT;

TELECOMMUNICATION NETWORKS;

EID: 2042479405     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/net.10106     Document Type: Article

References (23)

1. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network flows, Prentice-Hall, Upper Saddle River, NJ, 1993.
2. F. Barahona, On cuts and matchings in planar graphs, Math Program A 60 (1993), 53-68.
3. F. Barahona, Network design using cut inequalities, SIAM J Optim 6 (1996), 823-837.
4. F. Barahona and A.R. Mahjoub, On the cut polytope, Math Program 36 (1986), 157-173.
5. F. Blanchini, F. Rinaldi, and W. Ukovich, A network design problem for a distribution system with uncertain demands, SIAM J Optim 7 (1997), 560-578.
6. L. Coslovich, R. Pesenti, and F. Rinaldi, Approximate algorithms for the min-cost containment network problem, Internal report, DEEI-University of Trieste, 2001.
7. P. Crescenzi, R. Silvestri, and L. Trevisan, To weight or not to weight: Where is the question? Proc 4th Israel Symp Theory of Computers and Systems, IEEE Comp Soc (1996), 68-77.
8. G. Dahl and M. Stoer, A cutting plane algorithm for multicommodity survivable network design problems, INFORMS J Comput 10 (1998), 1-11.
9. Directive 96/92/EC of the European Parliament and of the Council concerning common rules for the internal market in electricity, December 1996 (http://europa.eu.int/eur-lex) Official J L 27 (1997), pp. 20-29.
10. U. Feige and M.X. Goemans, Approximating the value of two prover proof systems, with applications to MAX 2SAT and MAX DICUT, Proc 3rd Israel Symp Theory of Computers and Systems, IEEE Comp Soc (1995), 182-189.
11. G. Gallo and C. Sodini, Concave cost minimization on networks, Eur J Oper Res 3 (1979), 239-249.
12. O. Gilnluk, A branch-and-cut algorithm for capacitated network design problems, Math Program A 86 (1999), 17-39.
13. W.W. Hogan, Markets in real electric networks require reactive processes, Energy J 14 (1993), 211-242.
14. P.L. Joskow, California's electricity crisis, Oxford Rev Econ Pol 17 (2001), 365-388.
15. T.L. Magnanti and P. Mirchandani, Shortest paths, single origin-destination network design, and associated polyhedra, Networks 23 (1993), 103-121.
16. T.L. Magnanti, P. Mirchandani, and R. Vachani, Modeling and solving the two-facility capacitated network loading problem, Oper Res 43 (1995), 142-157.
17. T.L. Magnanti and R.T. Wong, Network design and transportation planning: Models and algorithms, Trans Sci 18 (1984), 1-55.
18. S.T. McCormick, Submodular containment is hard, even for networks, Oper Res Lett 19 (1996), 95-99.
19. V. Melkonian and E. Tardos, Approximation algorithms for a directed network design problem, Proc Integer Programming and Combinatorial Optimization (Graz, 1999), Lecture Notes in Comput Science 1610, Springer, Berlin, 1999, pp. 345-360.
20. Ministry of Industry, Electricity Market Rules, Gazzetta Ufficiale, Serie Generale, Supplemento Ordinario 127, 2001 (in English at http://www. mercatoelettrico.org).
21. M. Minoux, Network synthesis and optimum network design problems: Models, solution methods and applications, Networks 19 (1989), 313-360.
22. R.T. Rockafellar, Network flows and monotropic optimization, Wiley, New York, 1984.
23. M. Zimand, Weighted NP optimization problems: Logical definability and approximation properties, SIAM J Comput 28 (1998), 36-56.