Showing math.OCShow all
3 papers · 1 filter
math.OC2022
A approximation for big two-bar charts packing problem
Adil Erzin, Alexander Kononov, Georgii Melidi +1
Two-Bar Charts Packing Problem is to pack two-bar charts (2-BCs) in a minimal number of unit-capacity bins. This problem generalizes the strongly NP-hard Bin Packing Problem. W…
math.OC2020
Optimal Investment in the Development of Oil and Gas Field
Adil Erzin, Roman Plotnikov, Alexei Korobkin +2
Let an oil and gas field consists of clusters in each of which an investor can launch at most one project. During the implementation of a particular project, all characteristics ar…
math.OC2019
Metaheuristics for Min-Power Bounded-Hops Symmetric Connectivity Problem
Roman Plotnikov, Adil Erzin
We consider a Min-Power Bounded-Hops Symmetric Connectivity problem that consists of the construction of communication spanning tree on a given graph, where the total energy consum…