Global Optimization Simplex Bisection Revisited Based on Considerations by Reiner Horst

Paula Alexandra da Costa Amaral

doi:10.1007/978-3-642-31137-6_12

Global Optimization Simplex Bisection Revisited Based on Considerations by Reiner Horst

Paula Alexandra da Costa Amaral

DM - Departamento de Matemática

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

6 Citations (Scopus)

Abstract

In this paper, the use of non-optimality spheres in a simplicial branch and bound (B&B) algorithm is investigated. In this context, some considerations regarding the use of bisection on the longest edge in relation with ideas of Reiner Horst are reminded. Three arguments highlight the merits of bisection of simplicial subsets in B&B schemes.

Original language	Unknown
Title of host publication	Lecture Notes in Computer Science
Pages	159-173
Volume	7335
DOIs	https://doi.org/10.1007/978-3-642-31137-6_12
Publication status	Published - 1 Jan 2012
Event	12th International Conference on Computational Science and Its Applications (ICCSA) - Duration: 1 Jan 2012 → …

Conference

Conference	12th International Conference on Computational Science and Its Applications (ICCSA)
Period	1/01/12 → …

Access to Document

10.1007/978-3-642-31137-6_12

Cite this

@inproceedings{d1eff499ce6a416ab53de8269dd9965a,

title = "Global Optimization Simplex Bisection Revisited Based on Considerations by Reiner Horst",

abstract = "In this paper, the use of non-optimality spheres in a simplicial branch and bound (B&B) algorithm is investigated. In this context, some considerations regarding the use of bisection on the longest edge in relation with ideas of Reiner Horst are reminded. Three arguments highlight the merits of bisection of simplicial subsets in B&B schemes.",

author = "Amaral, {Paula Alexandra da Costa}",

year = "2012",

month = jan,

day = "1",

doi = "10.1007/978-3-642-31137-6_12",

language = "Unknown",

isbn = "978-3-642-31136-9",

volume = "7335",

pages = "159--173",

booktitle = "Lecture Notes in Computer Science",

note = "12th International Conference on Computational Science and Its Applications (ICCSA) ; Conference date: 01-01-2012",

}

TY - GEN

T1 - Global Optimization Simplex Bisection Revisited Based on Considerations by Reiner Horst

AU - Amaral, Paula Alexandra da Costa

PY - 2012/1/1

Y1 - 2012/1/1

N2 - In this paper, the use of non-optimality spheres in a simplicial branch and bound (B&B) algorithm is investigated. In this context, some considerations regarding the use of bisection on the longest edge in relation with ideas of Reiner Horst are reminded. Three arguments highlight the merits of bisection of simplicial subsets in B&B schemes.

AB - In this paper, the use of non-optimality spheres in a simplicial branch and bound (B&B) algorithm is investigated. In this context, some considerations regarding the use of bisection on the longest edge in relation with ideas of Reiner Horst are reminded. Three arguments highlight the merits of bisection of simplicial subsets in B&B schemes.

U2 - 10.1007/978-3-642-31137-6_12

DO - 10.1007/978-3-642-31137-6_12

M3 - Conference contribution

SN - 978-3-642-31136-9

VL - 7335

SP - 159

EP - 173

BT - Lecture Notes in Computer Science

T2 - 12th International Conference on Computational Science and Its Applications (ICCSA)

Y2 - 1 January 2012

ER -