Publications

Categories: Applications; Computations; Cutting planes; LP; Stochastic Programming; BCP; Clutters; Polyhedra; Routing; Theory;

[Pre2] (2020). Multi-row intersection cuts based on the infinity norm. Submitted,, 2020.

Preprint

[j30] (2020). Split cuts from sparse disjunctions. Mathematical Programming Computation, vol 12, pp.295-335, 2020.

Preprint DOI

[j29] (2020). Evaluating periodic rescheduling policies using a rolling horizon framework in an industrial-scale multipurpose plant. Journal of Scheduling, vol 23(3), pp.397-410, 2020.

PDF DOI

[j28] (2020). A dynamic approach to selecting timepoints in short-term scheduling with application to multipurpose facilities. Industrial & Engineering Chemistry Research, vol 59(19), pp.9180-9197, 2020.

PDF DOI

[j27] (2019). The (not so) Trivial Lifting Problem in Two dimensions. Mathematical Programming Computation, vol 11(2), pp.211-235, 2019.

Preprint DOI

[j26] (2019). Permutations in the factorization of simplex bases. INFORMS Journal on Computing, vol 31(3), pp.612-632, 2019.

Preprint DOI

[j25] (2019). Bi-objective short-term scheduling in a rolling horizon framework: a priori approaches with alternative operational objectives. Computers and Operations Research, vol 111, pp.141-154, 2019.

PDF DOI

[j24] (2019). Adjustable Robust Optimization for Multi-tasking Scheduling with Reprocessing due to Imperfect Tasks. Optimization and Engineering, vol 20(4), pp.1117-1159, 2019.

PDF DOI

[j23] (2018). Opposite elements in clutters. Mathematics of Operations Research, vol 43(2), pp.428-459, 2018.

PDF DOI

[j22] (2018). Intersection cuts for single row corner relaxations. Mathematical Programming Computation, vol 10, pp.423-455, 2018.

Preprint DOI

[j21] (2018). Exact algorithms for the chance-constrained vehicle routing problem. Mathematical Programming Series B, vol 172(1–2), pp.105-138, 2018.

Preprint DOI

[j20] (2018). A joint vehicle routing and speed optimization problem. INFORMS Journal on Computing, vol 30(4), pp.694-709, 2018.

Preprint DOI

[j19] (2017). Numerically safe lower bounds for the Capacitated Vehicle Routing Problem. INFORMS Journal on Computing, vol 29(3), pp.544-557, 2017.

Preprint DOI

[j18] (2017). A multitasking continuous time formulation for short-term scheduling of operations in multipurpose plants. Computers and Chemical Engineering, vol 97, pp.135-146, 2017.

PDF DOI

[j17] (2017). A computational study of continuous and discrete time formulations for a class of short-term scheduling problems for multipurpose plants. Industrial & Engineering Chemistry Research, vol 56(31), pp.8940-8953, 2017.

PDF DOI

[j16] (2016). On the mixing set with a knapsack constraint. Mathematical Programming Series A, vol 157(1), pp.191-217, 2016.

Preprint DOI

[c7] (2016). Exact algorithms for the chance-constrained vehicle routing problem. In Proceedings of the 18th Integer Programming and Combinatorial Optimization conference IPCO'16, Liège, Belgium. Lecture Notes in Computer Science vol 9682, pp.89-101, 2016.

DOI

[j15] (2016). A disjunctive convex programming approach to the pollution-routing problem. Transportation Research Part B: Methodological, vol 94, pp.61-79, 2016.

Preprint DOI

[j14] (2015). Scheduling of operations in a Large-Scale Scientific Services Facility via Multi-Commodity Flow and Optimization-based Algorithm. Industrial & Engineering Chemistry Research, vol 54(5), pp.1628-1639, 2015.

DOI

[j13] (2015). Optimization of Cranio-Orbital Remodeling: Application of a Mathematical Model. Journal of Craniofacial Surgery, vol 26(5), pp.e416-e419, 2015.

DOI

[j12] (2015). A branch-cut-and-price algorithm for the energy minimization vehicle routing problem. Transportation Science, vol 50(1), pp.23-34, 2015.

Preprint DOI

[j11] (2014). Towards mathematical optimization of pediatric cranial vault remodeling. International Journal of Computer Assisted Radiology and Surgery, vol 9((Suppl 1)), pp.191-192, 2014.

[j10] (2013). The Time Dependent Traveling Salesman Problem: Polyhedra and Branch-Cut-and-Price Algorithm. Mathematical Programming Computation, vol 5(1), pp.27-55, 2013.

Preprint DOI

[bc1] (2013). Gomory Cuts. In Wiley Encyclopedia of Operations Research and Management Sciences, 2013.

PDF DOI

[j9] (2012). The master equality polyhedron with multiple rows. Mathematical Programming Series A, vol 132(1–2), pp.125-151, 2012.

Preprint DOI

[j8] (2012). Branch-and-Cut and Hybrid Local Search for the Multi-Level Capacitated Minimum Spanning Tree Problem. Networks, vol 59(1), pp.148-160, 2012.

PDF DOI

[j7] (2011). Strengthening lattice-free cuts using nonnegativity. Discrete Optimization, vol 8(2), pp.229-245, 2011.

Preprint DOI

[j6] (2011). On the exact separation of mixed integer knapsack cuts. Mathematical Programming Series A, vol 128, pp.19-41, 2011.

PDF DOI

[j5] (2010). Lifting, tilting and fractional programming revisited. Operations Research Letters, vol 38, pp.559-563, 2010.

PDF DOI

[c6] (2010). The Time Dependent Traveling Salesman Problem: Polyhedra and Branch-Cut-and-Price Algorithm. In Proceedings of the SEA 2010, Naples, Italy. Lecture Notes in Computer Science vol 6049, pp.202-213, 2010.

DOI

[j4] (2010). On a generalization of the master cyclic group polyhedron. Mathematical Programming Series A, vol 125(1), pp.1-30, 2010.

Preprint DOI

(2009). The Master Equality Polyhedron with Multiple Rows. IBM Research - Tech. Report No. RC24746, 2009.

(2009). Strengthening Lattice-free Cuts Using Non-negativity. IBM Research - Tech. Report No. RC24798, 2009.

[j3] (2009). Numerically safe Gomory mixed-integer cuts. INFORMS Journal on Computing, vol 21(4), pp.641-649, 2009.

PDF DOI

[th2] (2008). Single-row mixed-integer programs: Theory and computations. PhD thesis. Algorithms, Combinatorics and Optimization program, GeorgiaTech, 2008.

PDF

[j2] (2008). Robust Branch-Cut-and-Price for the Capacitated Minimum Spanning Tree Problem over a Large Extended Formulation. Mathematical Programming Series A, vol 112(2), pp.443-472, 2008.

PDF DOI

[c5] (2007). On the exact separation of mixed-integer knapsack cuts. In Proceedings of the twelfth Integer Programming and Combinatorial Optimization conference IPCO'07, Ithaca, NY. Lecture Notes in Computer Science vol 4513, pp.225-239, 2007.

DOI

[c4] (2007). On a generalization of the master cyclic group polyhedron. In Proceedings of the twelfth Integer Programming and Combinatorial Optimization conference IPCO'07, Ithaca, NY. Lecture Notes in Computer Science vol 4513, pp.197-209, 2007.

DOI

(2007). On a Generalization of the Master Cyclic Group Polyhedron. IBM Research - Tech. Report No. RC24201, 2007.

(2006). Robust Branch-Cut-and-Price for the Capacitated Minimum Spanning Tree Problem over a Large Extended Formulation. Logistics/SCM Research Group working paper series - Tech. Report No. L-2006-08, 2006.

[j1] (2006). Robust branch-and-cut-and-price for the Capacitated Vehicle Routing Problem. Mathematical Programming Series A, vol 106(3), pp.491-511, 2006.

PDF DOI

[c3] (2004). Robust branch-and-cut-and-price for the capacitated vehicle routing problem. In Proceedings of the tenth Integer Programming and Combinatorial Optimization conference IPCO'04, New York, Lecture Notes in Computer Science vol 3064, pp.1-15, 2004.

DOI

(2003). Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Universidade Federal Fluminense, Engenharia de Producao, Niteroi, Brazil - Tech. Report No. RPEP Vol.3 no.8, 2003.

[c2] (2003). Robust branch-and-cut-and-price for the Capacitated Minimum Spanning Tree Problem. In Proceedings of the International Network Optmization Conference, Evry, France, pp.231-236, 2003.

[c1] (2002). Solving the freight car flow problem to optimality. In Proceedings of the ATMOS 2002, Málaga, Spain. Electronic Notes in Theoretical Computer Science vol 66, pp.1-14, 2002.

PDF DOI

[th1] (2002). Solution of railroad logistics problems using Integer Programming (in Portuguese). Masters thesis. Electrical Engineering Department, PUC-Rio, 2002.

DOI