Search Results - subject:"computational geometry"

Cutting ellipses from area-minimizing rectangles

Kallrath, Josef; Rebennack, Steffen - In: Journal of Global Optimization 59 (2014) 2, pp. 405-437

A set of ellipses, with given semi-major and semi-minor axes, is to be cut from a rectangular design plate, while minimizing the area of the design rectangle. The design plate is subject to lower and upper bounds of its widths and lengths; the ellipses are free of any orientation restrictions....

Persistent link: https://www.econbiz.de/10010994186

An integer-programming-based approach to the close-enough traveling salesman problem

Behdani, Behnam; Smith, J. Cole - In: INFORMS journal on computing : JOC 26 (2014) 3, pp. 415-432

Persistent link: https://www.econbiz.de/10010399822

Optimizing the layout of proportional symbol maps : polyhedra and computation

Kunigami, Guilherme; Rezende, Pedro J. de; Souza, Cid … - In: INFORMS journal on computing : JOC 26 (2014) 2, pp. 199-207

Persistent link: https://www.econbiz.de/10010362448

Smart Business Networks Design and Business Genetics

Pau, Louis-Francois - Erasmus Research Institute of Management (ERIM), … - 2006

functions can be done. Most discussions only rely solely on human judgment. This paper introduces both computational geometry …

Persistent link: https://www.econbiz.de/10010731014

Smart Business Networks Design and Business Genetics

Pau, L-F. - Erasmus Research Institute of Management (ERIM), ERIM … - 2006

functions can be done. Most discussions only rely solely on human judgment. This paper introduces both computational geometry …. This paper introduces both computational geometry, and genetic programming, as systematic methods whereby to display … Networks, Design of Smart business Network , Genetics, Cellular Automata, Emergence Theory, Computational Geometry, Voronoï …

Persistent link: https://www.econbiz.de/10005288414

New variations of the maximum coverage facility location problem

Bhattacharya, Bhaswar B.; Nandy, Subhas C. - In: European Journal of Operational Research 224 (2013) 3, pp. 477-485

Consider a competitive facility location scenario where, given a set U of n users and a set F of m facilities in the plane, the objective is to place a new facility in an appropriate place such that the number of users served by the new facility is maximized. Here users and facilities are...

Persistent link: https://www.econbiz.de/10011052571

From approximate balls to approximate ellipses

Mukhopadhyay, Asish; Greene, Eugene; Sarker, Animesh; … - In: Journal of Global Optimization 56 (2013) 1, pp. 27-42

th Canadian conference on computational geometry (CCCG’06), pp 139–142, <CitationRef CitationID="CR13">2006</CitationRef …

Persistent link: https://www.econbiz.de/10010994157

A PTAS for the disk cover problem of geometric objects

Rezende, Pedro J. de; Miyazawa, Flávio K.; Sasaki, … - In: Operations research letters 41 (2013) 5, pp. 552-555

Persistent link: https://www.econbiz.de/10010191951

Largest area convex hull of imprecise data based on axis-aligned squares

Ju, Wenqi; Luo, Jun; Zhu, Binhai; Daescu, Ovidiu - In: Journal of combinatorial optimization 26 (2013) 4, pp. 832-859

Persistent link: https://www.econbiz.de/10010205249

Optimal strategies for the one-round discrete Voronoi game on a line

Banik, Aritra; Bhattacharya, Bhaswar B.; Das, Sandip - In: Journal of combinatorial optimization 26 (2013) 4, pp. 655-669

Persistent link: https://www.econbiz.de/10010205282