Cover Image

On two approaches to model and solve the packing problem for convex polytopes

Saved in:

Bibliographic Details
Date:	2018
Main Authors:	Ju. E. Stojan, A. M. Chugaj, A. V. Pankratov, T. E. Romanova
Format:	Article
Language:	English
Published:	2018
Series:	Cybernetics and Systems Analysis
Online Access:	http://jnas.nbuv.gov.ua/article/UJRN-0000889047
Tags:	Add Tag No Tags, Be the first to tag this record!
Journal Title:	Library portal of National Academy of Sciences of Ukraine \| LibNAS

Institution

Library portal of National Academy of Sciences of Ukraine | LibNAS

Similar Items

Optimal packing of convex polytopes using quasi-phi-functions
by: Pankratov, A. V., et al.
Published: (2015)

Optimal packing of convex polytopes using quasi-phi-functions
by: Pankratov, A. V., et al.
Published: (2015)

A problem of packing of homothetic convex polytopes
by: Yu. H. Stoian, et al.
Published: (2017)

Packing convex homothetic polytopes into a cuboid
by: Stoyan, Yu. G., et al.
Published: (2018)

Packing convex homothetic polytopes into a cuboid
by: Stoyan, Yu. G., et al.
Published: (2018)

The lower bound for the volume of a three-dimensional convex polytope
by: Kawaguchi, Ryo
Published: (2016)

Layout problems for arc objects in convex domains
by: Pankratov, A., et al.
Published: (2016)

Layout problems for arc objects in convex domains
by: Pankratov, A., et al.
Published: (2016)

Multistage approach to solving the optimization packing problem for concave polyhedra
by: Yu. H. Stoian, et al.
Published: (2020)

On method of solving the problem of convex programming
by: E. I. Nenakhov
Published: (2018)

Fragmentary structures in two-dimensional strip packing problem
by: I. V. Kozin, et al.
Published: (2019)

Methodology to Solve Multi-Dimentional Sphere Packing Problems
by: Yaskov, G. N.
Published: (2019)

Methodology to Solve Multi-Dimentional Sphere Packing Problems
by: Yaskov, G. N.
Published: (2019)

Methodology to Solve Multi-Dimentional Sphere Packing Problems
by: G. N. Yaskov
Published: (2019)

Analysis of Genetic Algorithms for solving the 2D Orthogonal Strip Packing Problem
by: Glybovets, M.M., et al.
Published: (2018)

Solving the problem of optimal packing of homothetic ellipsoids into a container of minimal volume
by: Хлуд, О. М.
Published: (2016)

Solving the problem of optimal packing of homothetic ellipsoids into a container of minimal volume
by: Хлуд, О. М.
Published: (2016)

Existence of solutions and solving method of lexicographic problem of convex optimization with the linear criteria functions
by: N. V. Semenova, et al.
Published: (2020)

Linear classifier and projection onto a polytope
by: N. G. Zhurbenko
Published: (2020)

Convex Polygonal Hull for a Pair of Irregular Objects
by: V. M. Dubynskyi, et al.
Published: (2021)

An Estimation of the Length of a Convex Curve in Two-Dimensional Aleksandrov Spaces
by: A. A. Borisenko
Published: (2020)

One approach to a search for good local minimum of a packing problem of cylindrical object
by: Чугай, А. М.
Published: (2014)

One approach to a search for good local minimum of a packing problem of cylindrical object
by: Чугай, А. М.
Published: (2014)

Fragmentary Model and Evolutionary Algorithms 2D- packing Objects
by: I. V. Kozin, et al.
Published: (2017)

Decomposition Algorithm for Optimization Placement Problems
by: A. Pankratov, et al.
Published: (2019)

Physical Model and Calculation of Face Packing Seals
by: Shevchenko, Serhii S.
Published: (2021)

Physical Model and Calculation of Face Packing Seals
by: Shevchenko, Serhii S.
Published: (2021)

Physical Model and Calculation of Face Packing Seals
by: S. S. Shevchenko
Published: (2020)

Algorithm for solving two-criteria problem of optimal portfolio of risky as-sets
by: F. G. Garashchenko, et al.
Published: (2018)

The Criterions of the Extremality of a Sequence for the Problem of Finding the Distance Between Two Convex Sets of the Linear Normed Space
by: Гудима, Уляна Василівна, et al.
Published: (2019)

The Criterions of the Extremality of a Sequence for the Problem of Finding the Distance Between Two Convex Sets of the Linear Normed Space
by: U. V. Hudyma, et al.
Published: (2019)

The theory of convex extensions in combinatorial optimization problems
by: S. V. Jakovlev
Published: (2017)

The Quasi-Orthogonaliz ation Approach to Solving the Multicolinearity Problem of Empirical Data
by: O. V. Babak, et al.
Published: (2022)

The Relation of Duality and the Criterion of the Extremality of an Element for the Problem of Finding the Distance Between Two Convex Sets of Linear Normed Space
by: Гудима, Уляна Василівна, et al.
Published: (2018)

The Relation of Duality and the Criterion of the Extremality of an Element for the Problem of Finding the Distance Between Two Convex Sets of Linear Normed Space
by: U. V. Hudyma, et al.
Published: (2018)

Graph approach to solving problems of combinatorial recognition
by: H. P. Donets
Published: (2017)

Using the NEOS Server for Solving Two Classes of Optimization Problems
by: H. D. Bila, et al.
Published: (2022)

Solving the problem on the subcritical state of an edge crack within the cohesive zone model approach
by: M. F. Selivanov, et al.
Published: (2022)

On a combinatorial structure of the problems of optimal packing of geometric objects
by: S. V. Jakovlev
Published: (2017)

Models of Packing Seals Functioning Processes for Improving Sealing Mechanisms
by: S. S. Shevchenko
Published: (2020)