Ioannis G. Kevrekidis

◀ ▶ joint publications with Chrysanthos E. Gounaris

> Home > Persons > Ioannis G. Kevrekidis

Publications

2019
[j69]
- view
  authority control:
- export record
  dblp key:
  - journals/eor/MatthewsGK19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eor/MatthewsGK19
Logan R. Matthews, Chrysanthos E. Gounaris, Ioannis G. Kevrekidis:
Designing networks with resiliency to edge failures using two-stage robust optimization. Eur. J. Oper. Res. 279(3): 704-720 (2019)
2016
[j56]
- view
  authority control:
- export record
  dblp key:
  - journals/networks/GounarisRKF16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/networks/GounarisRKF16
Chrysanthos E. Gounaris, Karthikeyan Rajendran, Ioannis G. Kevrekidis, Christodoulos A. Floudas:
Designing networks: A mixed-integer linear optimization approach. Networks 68(4): 283-301 (2016)
2015
[i3]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/GounarisRKF15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/GounarisRKF15
Chrysanthos E. Gounaris, Karthikeyan Rajendran, Ioannis G. Kevrekidis, Christodoulos A. Floudas:
Designing Networks: A Mixed-Integer Linear Optimization Approach. CoRR abs/1502.00362 (2015)
2011
[j42]
- view
  authority control:
- export record
  dblp key:
  - journals/ol/GounarisRKF11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ol/GounarisRKF11
Chrysanthos E. Gounaris, Karthikeyan Rajendran, Ioannis G. Kevrekidis, Christodoulos A. Floudas:
Generation of networks with prescribed degree-dependent clustering. Optim. Lett. 5(3): 435-451 (2011)

a service of

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.