Ruslan Sadykov

47 papers B 5C 1Journal 38Unranked 1
YearRankTypeTitle / Venue / Authors
2025 J jnl
A branch-cut-and-price approach for the two-echelon vehicle routing problem with drones.
Comput. Oper. Res.
Sylvain Lichau, Ruslan Sadykov, Julien François, Rémy Dupas
2025 J jnl
Models and algorithms for configuring and testing prototype cars.
Comput. Oper. Res.
François Clautiaux, Siham Essodaigui, Alain Nguyen, Ruslan Sadykov, Nawel Younes
2024 J jnl
VRPSolverEasy: A Python Library for the Exact Solution of a Rich Vehicle Routing Problem.
INFORMS J. Comput.
Najib Errami, Eduardo Queiroga, Ruslan Sadykov, Eduardo Uchoa
2023 J jnl
A New Family of Route Formulations for Split Delivery Vehicle Routing Problems.
Transp. Sci.
Isaac Balster, Teobaldo Bulhões, Pedro Munari, Artur Alves Pessoa, Ruslan Sadykov
2023 J jnl
New exact and heuristic algorithms to solve the prize-collecting job sequencing problem with one common and multiple secondary resources.
Eur. J. Oper. Res.
Aurélien Froger, Ruslan Sadykov
2023 J jnl
Nonrobust Strong Knapsack Cuts for Capacitated Location Routing and Related Problems.
Oper. Res.
Pedro Henrique P. V. Liguori, Ali Ridha Mahjoub, Guillaume Marquès, Ruslan Sadykov, Eduardo Uchoa
2023 J jnl
Precedence constrained generalized traveling salesman problem: Polyhedral study, formulations, and branch-and-cut algorithm.
Eur. J. Oper. Res.
Daniil Khachai, Ruslan Sadykov, Olga Battaïa, Mikhail Yu. Khachay
2023 J jnl
Solving vehicle routing problems with intermediate stops using VRPSolver models.
Networks
Marcos Costa Roboredo, Ruslan Sadykov, Eduardo Uchoa
2023 J jnl
The two-echelon stochastic multi-period capacitated location-routing problem.
Eur. J. Oper. Res.
Imen Ben Mohamed, Walid Klibi, Ruslan Sadykov, Halil Sen, François Vanderbeck
2022 J jnl
A Branch-Cut-and-Price Approach for the Single-Trip and Multi-Trip Two-Echelon Vehicle Routing Problem with Time Windows.
Transp. Sci.
Guillaume Marquès, Ruslan Sadykov, Rémy Dupas, Jean-Christophe Deschamps
2022 J jnl
Bin Packing Problem with Time Lags.
INFORMS J. Comput.
Orlando Rivera Letelier, François Clautiaux, Ruslan Sadykov
2021 J jnl
A Bucket Graph-Based Labeling Algorithm with Application to Vehicle Routing.
Transp. Sci.
Ruslan Sadykov, Eduardo Uchoa, Artur Alves Pessoa
2021 J jnl
A POPMUSIC matheuristic for the capacitated vehicle routing problem.
Comput. Oper. Res.
Eduardo Queiroga, Ruslan Sadykov, Eduardo Uchoa
2021 J jnl
Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty.
Oper. Res.
Artur Alves Pessoa, Michael Poss, Ruslan Sadykov, François Vanderbeck
2021 J jnl
Design of robust programmable networks with bandwidth-optimal failure recovery scheme.
Comput. Networks
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
2021 J jnl
Solving Bin Packing Problems Using VRPSolver Models.
Oper. Res. Forum
Artur Alves Pessoa, Ruslan Sadykov, Eduardo Uchoa
2020 J jnl
A generic exact solver for vehicle routing and related problems.
Math. Program.
Artur Alves Pessoa, Ruslan Sadykov, Eduardo Uchoa, François Vanderbeck
2020 J jnl
An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem.
Comput. Oper. Res.
Guillaume Marquès, Ruslan Sadykov, Jean-Christophe Deschamps, Rémy Dupas
2020 J jnl
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].
Eur. J. Oper. Res.
Luis Gouveia, Markus Leitner, Mario Ruthmair, Ruslan Sadykov
2020 J jnl
On the exact solution of a large class of parallel machine scheduling problems.
J. Sched.
Teobaldo Bulhões, Ruslan Sadykov, Anand Subramanian, Eduardo Uchoa
2020 J jnl
On the exact solution of vehicle routing problems with backhauls.
Eur. J. Oper. Res.
Eduardo Queiroga, Yuri Frota, Ruslan Sadykov, Anand Subramanian, Eduardo Uchoa, Thibaut Vidal
2019 B conf
A Generic Exact Solver for Vehicle Routing and Related Problems.
IPCO
Artur Alves Pessoa, Ruslan Sadykov, Eduardo Uchoa, François Vanderbeck
2019 — conf
Bandwidth-optimal Failure Recovery Scheme for Robust Programmable Networks.
CloudNet
Andrea Tomassilli, Giuseppe Di Lena, Frédéric Giroire, Issam Tahiri, Damien Saucez, Stephane Perennes, Thierry Turletti, Ruslan Sadykov, François Vanderbeck, Chidung Lac
2019 — book
Modern Branch-Cut-and-Price.
Ruslan Sadykov
2019 J jnl
Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers.
EURO J. Comput. Optim.
François Clautiaux, Ruslan Sadykov, François Vanderbeck, Quentin Viaud
2019 B conf
Poster: design of survivable SDN/NFV-enabled networks with bandwidth-optimal failure recovery.
Networking
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
2019 J jnl
Primal Heuristics for Branch and Price: The Assets of Diving Methods.
INFORMS J. Comput.
Ruslan Sadykov, François Vanderbeck, Artur Alves Pessoa, Issam Tahiri, Eduardo Uchoa
2018 J jnl
A branch-and-price algorithm for the Minimum Latency Problem.
Comput. Oper. Res.
Teobaldo Bulhões, Ruslan Sadykov, Eduardo Uchoa
2018 J jnl
Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation.
INFORMS J. Comput.
Artur Alves Pessoa, Ruslan Sadykov, Eduardo Uchoa, François Vanderbeck
2018 J jnl
Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem.
Discret. Optim.
François Clautiaux, Ruslan Sadykov, François Vanderbeck, Quentin Viaud
2018 J jnl
Enhanced Branch-Cut-and-Price algorithm for heterogeneous fleet vehicle routing problems.
Eur. J. Oper. Res.
Artur Alves Pessoa, Ruslan Sadykov, Eduardo Uchoa
2016 J jnl
Column generation based approaches for a tour scheduling problem with a multi-skill heterogeneous workforce.
Eur. J. Oper. Res.
Matthieu Gérard, François Clautiaux, Ruslan Sadykov
2016 J jnl
The two-machine flowshop total completion time problem: Branch-and-bound algorithms based on network-flow formulation.
Eur. J. Oper. Res.
Boris Detienne, Ruslan Sadykov, Shunji Tanaka
2013 J jnl
Bin Packing with Conflicts: A Generic Branch-and-Price Algorithm.
INFORMS J. Comput.
Ruslan Sadykov, François Vanderbeck
2013 J jnl
Column generation for extended formulations.
EURO J. Comput. Optim.
Ruslan Sadykov, François Vanderbeck
2013 B conf
In-Out Separation and Column Generation Stabilization by Dual Price Smoothing.
SEA
Artur Alves Pessoa, Ruslan Sadykov, Eduardo Uchoa, François Vanderbeck
2013 C conf
Solving a Freight Railcar Flow Problem Arising in Russia.
ATMOS
Ruslan Sadykov, Alexander A. Lazarev, Vitaliy Shiryaev, Alexey Stratonnikov
2012 J jnl
A dominant class of schedules for malleable jobs in the problem to minimize the total weighted completion time.
Comput. Oper. Res.
Ruslan Sadykov
2012 B conf
Feasibility Pump Heuristics for Column Generation Approaches.
SEA
Pierre Pesneau, Ruslan Sadykov, François Vanderbeck
2012 J jnl
Scheduling incoming and outgoing trucks at cross docking terminals to minimize the storage cost.
Ann. Oper. Res.
Ruslan Sadykov
2011 J jnl
Column Generation for Extended Formulations.
Electron. Notes Discret. Math.
Ruslan Sadykov, François Vanderbeck
2010 J jnl
Column Generation based Primal Heuristics.
Electron. Notes Discret. Math.
Cédric Joncour, Sophie Michel, Ruslan Sadykov, Dmitry Sverdlov, François Vanderbeck
2010 J jnl
Time-indexed formulations for scheduling chains on a single machine: An application to airborne radars.
Eur. J. Oper. Res.
Philippe Baptiste, Ruslan Sadykov
2008 J jnl
A branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates.
Eur. J. Oper. Res.
Ruslan Sadykov
2006 J jnl
Integer Programming and Constraint Programming in Solving a Multimachine Assignment Scheduling Problem with Deadlines and Release Dates.
INFORMS J. Comput.
Ruslan Sadykov, Laurence A. Wolsey
2006 — —
Integer programming-based decomposition approaches for solving machine scheduling problems.
Ruslan Sadykov
2004 B conf
A Hybrid Branch-And-Cut Algorithm for the One-Machine Scheduling Problem.
CPAIOR
Ruslan Sadykov