Ruslan Sadykov

Orcid: 0000-0002-4862-2226

According to our database1, Ruslan Sadykov authored at least 40 papers between 2004 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
A New Family of Route Formulations for Split Delivery Vehicle Routing Problems.
Transp. Sci., September, 2023

Precedence constrained generalized traveling salesman problem: Polyhedral study, formulations, and branch-and-cut algorithm.
Eur. J. Oper. Res., September, 2023

Solving vehicle routing problems with intermediate stops using VRPSolver models.
Networks, April, 2023

The two-echelon stochastic multi-period capacitated location-routing problem.
Eur. J. Oper. Res., 2023

New exact and heuristic algorithms to solve the prize-collecting job sequencing problem with one common and multiple secondary resources.
Eur. J. Oper. Res., 2023

2022
Bin Packing Problem with Time Lags.
INFORMS J. Comput., 2022

2021
A Bucket Graph-Based Labeling Algorithm with Application to Vehicle Routing.
Transp. Sci., 2021

Solving Bin Packing Problems Using VRPSolver Models.
Oper. Res. Forum, 2021

Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty.
Oper. Res., 2021

A POPMUSIC matheuristic for the capacitated vehicle routing problem.
Comput. Oper. Res., 2021

Design of robust programmable networks with bandwidth-optimal failure recovery scheme.
Comput. Networks, 2021

2020
On the exact solution of a large class of parallel machine scheduling problems.
J. Sched., 2020

A generic exact solver for vehicle routing and related problems.
Math. Program., 2020

On the exact solution of vehicle routing problems with backhauls.
Eur. J. 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].
Eur. J. Oper. Res., 2020

An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem.
Comput. Oper. Res., 2020

2019
Primal Heuristics for Branch and Price: The Assets of Diving Methods.
INFORMS J. Comput., 2019

Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers.
EURO J. Comput. Optim., 2019

Poster: design of survivable SDN/NFV-enabled networks with bandwidth-optimal failure recovery.
Proceedings of the 2019 IFIP Networking Conference, 2019

Bandwidth-optimal Failure Recovery Scheme for Robust Programmable Networks.
Proceedings of the 2019 IEEE 8th International Conference on Cloud Networking, 2019

Modern Branch-Cut-and-Price.
, 2019

2018
Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation.
INFORMS J. Comput., 2018

Enhanced Branch-Cut-and-Price algorithm for heterogeneous fleet vehicle routing problems.
Eur. J. Oper. Res., 2018

Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem.
Discret. Optim., 2018

A branch-and-price algorithm for the Minimum Latency Problem.
Comput. Oper. Res., 2018

2016
Column generation based approaches for a tour scheduling problem with a multi-skill heterogeneous workforce.
Eur. J. Oper. Res., 2016

The two-machine flowshop total completion time problem: Branch-and-bound algorithms based on network-flow formulation.
Eur. J. Oper. Res., 2016

2013
Bin Packing with Conflicts: A Generic Branch-and-Price Algorithm.
INFORMS J. Comput., 2013

In-Out Separation and Column Generation Stabilization by Dual Price Smoothing.
Proceedings of the Experimental Algorithms, 12th International Symposium, 2013

Solving a Freight Railcar Flow Problem Arising in Russia.
Proceedings of the 13th Workshop on Algorithmic Approaches for Transportation Modelling, 2013

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

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

Feasibility Pump Heuristics for Column Generation Approaches.
Proceedings of the Experimental Algorithms - 11th International Symposium, 2012

2011
Column Generation for Extended Formulations.
Electron. Notes Discret. Math., 2011

2010
Time-indexed formulations for scheduling chains on a single machine: An application to airborne radars.
Eur. J. Oper. Res., 2010

Column Generation based Primal Heuristics.
Electron. Notes Discret. Math., 2010

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

2006
Integer programming-based decomposition approaches for solving machine scheduling problems.
PhD thesis, 2006

Integer Programming and Constraint Programming in Solving a Multimachine Assignment Scheduling Problem with Deadlines and Release Dates.
INFORMS J. Comput., 2006

2004
A Hybrid Branch-And-Cut Algorithm for the One-Machine Scheduling Problem.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2004


  Loading...