Tatiana E. Romanova

Orcid: 0000-0002-8618-4917

According to our database1, Tatiana E. Romanova authored at least 34 papers between 2002 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Optimized Packing Titanium Alloy Powder Particles.
Comput., February, 2023

Sparse layout of irregular 3D clusters.
J. Oper. Res. Soc., January, 2023

Packing convex polygons in minimum-perimeter convex hulls.
J. Glob. Optim., 2023

2022
Editorial: Digitization of Organizations: Towards a New Paradigm of Real-Time Systems.
Mob. Networks Appl., 2022

Balanced Circular Packing Problems with Distance Constraints.
Comput., 2022

2021
Optimal layout of ellipses and its application for additive manufacturing.
Int. J. Prod. Res., 2021

Sparsest packing of two-dimensional objects.
Int. J. Prod. Res., 2021

Sparsest balanced packing of irregular 3D objects in a cylindrical container.
Eur. J. Oper. Res., 2021

2020
Packing ellipses in an optimized rectangular container.
Wirel. Networks, 2020

Lagrangian Approach to Modeling Placement Conditions in Optimized Packing Problems.
Mob. Networks Appl., 2020

Circular packing for support-free structures.
EAI Endorsed Trans. Energy Web, 2020

Solution Strategy for One-to-One Pickup and Delivery Problem Using the Cyclic Transfer Approach.
EAI Endorsed Trans. Energy Web, 2020

Packing ellipsoids in an optimized cylinder.
Eur. J. Oper. Res., 2020

Irregular layout problem for additive production.
Proceedings of The Third International Workshop on Computer Modeling and Intelligent Systems (CMIS-2020), 2020

Packing Irregular Polygons using Quasi Phi-functions.
Proceedings of the 10th International Conference on Advanced Computer Information Technologies, 2020

2019
Packing ellipses in an optimized convex polygon.
J. Glob. Optim., 2019

Optimal Packing Problems: From Knapsack Problem to Open Dimension Problem.
ICO, 2019

Decomposition Algorithm for Irregular Placement Problems.
ICO, 2019

Packing Convex 3D Objects with Special Geometric and Balancing Conditions.
ICO, 2019

Balance Packing Problem of Cuboids in an Optimized Cylindrical Container.
Proceedings of the 9th International Conference on Advanced Computer Information Technologies, 2019

2018
Packing of concave polyhedra with continuous rotations using nonlinear optimisation.
Eur. J. Oper. Res., 2018

Muticriteria Model of Balanced Layout Problem of 3D-Objects.
Proceedings of the International Conference Advanced Computer Information Technologies, 2018

Mathematical Model of Balanced Layout Problem Using Combinatorial Configurations.
Proceedings of the International Conference Advanced Computer Information Technologies, 2018

2016
On the global minimum in a balanced circular packing problem.
Optim. Lett., 2016

Cutting and packing problems for irregular objects with continuous rotations: mathematical modelling and non-linear optimization.
J. Oper. Res. Soc., 2016

Quasi-phi-functions and optimal packing of ellipses.
J. Glob. Optim., 2016

2015
Optimal clustering of a pair of irregular objects.
J. Glob. Optim., 2015

2014
Optimal Balanced Packing Using Phi-Function Technique.
Proceedings of the Examining Robustness and Vulnerability of Networked Systems, 2014

2012
Phi-Functions for 2D Objects Formed by Line Segments and Circular Arcs.
Adv. Oper. Res., 2012

2011
Covering a polygonal region by rectangles.
Comput. Optim. Appl., 2011

2010
Mathematical model and efficient algorithms for object packing problem.
Comput. Geom., 2010

Tools of mathematical modeling of arbitrary object packing problems.
Ann. Oper. Res., 2010

2004
Phi-functions for complex 2D-objects.
4OR, 2004

2002
Phi-functions for primary 2D-objects.
Stud. Inform. Univ., 2002


  Loading...