Roman V. Plotnikov

According to our database, Roman V. Plotnikov authored at least 19 papers between 2011 and 2022.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2022

Constrained Shortest Path and Hierarchical Structures.

Adil I. Erzin, Roman V. Plotnikov, Ilya Ladygin

Proceedings of the Learning and Intelligent Optimization - 16th International Conference, 2022

2021

GLS and VNS based heuristics for conflict-free minimum-latency aggregation scheduling in WSN.

Roman V. Plotnikov, Adil I. Erzin, Vyacheslav V. Zalyubovskiy

Optim. Methods Softw., 2021

Two-Bar Charts Packing Problem.

Adil I. Erzin, Gregory Melidi, Stepan Nazarenko, Roman V. Plotnikov

Optim. Lett., 2021

A 3/2-approximation for big two-bar charts packing.

Adil I. Erzin, Georgii Melidi, Stepan Nazarenko, Roman V. Plotnikov

J. Comb. Optim., 2021

Approximation Algorithms for Two-Bar Charts Packing Problem.

Adil I. Erzin, Gregory Melidi, Stepan Nazarenko, Roman V. Plotnikov

CoRR, 2021

Multi-channel Conflict-Free Square Grid Aggregation.

Roman V. Plotnikov, Adil I. Erzin

Proceedings of the Learning and Intelligent Optimization - 15th International Conference, 2021

2020

A 3/2-approximation for big two-bar charts packing.

Adil I. Erzin, Stepan Nazarenko, Gregory Melidi, Roman V. Plotnikov

CoRR, 2020

Two-Channel Conflict-Free Square Grid Aggregation.

Adil I. Erzin, Roman V. Plotnikov

Proceedings of the Learning and Intelligent Optimization - 14th International Conference, 2020

2019

VNDS for the min-power symmetric connectivity problem.

Roman V. Plotnikov, Adil I. Erzin, Nenad Mladenovic

Optim. Lett., 2019

Constructive Heuristics for Min-Power Bounded-Hops Symmetric Connectivity Problem.

Roman V. Plotnikov, Adil I. Erzin

Proceedings of the Mathematical Optimization Theory and Operations Research, 2019

The Convergecast Scheduling Problem on a Regular Triangular Grid.

Adil I. Erzin, Roman V. Plotnikov

Proceedings of the Mathematical Optimization Theory and Operations Research, 2019

Metaheuristics for Min-Power Bounded-Hops Symmetric Connectivity Problem.

Roman V. Plotnikov, Adil I. Erzin

Proceedings of the Learning and Intelligent Optimization - 13th International Conference, 2019

2018

The Accuracy of One Polynomial Algorithm for the Convergecast Scheduling Problem on a Square Grid with Rectangular Obstacles.

Adil I. Erzin, Roman V. Plotnikov

Proceedings of the Learning and Intelligent Optimization - 12th International Conference, 2018

2017

Convergecast with Unbounded Number of Channels.

Roman V. Plotnikov, Adil I. Erzin, Vyacheslav V. Zalyubovskiy

CoRR, 2017

Variable neighborhood search variants for Min-power symmetric connectivity problem.

Adil I. Erzin, Nenad Mladenovic, Roman V. Plotnikov

Comput. Oper. Res., 2017

Conflict-Free Data Aggregation on a Square Grid When Transmission Distance is Not Less Than 3.

Adil I. Erzin, Roman V. Plotnikov

Proceedings of the Algorithms for Sensor Systems, 2017

2016

Variable Neighborhood Search-Based Heuristics for Min-Power Symmetric Connectivity Problem in Wireless Networks.

Roman V. Plotnikov, Adil I. Erzin, Nenad Mladenovic

Proceedings of the Discrete Optimization and Operations Research, 2016

2015

Using VNS for the Optimal Synthesis of the Communication Tree in Wireless Sensor Networks.

Adil I. Erzin, Roman V. Plotnikov

Electron. Notes Discret. Math., 2015

2011

Wireless Sensor Network's Lifetime Maximization Problem in Case of Given Set of Covers.

Adil I. Erzin, Roman V. Plotnikov

Proceedings of the Computational Science and Its Applications - ICCSA 2011, 2011