Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms (Q5925738)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms |
scientific article; zbMATH DE number 1566524
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms |
scientific article; zbMATH DE number 1566524 |
Statements
Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms (English)
0 references
19 February 2001
0 references
diagonal algorithms
0 references
partitioning
0 references
minimal description
0 references
global optimization
0 references
0 references
0 references
0 references
0 references
0 references
0 references
