Optimal Investment in the Development of Oil and Gas Field

Erzin, Adil; Plotnikov, Roman; Korobkin, Alexei; Melidi, Gregory; Nazarenko, Stepan

doi:10.1007/978-3-030-58657-7_27

Cited by 10 publications

(8 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The 2-BCPP was first formulated in [11] and then examined in [12,13,14], where the similar problems were described. These problems are the Bin Packing Problem (BPP) [17], the Strip Packing Problem (SPP) [1,8], and the 2-D Vector Packing Problem (2-DVPP) [19].…”

Section: Related Resultsmentioning

confidence: 99%

See 1 more Smart Citation

Approximation Algorithms for Two-Bar Charts Packing Problem

Erzin¹,

Melidi²,

Nazarenko³

et al. 2021

Preprint

Self Cite

View full text Add to dashboard Cite

In the Two-Bar Charts Packing Problem (2-BCPP), it is required to pack the bar charts (BCs) consisting of two bars into the horizontal unit-height strip of minimal length. The bars may move vertically within the strip, but it is forbidden to change the order and separate the chart's bars. Recently, for this new problem, which is a generalization of the Bin Packing Problem (BPP), Strip Packing Problem (SPP), and 2-Dimensional Vector Packing Problem (2-DVPP), several approximation algorithms with guaranteed estimates were proposed. However, after a preliminary analysis of the solutions constructed by approximation algorithms, we discerned that the guaranteed estimates are inaccurate. This fact inspired us to conduct a numerical experiment in which the approximate solutions are compared to each other and with the optimal ones. To construct the optimal solutions or lower bounds for optimum, we use the Boolean Linear Programming (BLP) formulation of 2-BCPP proposed earlier and apply the CPLEX package. We also use a database of instances for BPP with known optimal solutions to construct the instances for the 2-BCPP with known minimal packing length. The results of the simulation make up the main content of this paper.

show abstract

Section: Related Resultsmentioning

confidence: 99%

“…In [11], we studied the problem of optimizing an investment portfolio in the oil and gas field. Each project is characterized by the annual volume of hydrocarbon production, adequately displayed with bar charts.…”

Section: Introductionmentioning

confidence: 99%

Approximation Algorithms for Two-Bar Charts Packing Problem

Erzin¹,

Melidi²,

Nazarenko³

et al. 2021

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…Where the problem in question came from can be found in our papers [9,10]. In its refined form, it is formulated as follows.…”

Section: Introductionmentioning

confidence: 99%

An Improved Approximation for Packing Big Two-Bar Charts

Erzin¹,

Shenmaier²

2021

Preprint

Self Cite

View full text Add to dashboard Cite

Recently, we presented a new Two-Bar Charts Packing Problem (2-BCPP), in which it is necessary to pack two-bar charts (2-BCs) in a unit-height strip of minimum length. The problem is a generalization of the Bin Packing Problem and 2-D Vector Packing Problem. Earlier, we have proposed several polynomial approximation algorithms. In particular, when each 2-BC has at least one bar of height more than 1/2, we have proposed a 3/2-approximation polynomial algorithm. This paper proposes an O(n 3 )-time 16/11-approximation algorithm for packing 2-BCs when at least one bar of each BC has a height not less than 1/2 and an O(n 2.5 )-time 5/4-approximation algorithm for packing nonincreasing or non-decreasing 2-BCs when each 2-BC has at least one bar which height is more than 1/2, where n is the number of 2-BCs.

show abstract

“…We faced the need to solve the problem when determined the start times for oil and gas field development projects in compliance with the annual production limits [3].…”

Section: Introductionmentioning

confidence: 99%

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

Erzin¹,

Nazarenko²,

Melidi³

et al. 2020

Preprint

Self Cite

View full text Add to dashboard Cite

We consider a Two-Bar Charts Packing Problem (2-BCPP), in which it is necessary to pack two-bar charts (2-BCs) in a unit-height strip of minimum length. The problem is a generalization of the Bin Packing Problem (BPP). Earlier, we proposed an O(n 2 )-time algorithm that constructs the packing which length at most 2 • OP T + 1, where OP T is the minimum length of the packing of n 2-BCs. In this paper, we propose an O(n 4 )-time 3/2-approximate algorithm when each BC has at least one bar greater than 1/2.

show abstract

Optimal Investment in the Development of Oil and Gas Field

Cited by 10 publications

References 15 publications

Approximation Algorithms for Two-Bar Charts Packing Problem

Approximation Algorithms for Two-Bar Charts Packing Problem

An Improved Approximation for Packing Big Two-Bar Charts

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

Contact Info

Product

Resources

About