Submodularity is a well-known notion in combinatorial optimization. Some of its properties and applications where systematically analyzed for the first time by Edmonds in connection with the theory of matroids. After Edmonds'work, many other authors have contributed to the development of submodularity theory and its applications to combinatorial optimization. Good surveys on this topic may be found in [8,9) and a collection of papers on submodular optimization has recently appeared in [2].
On submodularity in continuous optimization
1990
Abstract
Submodularity is a well-known notion in combinatorial optimization. Some of its properties and applications where systematically analyzed for the first time by Edmonds in connection with the theory of matroids. After Edmonds'work, many other authors have contributed to the development of submodularity theory and its applications to combinatorial optimization. Good surveys on this topic may be found in [8,9) and a collection of papers on submodular optimization has recently appeared in [2].File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_453291-doc_171837.pdf
accesso aperto
Descrizione: On submodularity in continuous optimization
Dimensione
2.15 MB
Formato
Adobe PDF
|
2.15 MB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
