default search action

combined dblp search
author search
venue search
publication search

ask others

Ilya Chernykh

> Home > Persons

Person information

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

2020 – today

see FAQ

What is the meaning of the colors in the publication lists?

2024
[j9]
- view
  authority control:
- export record
  dblp key:
  - journals/scheduling/ChernykhKS24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/scheduling/ChernykhKS24
Ilya Chernykh, Alexander V. Kononov, Sergey Sevastyanov:
An exact solution with an improved running time for the routing flow shop problem with two machines. J. Sched. 27(4): 329-340 (2024)
2021
[j8]
- view
  authority control:
- export record
  dblp key:
  - journals/amai/ChernykhP21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/amai/ChernykhP21
Ilya Chernykh, Artem V. Pyatkin:
Irreducible bin packing and normality in routing open shop. Ann. Math. Artif. Intell. 89(8-9): 899-918 (2021)
[j7]
- view
  authority control:
- export record
  dblp key:
  - journals/oms/ChernykhL21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/oms/ChernykhL21
Ilya Chernykh, Ekaterina Lgotina:
Two-machine routing open shop on a tree: instance reduction and efficiently solvable subclass. Optim. Methods Softw. 36(4): 821-841 (2021)
[j6]
- view
  authority control:
- export record
  dblp key:
  - journals/scheduling/KhramovaC21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/scheduling/KhramovaC21
Antonina P. Khramova, Ilya Chernykh:
A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing. J. Sched. 24(4): 405-412 (2021)
[c8]
- view
  authority control:
- export record
  dblp key:
  - conf/motor/Chernykh21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/motor/Chernykh21
Ilya Chernykh:
Two-Machine Routing Open Shop: How Long Is the Optimal Makespan? MOTOR 2021: 253-266
2020
[c7]
- view
  authority control:
- export record
  dblp key:
  - conf/motor/ChernykhK20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/motor/ChernykhK20
Ilya Chernykh, Olga Krivonogova:
On the Optima Localization for the Three-Machine Routing Open Shop. MOTOR 2020: 274-288
[c6]
- view
  authority control:
- export record
  dblp key:
  - conf/motor/ChernykhKS20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/motor/ChernykhKS20
Ilya Chernykh, Alexander V. Kononov, Sergey Sevastyanov:
A Polynomial-Time Algorithm for the Routing Flow Shop Problem with Two Machines: An Asymmetric Network with a Fixed Number of Nodes. MOTOR 2020: 301-312
[i2]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2004-03942
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2004-03942
Ilya Chernykh, Alexander V. Kononov, Sergey Sevastyanov:
A polynomial-time algorithm for the routing flow shop problem with two machines: an asymmetric network with a fixed number of nodes. CoRR abs/2004.03942 (2020)

2010 – 2019

see FAQ

What is the meaning of the colors in the publication lists?

2019
[c5]
- view
  authority control:
- export record
  dblp key:
  - conf/lion/ChernykhP19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/lion/ChernykhP19
Ilya Chernykh, Artem V. Pyatkin:
Irreducible Bin Packing: Complexity, Solvability and Application to the Routing Open Shop. LION 2019: 106-120
[c4]
- view
  authority control:
- export record
  dblp key:
  - conf/motor/ChernykhL19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/motor/ChernykhL19
Ilya Chernykh, Ekaterina Lgotina:
How the Difference in Travel Times Affects the Optima Localization for the Routing Open Shop. MOTOR 2019: 187-201
[i1]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1911-00236
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1911-00236
Ilya Chernykh, Ekaterina Lgotina:
Two-machine routing open shop on a tree: instance reduction and efficiently solvable subclass. CoRR abs/1911.00236 (2019)
2016
[c3]
- view
  authority control:
- export record
  dblp key:
  - conf/door/Chernykh16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/door/Chernykh16
Ilya Chernykh:
Routing Open Shop with Unrelated Travel Times. DOOR 2016: 272-283
[c2]
- view
  authority control:
- export record
  dblp key:
  - conf/door/ChernykhL16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/door/ChernykhL16
Ilya Chernykh, Ekaterina Lgotina:
The 2-Machine Routing Open Shop on a Triangular Transportation Network. DOOR 2016: 284-297
2014
[j5]
- view
  authority control:
- export record
  dblp key:
  - journals/anor/SevastyanovCC14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/anor/SevastyanovCC14
Sergey Sevastyanov, D. A. Chemisova, Ilya Chernykh:
On some properties of optimal schedules in the job shop problem with preemption and an arbitrary regular criterion. Ann. Oper. Res. 213(1): 253-270 (2014)
2013
[j4]
- view
  authority control:
- export record
  dblp key:
  - journals/cor/ChernykhKS13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cor/ChernykhKS13
Ilya Chernykh, Alexander V. Kononov, Sergey Sevastyanov:
Efficient approximation algorithms for the routing open shop problem. Comput. Oper. Res. 40(3): 841-847 (2013)

2000 – 2009

see FAQ

What is the meaning of the colors in the publication lists?

2009
[c1]
- view
  authority control:
- export record
  dblp key:
  - conf/waoa/ChernykhDKS09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/waoa/ChernykhDKS09
Ilya Chernykh, Nikita Dryuck, Alexander V. Kononov, Sergey Sevastyanov:
The Routing Open Shop Problem: New Approximation Algorithms. WAOA 2009: 75-85
2006
[j3]
- view
  authority control:
- export record
  dblp key:
  - journals/eor/AverbakhBC06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eor/AverbakhBC06
Igor Averbakh, Oded Berman, Ilya Chernykh:
The routing open-shop problem on a network: Complexity and approximation. Eur. J. Oper. Res. 173(2): 531-539 (2006)
2005
[j2]
- view
  authority control:
- export record
  dblp key:
  - journals/eor/AverbakhBC05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eor/AverbakhBC05
Igor Averbakh, Oded Berman, Ilya Chernykh:
A 6/5-approximation algorithm for the two-machine routing open-shop problem on a two-node network. Eur. J. Oper. Res. 166(1): 3-24 (2005)
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/orl/AverbakhBC05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/orl/AverbakhBC05
Igor Averbakh, Oded Berman, Ilya Chernykh:
The m-machine flowshop problem with unit-time operations and intree precedence constraints. Oper. Res. Lett. 33(3): 263-266 (2005)

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.