Network Models with Unsplittable Node Flows with Application to Unit Train Scheduling

References

• Ahuja RK, Cunha CB, Şahin G (2014) Network models in railroad planning and scheduling. Emerging Theory, Methods, and Applications, INFORMS TutORials in Operations Research (INFORMS, Catonsville, MD), 54–101.Google Scholar
• Atamtürk A (2001) On capacitated network design cut-set polyhedra. Math. Programming 92:425–437.Crossref, Google Scholar
• Atamtürk A (2002) On splittable and unsplittable capacitated network design arc-set polyhedra. Math. Programming 92:315–333.Crossref, Google Scholar
• Baier G, Kohler E, Skutella M (2005) The k-splittable flow problem. Algorithmica 42:231–248.Crossref, Google Scholar
• Balas E (1979) Disjunctive programming. Ann. Discrete Math. 5:3–51.Crossref, Google Scholar
• Balas E (1985) Disjunctive programming and a hierarchy of relaxations for discrete optimization problems. SIAM J. Discrete Math. 6:466–486.Crossref, Google Scholar
• Barahona F (1996) Network design using cut inequalities. SIAM J. Optim. 6:823–837.Crossref, Google Scholar
• Ben Amor HMT, Desrosiers J, Frangioni A (2009) On the choice of explicit stabilizing terms in column generation. Discrete Appl. Math. 157:1167–1184.Crossref, Google Scholar
• Bienstock D, Chopra S, Günlük O, Tsai C (1998) Minimum cost capacity installation for multicommodity network flows. Math. Programming 81:177–199.Crossref, Google Scholar
• Cacchiani V (2007) Models and algorithms for combinatorial optimization problems arising in railway applications. PhD thesis, Universita Degli Studi Di Bologna, Bologna, Italy.Google Scholar
• Chouman M, Crainic TG (2014) Cutting-plane matheuristic for service network design with design-balanced requirements. Transportation Sci. 49:99–113.Link, Google Scholar
• Cordeau JF, Toth P, Vigo D (1998) A survey of optimization models for train routing and scheduling. Transportation Sci. 32:380–404.Link, Google Scholar
• Dinitz Y, Garg N, Goemans MX (1999) On the single-source unsplittable flow problem. Combinatorica 19:17–41.Crossref, Google Scholar
• Gorman MF, Harrod S (2011) Operations Research Approaches to Asset Management in Freight Rail, Wiley Encyclopedia of Operations Research and Management Science (John Wiley & Sons, Hoboken, NJ).Crossref, Google Scholar
• Gu Z, Nemhauser GL, Savelsbergh MWP (1999) Lifted flow cover inequalities for mixed 0-1 integer programs. Math. Programming 85:439–467.Crossref, Google Scholar
• Günlük O (1999) A branch-and-cut algorithm for capacitated network design problems. Math. Programming 86:17–39.Crossref, Google Scholar
• Hu Y, Lan J, Wan C (2009) An Algorithm for Unsplittable Flow Problem in Flexible Reconfigurable Network, Frontier of Computer Science and Technology (IEEE, New York), 543–547.Crossref, Google Scholar
• Içyüz-Ay IE, Richard JPP, Eskigun E, Acharya D (2016) A two-model solution approach for the monthly coal train reservations planning problem. Transportation Sci. 50:926–946.Link, Google Scholar
• Kleinberg JM (1996) Approximation algorithms for disjoint paths problems. PhD thesis, Massachusetts Institute of Technology, Cambridge.Google Scholar
• Kolman P, Scheideler C (2002) Improved bounds for the unsplittable flow problem. Proc. 13th Annual ACM-SIAM Sympos. Discrete Algorithms (SIAM, Philadelphia), 184–193.Google Scholar
• Lawley M, Parmeshwaran V, Richard JPP, Turkcan A, Dalal A, Ramcharan D (2008) A time-space scheduling model for optimizing recurring bulk railcar deliveries. Transportation Res. Part B: Methodological 42:438–454.Crossref, Google Scholar
• Liu SQ, Kozan E (2011) Optimising a coal rail network under capacity constraints. Flexible Services Manufacturing J. 23:90–110.Crossref, Google Scholar
• Nemani AK, Ahuja RK (2011) OR Models in Freight Railroad Industry, Wiley Encyclopedia of Operations Research and Management Science (John Wiley & Sons, Hoboken, NJ).Google Scholar
• Ortega F, Wolsey LA (2003) A branch-and-cut algorithm for the single commodity uncapacitated fixed charge network flow problem. Networks 41:143–158.Crossref, Google Scholar
• Padberg MW, Roy TJV, Wolsey LA (1985) Valid linear inequalities for fixed charge problems. Oper. Res. 33:842–861.Link, Google Scholar
• Raack C, Koster A, Orlowski S, Wessäly R (2011) On cut-based inequalities for capacitated network design polyhedra. Networks 57:141–156.Crossref, Google Scholar
• Richard JPP (2011) Lifting Techniques for Mixed Integer Programming, Wiley Encyclopedia of Operations Research and Management Science (John Wiley & Sons, Hoboken, NJ).Crossref, Google Scholar
• Schrijver A (2003) Combinatorial Optmization: Polyhedra and Efficiency (Springer, New York).Google Scholar
• Van Roy TL, Wolsey LA (1986) Valid inequalities for mixed 0-1 programs. Discrete Appl. Math. 14:199–213.Crossref, Google Scholar
• Vielma JP (2015) Mixed integer linear programming formulation techniques. SIAM Rev. 57:3–57.Crossref, Google Scholar
• Ziarati K, Soumis F, Desrosiers J, Solomon M (1999) A branch-first, cut-second approach for locomotive assignment. Management Sci. 45:1156–1168.Link, Google Scholar
• Ziegler GM (1995) Lecture on Polytopes (Springer, New York).Crossref, Google Scholar