Mathematical model and method of searching for a local extremum for the non-convex oriented polygons allocation problem

Author： Stoyan Y.G.   Novozhilova M.V.   Kartashov A.V.  

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.92, Iss.1, 1996-07, pp. : 193-210

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A Computational Method for the Solution of Optimizing Facility Location Problem in the Non-Convex Set

By  

Advanced Materials Research, Vol. 2014, Iss. 1073, 2015-01 ,pp. : 1376-1379

Trans Tech Publications

Access to resources Recommend Favorite

A method of optimal lattice packing of congruent oriented polygons in the plane

By Stoyan Y.G.   Patsuk V.N.  

European Journal of Operational Research, Vol. 124, Iss. 1, 2000-07 ,pp. : 204-216

Elsevier

Access to resources Recommend Favorite

Approximation methods for non-convex curves

By Liu Y.   Teo K.L.   Yang X.Q.  

European Journal of Operational Research, Vol. 117, Iss. 1, 1999-08 ,pp. : 125-135

Elsevier

Access to resources Recommend Favorite

Algorithms for the decomposition of a polygon into convex polygons

By Fernandez J.   Canovas L.   Pelegrn B.  

European Journal of Operational Research, Vol. 121, Iss. 2, 2000-03 ,pp. : 330-342

Elsevier

Access to resources Recommend Favorite

A tractable approximation of non-convex chance constrained optimization with non-Gaussian uncertainties

By  

Engineering Optimization, Vol. 47, Iss. 4, 2015-04 ,pp. : 495-520

Taylor & Francis Ltd

Access to resources Recommend Favorite