Michael M. Zavlanos

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Darinka Dentcheva

> Home > Persons > Michael M. Zavlanos

Publications

2019
[j32]
- view
  authority control:
- export record
  dblp key:
  - journals/tcns/MaOLDZ19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcns/MaOLDZ19
Wann-Jiun Ma, Chanwook Oh, Yang Liu, Darinka Dentcheva, Michael M. Zavlanos:
Risk-Averse Access Point Selection in Wireless Communication Networks. IEEE Trans. Control. Netw. Syst. 6(1): 24-36 (2019)
2017
[c51]
- view
  authority control:
- export record
  dblp key:
  - conf/amcc/MaDZ17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/amcc/MaDZ17
Wann-Jiun Ma, Darinka Dentcheva, Michael M. Zavlanos:
Risk-averse sensor planning using distributed policy gradient. ACC 2017: 4839-4844
2015
[j12]
- view
  authority control:
- export record
  dblp key:
  - journals/mp/Chatzipanagiotis15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mp/Chatzipanagiotis15
Nikolaos Chatzipanagiotis, Darinka Dentcheva, Michael M. Zavlanos:
An augmented Lagrangian method for distributed optimization. Math. Program. 152(1-2): 405-434 (2015)
2012
[c24]
- view
  authority control:
- export record
  dblp key:
  - conf/cdc/ChatzipanagiotisDZ12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cdc/ChatzipanagiotisDZ12
Nikolaos Chatzipanagiotis, Darinka Dentcheva, Michael M. Zavlanos:
Approximate augmented lagrangians for distributed network optimization. CDC 2012: 5840-5845

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.