An Oil Pipeline Design Problem

References

• Aarts E. H. L., van Laarhoven P. J. M. Statistical cooling: A general approach to combinatorial optimization problems. Philips J. Res. (1985) 40:193Google Scholar
• Barahona F. Network design using cut inequalities. SIAM J. Optim. (1996) 6:823–837Crossref, Google Scholar
• Bertelè U., Brioschi F.Nonserial Dynamic Programming (1972) (Academic Press, New York) Google Scholar
• Bienstock D., Gunluk O. Capacitated network design–Polyhedral structure and computation. INFORMS J. Comput. (1996) 8:243–260Link, Google Scholar
• Bienstock D., Muratore G. Strong inequalities for capacitated survivable network design problems. Math. Programming, Ser. A (2000) 89:127–147Crossref, Google Scholar
• Bienstock D., Chopra S., Gunluk O., Tsai C-Y. Minimum cost capacity installation for multicommodity network flows. Math. Programming (1998) 81:177–199Crossref, Google Scholar
• Bousba C., Wolsey L. Finding minimum cost directed trees with demands and capacities. Ann. Oper. Res. (1991) 33:285–303Crossref, Google Scholar
• Brimberg J., Mladenović N. A variable neighborhood algorithm for solving the continuous location-allocation problem. Stud. Locational Anal. (1996) 10:1–12Google Scholar
• Bulfin R. L., Liu C-Y. Optimal allocation of redundant components for large systems. IEEE Trans. Reliability (1985) R–34(3):241–247Crossref, Google Scholar
• Carter R. G. Pipeline optimization: Dynamic programming after 30 years. (1998) . Stoner Associates Inc., Houston, TXGoogle Scholar
• Chang S-K. A model for distributed computer system design. IEEE Trans. Systems, Man, Cybernetics (1976) SMC–5(6):344–359Crossref, Google Scholar
• Chern M-S., Jan R-H. Reliability optimization problems with multiple constraints. IEEE Trans. Reliability (1986) R–35(4):431–436Crossref, Google Scholar
• Chu Y., Liu T. On the shortest arborescence of a directed graph. Sciencia Sinica (1965) 4:1396–1400Google Scholar
• Dolan W. B., Cummings P. T., LeVan M. D. Process optimization via simulated annealing: Application to network design. AIChE J. (1989) 35(5):725–736Crossref, Google Scholar
• Edmonds J. Optimum branching. J. Res. National Bureau Standards (1967) 71B:233–240Crossref, Google Scholar
• Frisch I. T. Technical problems in nationwide networking and interconnection. IEEE Trans. Comm. (1975) COM–23(1):78–88Crossref, Google Scholar
• Glover F. Tabu search part I. ORSA J. Comput. (1989) 1(3):190–206Link, Google Scholar
• Glover F. Tabu search part II. ORSA J. Comput. (1990) 2(1):4–32Link, Google Scholar
• Glover F., Laguna M.Tabu Search (1997) (Kluwer Academic Publishers, Boston, MA) Crossref, Google Scholar
• Glover F., Sherali H., Lee Y. Generating cuts from surrogate constraint analysis for zero-one and multiple choice programming. Comput. Optim. Appl. (1997) 8(2):151–172Crossref, Google Scholar
• Golden B., Ball M., Bodin L. Current and future research directions in network optimization. Comput. Oper. Res. (1981) 8(2):71–81Crossref, Google Scholar
• Guignard M., Rosenwein M. B. An application of Lagrangean decomposition to the resource-constrained minimum weighted arborescence problem. Networks (1990) 20(3):1087–1093Crossref, Google Scholar
• Hansen P., Jaumard B. Algorithms for the maximum satisfiability problem. Computing (1990) 44(4):279–303Crossref, Google Scholar
• Hansen P., Mladenović N. Variable neighborhood search: Principles and applications. Eur. J. Oper. Res. (2001) 130:449–467Crossref, Google Scholar
• Hansen P., Jaumard B., Mladenović N., Cox I., Hansen P., Julesz B. How to choose k entities among n. Partitioning Data Sets (1994) (DIMACS, Rutgers, NJ) 105–116Google Scholar
• Hansen P., Pedrosa Filho E., Ribeiro C. Location and sizing of offshore platforms for oil exploration. Eur. J. Oper. Res. (1992) 58:202–214Crossref, Google Scholar
• Hochbaum D. S., Segev A. Analysis of a flow problem with fixed charges. Networks (1989) 19(3):291–312Crossref, Google Scholar
• Huang Z., Seireg A. Optimization in oil and gas pipeline engineering. J. Energy Resources Tech. (1985) 107(2):264–267Crossref, Google Scholar
• Karp R. M. A simple derivation of Edmond's algorithm for optimum branching. Networks (1971) 1:265–272Crossref, Google Scholar
• Karp R. M., Miller R. E., Thatcher J. W. Reducibility among combinatorial problems. Complexity of Computer Computations (1972) (Plenum Press, New York) 85–103Crossref, Google Scholar
• Kirkpatrick S., Gelatt C. D., Vecchi M. P. Optimization by simulated annealing. Sciences (1983) 220:671–680Crossref, Google Scholar
• Lih K-W. Applications of zero-one linear programming with multiple-choice constraints. (1993) . Ph.D. thesis Rutgers University, Rutgers, NJGoogle Scholar
• Mah R. S., Shacham M. Pipeline network design and synthesis. Adv. Chemical Engrg. (1978) 10:125–209Crossref, Google Scholar
• McKeown P. G., Ragsdale C. T. A computational study of using preprocessing and stronger formulations to solve large general fixed charge problems. Comput. Oper. Res. (1990) 17(1):9–16Crossref, Google Scholar
• Minoux M. Multicommodity dynamic flows of minimal updated cost. Annales des Télécommunications (1975) 30(12):51–58Google Scholar
• Minoux M. Minimum cost multicommodity flows with concave cost functions. Annales des Télécommunications (1976) 31(34):77–92Google Scholar
• Mladenović N. Variable neighborhood algorithm—A new metaheuristic for combinatorial optimization. Optim. Days. (1995) (Montreal, Quebec, Canada)112Google Scholar
• Mladenović N., Hansen P. Variable neighborhood search. Comput. Oper. Res. (1997) 24:1097–1100Crossref, Google Scholar
• Mladenović N., Petric J., Gledhill R., Papathanasiu B. Spanning tree and arborescence at random. Proc. Second Balkan Conf. Oper. Res. (1993) Thessaloniki, Greece:611–620Google Scholar
• Nemhauser G. L., Wolsey L. A.Integer and Combinatorial Optimization (1988) (Wiley, New York) Crossref, Google Scholar
• Olorunniwo F. O., Jensen P. A. Dynamic sizing and locationing of facilities on natural gas transmission networks. Engrg. Optim. (1982a) 6:95–109Crossref, Google Scholar
• Olorunniwo F. O., Jensen P. A. Optimal capacity expansion policy for natural gas transmission network: A decomposition approach. Engrg. Optim. (1982b) 6:13–30Crossref, Google Scholar
• Ragsdale C. T., McKeown P. G. An algorithm for solving fixed-charge problems using surrogate constraints. Comput. Oper. Res. (1991) 18(1):87–96Crossref, Google Scholar
• Rosenthal A. Dynamic programming is optimal for nonserial optimization problems. SIAM J. Comput. (1982) 11(1):47–59Crossref, Google Scholar
• Rothfarb B., Goldstein M. The one-terminal telpak problem. Oper. Res. (1971) 19:156–169Link, Google Scholar
• Rothfarb B., Frank H., Rosenbaum D. M., Steiglitz K., Kleitman D. J. Optimal design of offshore natural-gas pipeline systems. Oper. Res. (1970) 18(6):992–1020Link, Google Scholar
• Schreck H., Tinhofer G. An O(n2) simplex algorithm for a class of linear programs with tree structure. Eur. J. Oper. Res. (1985) 21(2):225–232Crossref, Google Scholar
• Stoer M., Dahl G. A polyhedral approach to multicommodity survivable network design. Numerische Mathematik (1994) 68:149–167Crossref, Google Scholar
• Tarjan R. E. Depth-first search and linear graph algorithms. SIAM J. Comput. (1972) 1:146–160Crossref, Google Scholar
• Tinhofer G. Rational solutions of the graphsack problem. Math. Programming (1984) 28(3):337–348Crossref, Google Scholar
• Toth P., Vigo D. An exact algorithm for the capacitated shortest spanning arborescence. Ann. Oper. Res. (1995) 61:121–141Crossref, Google Scholar
• Winter P. Steiner problem in networks: A survey. Networks (1987) 17:129–167Crossref, Google Scholar
• Yoo C., Tcha D. A cross decomposition procedure for the facility location problem with a choice of facility type. Comput. Indus. Engrg. (1986) 10:283–290Crossref, Google Scholar