Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs

References

• Aghezzaf E. H., Wolsey L. A. Modeling piecewise linear concave costs in a tree partitioning problem. Discrete Appl. Math. (1994) 50:101–109Crossref, Google Scholar
• Atamtürk A. On capacitated network design-cutset polyhedra. Math. Programming (2002) 92:425–437Crossref, Google Scholar
• Balakrishnan A., Graves S. A composite algorithm for a concave-cost network flow problem. Networks (1989) 19:175–202Crossref, Google Scholar
• Balakrishnan A., Magnanti T. L., Mirchandani P., Dell’Amico M., Maffioli F., Martello S. Network design. Annotated Bibliographies in Combinatorial Optimization (1997) (John Wiley and Sons, New York) 311–334Google Scholar
• Balakrishnan A., Magnanti T. L., Wong R. T. A dual-ascent procedure for large-scale uncapacitated network design. Oper. Res. (1989) 37:716–740Link, Google Scholar
• Barahona F. Network design using cut inequalities. SIAM J. Optim. (1996) 6:823–837Crossref, Google Scholar
• Bienstock D., Günlük O. Computational experience with a difficult mixed-integer multicommodity flow problem. Math. Programming (1995) 68:213–237Crossref, Google Scholar
• Bienstock D., Günlük O. Capacitated network design—Polyhedral structure and computation. INFORMS J. Comput. (1996) 8:243–259Link, Google Scholar
• Bienstock D., Chopra S., Günlük O., Tsai C. Minimum cost capacity installation for multicommodity network flows. Math. Programming (1998) 81:177–199Crossref, Google Scholar
• Chan L., Muriel A., Simchi-Levi D. Supply chain management: Integrating inventory and transportation. (1997) . Working paper, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, ILGoogle Scholar
• Cominetti R., Ortega F. A branch & bound method for minimum concave cost network flows based on sensitivity analysis. (1997) . Working paper, Departamento de Ingenieria Matematica, Universidad de Chile, Santiago, ChileGoogle Scholar
• Crainic T. G., Frangioni A., Gendron B. Bundle-based relaxation methods for multicommodity capacitated fixed charge network design problems. Discrete Appl. Math. (2001) 112:73–99Crossref, Google Scholar
• Croxton K. L., Gendron B., Magnanti T. L. A comparison of mixed-integer programming models for non-convex piecewise linear cost minimization problems. Management Sci. (2003a) 49:1268–1273Link, Google Scholar
• Croxton K. L., Gendron B., Magnanti T. L. Models and methods for merge-in-transit operations. Transportation Sci. (2003b) 37:1–22Link, Google Scholar
• Croxton K. L., Gendron B., Magnanti T. L. Variable disaggregation in network flow problems with piecewise linear costs. (2004) . Publication CRT-2004-05, Centre for Research on Transportation, Université de Montréal, Montreal, Quebec, CanadaGoogle Scholar
• Falk J. E. Lagrange multipliers and nonconvex programs. SIAM J. Control (1969) 7:534–545Crossref, Google Scholar
• Gabrel V., Minoux M. LP relaxations better than convexification for multicommodity network optimization problems with step increasing cost functions. Acta Math. Vietnamica (1997) 22:123–145Google Scholar
• Gabrel V., Knippel A., Minoux M. Exact solution of multicommodity network optimization problems with general step cost functions. Oper. Res. Lett. (1999) 25:15–23Crossref, Google Scholar
• Gendron B., Crainic T. G., Frangioni A., Soriano P., Sansò B. Multicommodity capacitated network design. Telecommunications Network Planning (1999) (Kluwer Academic Publishing, Norwell, MA) 1–19Crossref, Google Scholar
• Geoffrion A. M. Lagrangean relaxation for integer programming. Math. Programming Stud. (1974) 2:82–114Crossref, Google Scholar
• Günlük O. A branch-and-bound algorithm for capacitated network design problems. Math. Programming (1999) 86:17–39Crossref, Google Scholar
• Holmberg K. Solving the staircase cost facility location problem with decomposition and piecewise linearization. Eur. J. Oper. Res. (1994) 75:41–61Crossref, Google Scholar
• Holmberg K., Hellstrand J. Solving the uncapacitated network design problem by a Lagrangean heuristic and branch-and-bound. Oper. Res. (1998) 46:247–259Link, Google Scholar
• Holmberg K., Ling J. A Lagrangean heuristic for the facility location problem with staircase costs. Eur. J. Oper. Res. (1997) 97:63–74Crossref, Google Scholar
• Holmberg K., Yuan D. A Lagrangian heuristic based branch-and-bound approach for the capacitated network design problem. Oper. Res. (2000) 48:461–481Link, Google Scholar
• Keha A. B., de Farias I. R., Nemhauser G. L. A branch-and-cut algorithm without binary variables for nonconvex piecewise linear optimization. Oper. Res. (2004a) . ForthcomingGoogle Scholar
• Keha A. B., de Farias I. R., Nemhauser G. L. Models for representing piecewise linear cost functions. Oper. Res. Lett. (2004b) 32:44–48Crossref, Google Scholar
• Kim D., Pardalos P. M. A dynamic domain contraction algorithm for nonconvex piecewise linear network flow problems. J. Global Optim. (2001) 17:225–234Crossref, Google Scholar
• Magnanti T. L., Stratila D., Bienstock D., Nemhauser G. L. Separable concave optimization approximately equals piecewise linear optimization. Integer Programming and Combinatorial Optimization: 10th International IPCO Conf. (2004) New York:234–243Crossref, Google Scholar
• Magnanti T. L., Wong R. T. Network design and transportation planning: Models and algorithms. Transportation Sci. (1984) 18:1–55Link, Google Scholar
• Magnanti T. L., Mirchandani P., Vachani R. Modeling and solving the two-facility capacitated network loading problem. Oper. Res. (1995) 43:142–157Link, Google Scholar
• Minoux M. Network synthesis and optimum network design problems: Models, solution methods and applications. Networks (1989) 19:313–360Crossref, Google Scholar
• Rardin R. L., Wolsey L. A. Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems. Eur. J. Oper. Res. (1993) 71:95–109Crossref, Google Scholar