Lagrangian Decomposition Methods for Large-Scale Fixed-Charge Capacitated Multicommodity Network Design Problem. (Méthodes de Décomposition Lagrangienne pour le Problème à Grande Échelle de Synthèse de Réseaux Multi-Flot Avec Coûts Fixes et Capacités). - Rui Sa Shibasaki (2020)

Lagrangian bounds for large-scale multicommodity network design: a comparison between Volume and Bundle methods. - Rui Sa Shibasaki; Mourad Baïou; Francisco Barahona; Philippe Mahey; Maurício C. de Souza (Int. Trans. Oper. Res., 2021)

Optimizing Power Peaks in Simple Assembly Line Balancing Through Maximum Satisfiability. - Zhifei Zheng; Sami Cherif; Rui Sa Shibasaki (ICTAI, 2024)

A new upper bound based on Dantzig-Wolfe decomposition to maximize the stability radius of a simple assembly line under uncertainty. - Rui Sa Shibasaki; André Rossi; Evgeny Gurevsky 001 (Eur. J. Oper. Res., 2024)

Maximum Satisfiability Formulations for Nonlinear Integer Programming. - Zhifei Zheng; Sami Cherif; Rui Sa Shibasaki; Chu Min Li 001; Jialu Zhang (JELIA (2), 2025)

Exact Approaches for the Diverse Satisfiability Problem. - Zhifei Zheng; Sami Cherif; Rui Sa Shibasaki; Chu Min Li 001; Jialu Zhang (JELIA (2), 2025)

Volume-based branch-and-cut algorithm for large-scale fixed-charge multicommodity network design. - Rui Sa Shibasaki; Mourad Baïou; Francisco Barahona; Philippe Mahey; Maurício C. de Souza (Ann. Oper. Res., 2025)