default search action
Ruslan Sadykov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j38]François Clautiaux
, Siham Essodaigui, Alain Nguyen, Ruslan Sadykov
Models and algorithms for configuring and testing prototype cars. Comput. Oper. Res. 173: 106834 (2025) - [j37]Sylvain Lichau
A branch-cut-and-price approach for the two-echelon vehicle routing problem with drones. Comput. Oper. Res. 173: 106869 (2025) - 2024
- [j36]Najib Errami, Eduardo Queiroga, Ruslan Sadykov, Eduardo Uchoa:
VRPSolverEasy: A Python Library for the Exact Solution of a Rich Vehicle Routing Problem. INFORMS J. Comput. 36(4): 956-965 (2024) - 2023
- [j35]Aurélien Froger
New exact and heuristic algorithms to solve the prize-collecting job sequencing problem with one common and multiple secondary resources. Eur. J. Oper. Res. 306(1): 65-82 (2023) - [j34]Imen Ben Mohamed
The two-echelon stochastic multi-period capacitated location-routing problem. Eur. J. Oper. Res. 306(2): 645-667 (2023) - [j33]Daniil Khachai
Precedence constrained generalized traveling salesman problem: Polyhedral study, formulations, and branch-and-cut algorithm. Eur. J. Oper. Res. 309(2): 488-505 (2023) - [j32]Pedro Henrique P. V. Liguori, Ali Ridha Mahjoub, Guillaume Marquès
Nonrobust Strong Knapsack Cuts for Capacitated Location Routing and Related Problems. Oper. Res. 71(5): 1577-1595 (2023) - [j31]Marcos Costa Roboredo, Ruslan Sadykov, Eduardo Uchoa
Solving vehicle routing problems with intermediate stops using VRPSolver models. Networks 81(3): 399-416 (2023) - [j30]Isaac Balster
A New Family of Route Formulations for Split Delivery Vehicle Routing Problems. Transp. Sci. 57(5): 1359-1378 (2023) - 2022
- [j29]Orlando Rivera Letelier
Bin Packing Problem with Time Lags. INFORMS J. Comput. 34(4): 2249-2270 (2022) - [j28]Guillaume Marquès
A Branch-Cut-and-Price Approach for the Single-Trip and Multi-Trip Two-Echelon Vehicle Routing Problem with Time Windows. Transp. Sci. 56(6): 1598-1617 (2022) - 2021
- [j27]Andrea Tomassilli, Giuseppe Di Lena, Frédéric Giroire
Design of robust programmable networks with bandwidth-optimal failure recovery scheme. Comput. Networks 192: 108043 (2021) - [j26]Eduardo Queiroga, Ruslan Sadykov, Eduardo Uchoa:
A POPMUSIC matheuristic for the capacitated vehicle routing problem. Comput. Oper. Res. 136: 105475 (2021) - [j25]Artur Alves Pessoa
Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty. Oper. Res. 69(3): 739-754 (2021) - [j24]Artur Alves Pessoa
Solving Bin Packing Problems Using VRPSolver Models. Oper. Res. Forum 2(2) (2021) - [j23]Ruslan Sadykov
A Bucket Graph-Based Labeling Algorithm with Application to Vehicle Routing. Transp. Sci. 55(1): 4-28 (2021) - 2020
- [j22]Guillaume Marquès
An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem. Comput. Oper. Res. 114 (2020) - [j21]Luis Gouveia, Markus Leitner
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. 285(3): 1199-1203 (2020) - [j20]Eduardo Queiroga, Yuri Frota, Ruslan Sadykov
On the exact solution of vehicle routing problems with backhauls. Eur. J. Oper. Res. 287(1): 76-89 (2020) - [j19]Artur Alves Pessoa, Ruslan Sadykov
A generic exact solver for vehicle routing and related problems. Math. Program. 183(1): 483-523 (2020) - [j18]Teobaldo Bulhões, Ruslan Sadykov
On the exact solution of a large class of parallel machine scheduling problems. J. Sched. 23(4): 411-429 (2020)
2010 – 2019
- 2019
- [b2]Ruslan Sadykov:
Modern Branch-Cut-and-Price. University of Bordeaux, France, 2019 - [j17]François Clautiaux, Ruslan Sadykov
Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers. EURO J. Comput. Optim. 7(3): 265-297 (2019) - [j16]Ruslan Sadykov
Primal Heuristics for Branch and Price: The Assets of Diving Methods. INFORMS J. Comput. 31(2): 251-267 (2019) - [c7]Andrea Tomassilli, Giuseppe Di Lena, Frédéric Giroire, Issam Tahiri, Damien Saucez, Stephane Perennes, Thierry Turletti, Ruslan Sadykov
Bandwidth-optimal Failure Recovery Scheme for Robust Programmable Networks. CloudNet 2019: 1-6 - [c6]Artur Alves Pessoa, Ruslan Sadykov
A Generic Exact Solver for Vehicle Routing and Related Problems. IPCO 2019: 354-369 - [c5]Andrea Tomassilli, Chidung Lac, Giuseppe Di Lena, Frédéric Giroire, Issam Tahiri, Damien Saucez, Stéphane Pérennes, Thierry Turletti, Ruslan Sadykov
Poster: design of survivable SDN/NFV-enabled networks with bandwidth-optimal failure recovery. Networking 2019: 1-2 - 2018
- [j15]Teobaldo Bulhões
A branch-and-price algorithm for the Minimum Latency Problem. Comput. Oper. Res. 93: 66-78 (2018) - [j14]François Clautiaux, Ruslan Sadykov
Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem. Discret. Optim. 29: 18-44 (2018) - [j13]Artur Alves Pessoa, Ruslan Sadykov
Enhanced Branch-Cut-and-Price algorithm for heterogeneous fleet vehicle routing problems. Eur. J. Oper. Res. 270(2): 530-543 (2018) - [j12]Artur Alves Pessoa, Ruslan Sadykov
Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation. INFORMS J. Comput. 30(2): 339-360 (2018) - 2016
- [j11]Boris Detienne
The two-machine flowshop total completion time problem: Branch-and-bound algorithms based on network-flow formulation. Eur. J. Oper. Res. 252(3): 750-760 (2016) - [j10]Matthieu Gérard, François Clautiaux, Ruslan Sadykov
Column generation based approaches for a tour scheduling problem with a multi-skill heterogeneous workforce. Eur. J. Oper. Res. 252(3): 1019-1030 (2016) - 2013
- [j9]Ruslan Sadykov, François Vanderbeck:
Column generation for extended formulations. EURO J. Comput. Optim. 1(1-2): 81-115 (2013) - [j8]Ruslan Sadykov
Bin Packing with Conflicts: A Generic Branch-and-Price Algorithm. INFORMS J. Comput. 25(2): 244-255 (2013) - [c4]Ruslan Sadykov
Solving a Freight Railcar Flow Problem Arising in Russia. ATMOS 2013: 55-67 - [c3]Artur Alves Pessoa
In-Out Separation and Column Generation Stabilization by Dual Price Smoothing. SEA 2013: 354-365 - 2012
- [j7]Ruslan Sadykov
Scheduling incoming and outgoing trucks at cross docking terminals to minimize the storage cost. Ann. Oper. Res. 201(1): 423-440 (2012) - [j6]Ruslan Sadykov
A dominant class of schedules for malleable jobs in the problem to minimize the total weighted completion time. Comput. Oper. Res. 39(6): 1265-1270 (2012) - [c2]Pierre Pesneau, Ruslan Sadykov
Feasibility Pump Heuristics for Column Generation Approaches. SEA 2012: 332-343 - 2011
- [j5]Ruslan Sadykov
Column Generation for Extended Formulations. Electron. Notes Discret. Math. 37: 357-362 (2011) - 2010
- [j4]Cédric Joncour, Sophie Michel, Ruslan Sadykov
Column Generation based Primal Heuristics. Electron. Notes Discret. Math. 36: 695-702 (2010) - [j3]Philippe Baptiste, Ruslan Sadykov
Time-indexed formulations for scheduling chains on a single machine: An application to airborne radars. Eur. J. Oper. Res. 203(2): 476-483 (2010)
2000 – 2009
- 2008
- [j2]Ruslan Sadykov
A branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates. Eur. J. Oper. Res. 189(3): 1284-1304 (2008) - 2006
- [b1]Ruslan Sadykov:
Integer programming-based decomposition approaches for solving machine scheduling problems. Catholic University of Louvain, Louvain-la-Neuve, Belgium, 2006 - [j1]Ruslan Sadykov
Integer Programming and Constraint Programming in Solving a Multimachine Assignment Scheduling Problem with Deadlines and Release Dates. INFORMS J. Comput. 18(2): 209-217 (2006) - 2004
- [c1]Ruslan Sadykov:
A Hybrid Branch-And-Cut Algorithm for the One-Machine Scheduling Problem. CPAIOR 2004: 409-415
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 21:37 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: