A Hybrid Branch-And-Cut Algorithm for the One-Machine Scheduling Problem. - Ruslan Sadykov (CPAIOR, 2004)

Integer Programming and Constraint Programming in Solving a Multimachine Assignment Scheduling Problem with Deadlines and Release Dates. - Ruslan Sadykov; Laurence A. Wolsey (INFORMS J. Comput., 2006)

Integer programming-based decomposition approaches for solving machine scheduling problems. - Ruslan Sadykov (2006)

A branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates. - Ruslan Sadykov (Eur. J. Oper. Res., 2008)

Column Generation based Primal Heuristics. - Cédric Joncour; Sophie Michel; Ruslan Sadykov; Dmitry Sverdlov; François Vanderbeck (Electron. Notes Discret. Math., 2010)

Time-indexed formulations for scheduling chains on a single machine: An application to airborne radars. - Philippe Baptiste; Ruslan Sadykov (Eur. J. Oper. Res., 2010)

Feasibility Pump Heuristics for Column Generation Approaches. - Pierre Pesneau; Ruslan Sadykov; François Vanderbeck (SEA, 2012)

Scheduling incoming and outgoing trucks at cross docking terminals to minimize the storage cost. - Ruslan Sadykov (Ann. Oper. Res., 2012)

A dominant class of schedules for malleable jobs in the problem to minimize the total weighted completion time. - Ruslan Sadykov (Comput. Oper. Res., 2012)

Solving a Freight Railcar Flow Problem Arising in Russia. - Ruslan Sadykov; Alexander A. Lazarev; Vitaliy Shiryaev; Alexey Stratonnikov (ATMOS, 2013)

In-Out Separation and Column Generation Stabilization by Dual Price Smoothing. - Artur Alves Pessoa; Ruslan Sadykov; Eduardo Uchoa; François Vanderbeck (SEA, 2013)

Column generation for extended formulations. - Ruslan Sadykov; François Vanderbeck (EURO J. Comput. Optim., 2013)

Bin Packing with Conflicts: A Generic Branch-and-Price Algorithm. - Ruslan Sadykov; François Vanderbeck (INFORMS J. Comput., 2013)

The two-machine flowshop total completion time problem: Branch-and-bound algorithms based on network-flow formulation. - Boris Detienne; Ruslan Sadykov; Shunji Tanaka (Eur. J. Oper. Res., 2016)

Column generation based approaches for a tour scheduling problem with a multi-skill heterogeneous workforce. - Matthieu Gérard; François Clautiaux; Ruslan Sadykov (Eur. J. Oper. Res., 2016)

A branch-and-price algorithm for the Minimum Latency Problem. - Teobaldo Bulhões; Ruslan Sadykov; Eduardo Uchoa (Comput. Oper. Res., 2018)

Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem. - François Clautiaux; Ruslan Sadykov; François Vanderbeck; Quentin Viaud (Discret. Optim., 2018)

Enhanced Branch-Cut-and-Price algorithm for heterogeneous fleet vehicle routing problems. - Artur Alves Pessoa; Ruslan Sadykov; Eduardo Uchoa (Eur. J. Oper. Res., 2018)

Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation. - Artur Alves Pessoa; Ruslan Sadykov; Eduardo Uchoa; François Vanderbeck (INFORMS J. Comput., 2018)

Modern Branch-Cut-and-Price. - Ruslan Sadykov (2019)

Bandwidth-optimal Failure Recovery Scheme for Robust Programmable Networks. - Andrea Tomassilli; Giuseppe Di Lena; Frédéric Giroire; Issam Tahiri; Damien Saucez; Stephane Perennes; Thierry Turletti; Ruslan Sadykov; François Vanderbeck; Chidung Lac (CloudNet, 2019)

Poster: design of survivable SDN/NFV-enabled networks with bandwidth-optimal failure recovery. - Andrea Tomassilli; Chidung Lac; Giuseppe Di Lena; Frédéric Giroire; Issam Tahiri; Damien Saucez; Stéphane Pérennes; Thierry Turletti; Ruslan Sadykov; François Vanderbeck (Networking, 2019)

Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers. - François Clautiaux; Ruslan Sadykov; François Vanderbeck; Quentin Viaud (EURO J. Comput. Optim., 2019)

Primal Heuristics for Branch and Price: The Assets of Diving Methods. - Ruslan Sadykov; François Vanderbeck; Artur Alves Pessoa; Issam Tahiri; Eduardo Uchoa (INFORMS J. Comput., 2019)

An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem. - Guillaume Marquès; Ruslan Sadykov; Jean-Christophe Deschamps; Rémy Dupas (Comput. Oper. Res., 2020)

Corrigendum to "Extended Formulations and Branch-and-Cut Algorithms for the Black-and-White Traveling Salesman Problem" [European Journal of Operational Research, 262(3) 2017, 908-928]. - Luis Gouveia 001; Markus Leitner; Mario Ruthmair; Ruslan Sadykov (Eur. J. Oper. Res., 2020)

On the exact solution of vehicle routing problems with backhauls. - Eduardo Queiroga; Yuri Frota; Ruslan Sadykov; Anand Subramanian 001; Eduardo Uchoa; Thibaut Vidal (Eur. J. Oper. Res., 2020)

A generic exact solver for vehicle routing and related problems. - Artur Alves Pessoa; Ruslan Sadykov; Eduardo Uchoa; François Vanderbeck (Math. Program., 2020)

On the exact solution of a large class of parallel machine scheduling problems. - Teobaldo Bulhões; Ruslan Sadykov; Anand Subramanian 001; Eduardo Uchoa (J. Sched., 2020)

Design of robust programmable networks with bandwidth-optimal failure recovery scheme. - Andrea Tomassilli; Giuseppe Di Lena; Frédéric Giroire; Issam Tahiri; Damien Saucez; Stéphane Pérennes; Thierry Turletti; Ruslan Sadykov; François Vanderbeck; Chidung Lac (Comput. Networks, 2021)

A POPMUSIC matheuristic for the capacitated vehicle routing problem. - Eduardo Queiroga; Ruslan Sadykov; Eduardo Uchoa (Comput. Oper. Res., 2021)

Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty. - Artur Alves Pessoa; Michael Poss; Ruslan Sadykov; François Vanderbeck (Oper. Res., 2021)

Solving Bin Packing Problems Using VRPSolver Models. - Artur Alves Pessoa; Ruslan Sadykov; Eduardo Uchoa (Oper. Res. Forum, 2021)

A Bucket Graph-Based Labeling Algorithm with Application to Vehicle Routing. - Ruslan Sadykov; Eduardo Uchoa; Artur Alves Pessoa (Transp. Sci., 2021)

Bin Packing Problem with Time Lags. - Orlando Rivera Letelier; François Clautiaux; Ruslan Sadykov (INFORMS J. Comput., 2022)

A Branch-Cut-and-Price Approach for the Single-Trip and Multi-Trip Two-Echelon Vehicle Routing Problem with Time Windows. - Guillaume Marquès; Ruslan Sadykov; Rémy Dupas; Jean-Christophe Deschamps (Transp. Sci., 2022)

New exact and heuristic algorithms to solve the prize-collecting job sequencing problem with one common and multiple secondary resources. - Aurélien Froger; Ruslan Sadykov (Eur. J. Oper. Res., 2023)

The two-echelon stochastic multi-period capacitated location-routing problem. - Imen Ben Mohamed; Walid Klibi; Ruslan Sadykov; Halil Sen; François Vanderbeck (Eur. J. Oper. Res., 2023)

Nonrobust Strong Knapsack Cuts for Capacitated Location Routing and Related Problems. - Pedro Henrique P. V. Liguori; Ali Ridha Mahjoub; Guillaume Marquès; Ruslan Sadykov; Eduardo Uchoa (Oper. Res., 2023)

Solving vehicle routing problems with intermediate stops using VRPSolver models. - Marcos Costa Roboredo; Ruslan Sadykov; Eduardo Uchoa (Networks, 2023)

Precedence constrained generalized traveling salesman problem: Polyhedral study, formulations, and branch-and-cut algorithm. - Daniil Khachai; Ruslan Sadykov; Olga Battaïa; Mikhail Yu. Khachay (Eur. J. Oper. Res., 2023)

A New Family of Route Formulations for Split Delivery Vehicle Routing Problems. - Isaac Balster; Teobaldo Bulhões; Pedro Munari; Artur Alves Pessoa; Ruslan Sadykov (Transp. Sci., 2023)

VRPSolverEasy: A Python Library for the Exact Solution of a Rich Vehicle Routing Problem. - Najib Errami; Eduardo Queiroga; Ruslan Sadykov; Eduardo Uchoa (INFORMS J. Comput., 2024)

Models and algorithms for configuring and testing prototype cars. - François Clautiaux; Siham Essodaigui; Alain Nguyen; Ruslan Sadykov; Nawel Younes (Comput. Oper. Res., 2025)

A branch-cut-and-price approach for the two-echelon vehicle routing problem with drones. - Sylvain Lichau; Ruslan Sadykov; Julien François; Rémy Dupas (Comput. Oper. Res., 2025)