Global Optimization: On Pathlengths in Min-Max Graphs
✍ Scribed by HARALD GÜNZEL; HUBERTUS TH. Jongen
- Book ID
- 111565305
- Publisher
- Springer US
- Year
- 2000
- Tongue
- English
- Weight
- 8 KB
- Volume
- 17
- Category
- Article
- ISSN
- 0925-5001
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
The notion of the balance number introduced by Galperin through a certain set contraction procedure for nonscalarized multiobjective global optimization is represented via a min-max operation on the data of the problem. This representation yields a different computational procedure for the calculati
The resonance graph of a benzenoid graph G has the 1-factors of G as vertices, two 1-factors being adjacent if their symmetric difference forms the edge set of a hexagon of G. It is proved that the smallest number of elementary cuts that cover a catacondensed bensenoid graph equals the dimension of