### Abstract

Language | English |
---|---|

Title of host publication | Proceedings of the Computational Science and its Applications - ICCSA 2014, Part II |

Place of Publication | Cham |

Pages | 115-125 |

DOIs | |

Publication status | Published - 2014 |

Event | 14th ICCSA 2014, Guimarães, Portugal - Duration: 30 Jun 2014 → 3 Jul 2014 |

### Publication series

Name | Lecture Notes in Computer Science |
---|---|

Publisher | Springer |

Volume | 8580 |

ISSN (Print) | 0302-9743 |

### Conference

Conference | 14th ICCSA 2014, Guimarães, Portugal |
---|---|

Period | 30/06/14 → 3/07/14 |

### Fingerprint

### Cite this

*Proceedings of the Computational Science and its Applications - ICCSA 2014, Part II*(pp. 115-125). (Lecture Notes in Computer Science; Vol. 8580). Cham. https://doi.org/10.1007/978-3-319-09129-7_9

}

*Proceedings of the Computational Science and its Applications - ICCSA 2014, Part II.*Lecture Notes in Computer Science, vol. 8580, Cham, pp. 115-125, 14th ICCSA 2014, Guimarães, Portugal, 30/06/14. https://doi.org/10.1007/978-3-319-09129-7_9

**Heuristics to Reduce the Number of Simplices in Longest Edge Bisection Refinement of a Regular n-Simplex.** / Aparicio, G.; Casado, L.G.; Tóth, B.G.; Hendrix, E.M.T.; García, I.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Heuristics to Reduce the Number of Simplices in Longest Edge Bisection Refinement of a Regular n-Simplex

AU - Aparicio, G.

AU - Casado, L.G.

AU - Tóth, B.G.

AU - Hendrix, E.M.T.

AU - García, I.

PY - 2014

Y1 - 2014

N2 - In several areas like Global Optimization using branch-and-bound methods, the unit n-simplex is refined by bisecting the longest edge such that a binary search tree appears. The refinement usually selects the first longest edge and ends when the size of the sub-simplices generated in the refinement is smaller than a given accuracy. Irregular sub-simplices may have more than one longest edge only for n¿=¿3. The question is how to choose the longest edge to be bisected such that the number of sub-simplices in the generated binary tree is minimal. The difficulty of this Combinatorial Optimization problem increases with n. Therefore, heuristics are studied that aim to minimize the number of generated simplices

AB - In several areas like Global Optimization using branch-and-bound methods, the unit n-simplex is refined by bisecting the longest edge such that a binary search tree appears. The refinement usually selects the first longest edge and ends when the size of the sub-simplices generated in the refinement is smaller than a given accuracy. Irregular sub-simplices may have more than one longest edge only for n¿=¿3. The question is how to choose the longest edge to be bisected such that the number of sub-simplices in the generated binary tree is minimal. The difficulty of this Combinatorial Optimization problem increases with n. Therefore, heuristics are studied that aim to minimize the number of generated simplices

U2 - 10.1007/978-3-319-09129-7_9

DO - 10.1007/978-3-319-09129-7_9

M3 - Conference contribution

SN - 9783319091280

T3 - Lecture Notes in Computer Science

SP - 115

EP - 125

BT - Proceedings of the Computational Science and its Applications - ICCSA 2014, Part II

CY - Cham

ER -