Yu. G. Stoyan

Orcid: 0000-0002-8053-0276

Affiliations:
  • National Academy of Sciences of Ukraine, Kharkov, Ukraine


According to our database1, Yu. G. Stoyan authored at least 33 papers between 1979 and 2024.

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

2024
Packing Spheres into a Minimum-Height Parabolic Container.
Axioms, June, 2024

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

Optimized packing unequal spheres into a multiconnected domain: mixed-integer non-linear programming approach.
Int. J. Comput. Math. Comput. Syst. Theory, 2021

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

2019
Decomposition Algorithm for Irregular Placement Problems.
ICO, 2019

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

2017
Enumeration and Generation of Permutations with a Partially Fixed Order of Elements.
Int. J. Comb. Optim. Probl. Informatics, 2017

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

Packing unequal circles into a strip of minimal length with a jump algorithm.
Optim. Lett., 2014

Packing Different Cuboids with Rotations and Spheres into a Cuboid.
Adv. Decis. Sci., 2014

Covering a convex 3D polytope by a minimal number of congruent spheres.
Int. J. Comput. Math., 2014

2013
Packing congruent spheres into a multi-connected polyhedral domain.
Int. Trans. Oper. Res., 2013

2012
Solving an optimization packing problem of circles and non-convex polygons with rotations into a multiply connected region.
J. Oper. Res. Soc., 2012

Packing congruent hyperspheres into a hypersphere.
J. Glob. Optim., 2012

Packing equal circles into a circle with circular prohibited areas.
Int. J. Comput. Math., 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
Packing identical spheres into a cylinder.
Int. Trans. Oper. Res., 2010

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

Covering a compact polygonal set by identical circles.
Comput. Optim. Appl., 2010

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

2009
Packing cylinders and rectangular parallelepipeds with distances between them into a given region.
Eur. J. Oper. Res., 2009

2004
A mathematical model and a solution method for the problem of placing various-sized circles into a strip.
Eur. J. Oper. Res., 2004

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

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

2000
A method of optimal lattice packing of congruent oriented polygons in the plane.
Eur. J. Oper. Res., 2000

1999
Regular packing of congruent polygons on the rectangular sheet.
Eur. J. Oper. Res., 1999

1990
Optimization Problems on Geometrical Design.
Proceedings of the Modelling the Innovation: Communications, 1990

1981
An Approach to the Problems of Routing Optimization in the Regions of Intricate Shape.
Inf. Process. Lett., 1981

1979
The Minimization Method for Some Permutation Functionals.
Inf. Process. Lett., 1979


  Loading...