Many algorithms for quadratic 0-1 programming find a global solution by searching some or all the local solutions of the problem. In this paper we present some necessary and/or sufficient conditions for global optimality of local optima in quadratic 0-1 programming.
On global optimality of local optima in quadratic 0-1 programming
1990
Abstract
Many algorithms for quadratic 0-1 programming find a global solution by searching some or all the local solutions of the problem. In this paper we present some necessary and/or sufficient conditions for global optimality of local optima in quadratic 0-1 programming.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_453289-doc_171835.pdf
accesso aperto
Descrizione: On global optimality of local optima in quadratic 0-1 programming
Dimensione
611.61 kB
Formato
Adobe PDF
|
611.61 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
