default search action
Tatiana E. Romanova
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j29]Yuriy Stoyan, Georgiy Yaskov
, Tetyana Romanova, Igor S. Litvinchev
Packing Spheres into a Minimum-Height Parabolic Container. Axioms 13(6): 396 (2024) - [j28]Andreas Fischer
Packing spheres with quasi-containment conditions. J. Glob. Optim. 90(3): 671-689 (2024) - [j27]Igor S. Litvinchev
Packing Soft Convex Polygons in an Optimized Convex Container. Mob. Networks Appl. 29(1): 211-220 (2024) - [j26]Julia A. Bennell
Packing stretched convex polygons in an optimized rectangle. Wirel. Networks 30(8): 7369-7376 (2024) - 2023
- [j25]Zoia Duriagina
Optimized Packing Titanium Alloy Powder Particles. Comput. 11(2): 22 (2023) - [j24]Josef Kallrath, Tatiana E. Romanova, Aleksandr V. Pankratov, Igor S. Litvinchev, Luis Infante:
Packing convex polygons in minimum-perimeter convex hulls. J. Glob. Optim. 85(1): 39-59 (2023) - [j23]Tatiana E. Romanova, Aleksandr V. Pankratov, Igor S. Litvinchev
Sparse layout of irregular 3D clusters. J. Oper. Res. Soc. 74(1): 351-361 (2023) - 2022
- [j22]Tetyana Romanova, Olexandr Pankratov, Igor S. Litvinchev
Balanced Circular Packing Problems with Distance Constraints. Comput. 10(7): 113 (2022) - [j21]Igor S. Litvinchev, Tatiana E. Romanova:
Editorial: Digitization of Organizations: Towards a New Paradigm of Real-Time Systems. Mob. Networks Appl. 27(5): 2170-2171 (2022) - 2021
- [j20]Tatiana E. Romanova, Yurij Stoyan, Alexander V. Pankratov, Igor S. Litvinchev
Sparsest balanced packing of irregular 3D objects in a cylindrical container. Eur. J. Oper. Res. 291(1): 84-100 (2021) - [j19]Tatiana E. Romanova, Yuri Stoyan, Alexander V. Pankratov, Igor S. Litvinchev
Optimal layout of ellipses and its application for additive manufacturing. Int. J. Prod. Res. 59(2): 560-575 (2021) - [j18]Tatiana E. Romanova
Sparsest packing of two-dimensional objects. Int. J. Prod. Res. 59(13): 3900-3915 (2021) - 2020
- [j17]Tatiana E. Romanova, Igor S. Litvinchev
Packing ellipsoids in an optimized cylinder. Eur. J. Oper. Res. 285(2): 429-443 (2020) - [j16]Rémy Dupas
Solution Strategy for One-to-One Pickup and Delivery Problem Using the Cyclic Transfer Approach. EAI Endorsed Trans. Energy Web 7(27): e5 (2020) - [j15]Igor Yanchevskyi, Roland Lachmayer, Iryna Mozgova, René-Bastian Lippert, Georgiy Yaskov
Circular packing for support-free structures. EAI Endorsed Trans. Energy Web 7(30): e3 (2020) - [j14]Igor S. Litvinchev
Lagrangian Approach to Modeling Placement Conditions in Optimized Packing Problems. Mob. Networks Appl. 25(6): 2126-2133 (2020) - [j13]Aleksandr V. Pankratov, Tatiana E. Romanova
Packing ellipses in an optimized rectangular container. Wirel. Networks 26(7): 4869-4879 (2020) - [c8]Alexander V. Pankratov, Tatiana E. Romanova, Sergiy Shekhovtsov
Packing Irregular Polygons using Quasi Phi-functions. ACIT 2020: 1-5 - [c7]Andrey Chugay, Aleksandr V. Pankratov, Tetyana Romanova:
Irregular layout problem for additive production. CMIS 2020: 569-579
2010 – 2019
- 2019
- [j12]Aleksandr V. Pankratov, Tatiana E. Romanova, Igor S. Litvinchev
Packing ellipses in an optimized convex polygon. J. Glob. Optim. 75(2): 495-522 (2019) - [c6]Inna Urniaieva
Balance Packing Problem of Cuboids in an Optimized Cylindrical Container. ACIT 2019: 133-136 - [c5]Tetyana Romanova, Yurij Stoyan, Alexander V. Pankratov
Decomposition Algorithm for Irregular Placement Problems. ICO 2019: 214-221 - [c4]Tatiana E. Romanova, Igor S. Litvinchev
Packing Convex 3D Objects with Special Geometric and Balancing Conditions. ICO 2019: 273-281 - [c3]Georgiy Yaskov
Optimal Packing Problems: From Knapsack Problem to Open Dimension Problem. ICO 2019: 671-678 - 2018
- [j11]Tatiana E. Romanova, Julia A. Bennell
Packing of concave polyhedra with continuous rotations using nonlinear optimisation. Eur. J. Oper. Res. 268(1): 37-53 (2018) - [c2]Igor Grebennik, Tatiana E. Romanova, Inna Urniaieva, Sergey Shekhovtsov:
Mathematical Model of Balanced Layout Problem Using Combinatorial Configurations. ACIT 2018: 18-21 - [c1]Inna Urniaieva, Igor Grebennik, Tatiana E. Romanova, Alexander V. Pankratov, Anna Kovalenko:
Muticriteria Model of Balanced Layout Problem of 3D-Objects. ACIT 2018: 22-25 - 2016
- [j10]Yuri Stoyan
Quasi-phi-functions and optimal packing of ellipses. J. Glob. Optim. 65(2): 283-307 (2016) - [j9]Yuriy Stoyan
Cutting and packing problems for irregular objects with continuous rotations: mathematical modelling and non-linear optimization. J. Oper. Res. Soc. 67(5): 786-800 (2016) - [j8]Petro I. Stetsyuk
On the global minimum in a balanced circular packing problem. Optim. Lett. 10(6): 1347-1360 (2016) - 2015
- [j7]Julia A. Bennell
Optimal clustering of a pair of irregular objects. J. Glob. Optim. 61(3): 497-524 (2015) - 2014
- [p1]Yuriy Stoyan, Petro Stetsyuk, Tatiana E. Romanova:
Optimal Balanced Packing Using Phi-Function Technique. Examining Robustness and Vulnerability of Networked Systems 2014: 251-271 - 2012
- [j6]Nikolai I. Chernov, Yuri Stoyan
Phi-Functions for 2D Objects Formed by Line Segments and Circular Arcs. Adv. Oper. Res. 2012: 346358:1-346358:26 (2012) - 2011
- [j5]Yu. G. Stoyan
Covering a polygonal region by rectangles. Comput. Optim. Appl. 48(3): 675-695 (2011) - 2010
- [j4]Julia A. Bennell
Tools of mathematical modeling of arbitrary object packing problems. Ann. Oper. Res. 179(1): 343-368 (2010) - [j3]Nikolai I. Chernov, Yu. G. Stoyan, Tatiana E. Romanova:
Mathematical model and efficient algorithms for object packing problem. Comput. Geom. 43(5): 535-553 (2010)
2000 – 2009
- 2004
- [j2]Yurij Stoyan
Phi-functions for complex 2D-objects. 4OR 2(1): 69-84 (2004) - 2002
- [j1]Yurij Stoyan, Johannes Terno, Guntram Scheithauer, Nikolay Gil, Tatiana E. Romanova:
Phi-functions for primary 2D-objects. Stud. Inform. Univ. 2(1): 1-32 (2002)
Coauthor Index
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-23 20:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: