default search action
Adam Ouorou
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j30]Adrien Cambier
, Matthieu Chardy, Rosa Figueiredo, Adam Ouorou, Michael Poss:
Optimizing subscriber migrations for a telecommunication operator in uncertain context. Eur. J. Oper. Res. 298(1): 308-321 (2022) - 2021
- [j29]Adrien Cambier
Optimizing the investments in mobile networks and subscriber migrations for a telecommunication operator. Networks 77(4): 495-519 (2021) - [c6]Pierre Nodet, Vincent Lemaire, Alexis Bondu, Antoine Cornuéjols, Adam Ouorou:
Importance Reweighting for Biquality Learning. IJCNN 2021: 1-8 - [c5]Pierre Nodet, Vincent Lemaire, Alexis Bondu, Antoine Cornuéjols, Adam Ouorou:
From Weakly Supervised Learning to Biquality Learning: an Introduction. IJCNN 2021: 1-10 - 2020
- [j28]Adam Ouorou:
Fast proximal algorithms for nonsmooth convex optimization. Oper. Res. Lett. 48(6): 777-783 (2020) - [i1]Pierre Nodet, Vincent Lemaire, Alexis Bondu, Antoine Cornuéjols, Adam Ouorou:
From Weakly Supervised Learning to Biquality Learning, a brief introduction. CoRR abs/2012.09632 (2020)
2010 – 2019
- 2019
- [j27]Guanglei Wang, Walid Ben-Ameur, Adam Ouorou:
A Lagrange decomposition based branch and bound algorithm for the optimal mapping of cloud virtual machines. Eur. J. Oper. Res. 276(1): 28-39 (2019) - [c4]André Dembélé, Babacar Mbaye Ndiaye, Adam Ouorou, Guy Degla:
A Triple Stabilized Bundle Method for Constrained Nonconvex Nonsmooth Optimization. ICCSAMA 2019: 75-87 - 2018
- [j26]Walid Ben-Ameur, Adam Ouorou, Guanglei Wang, Mateusz Zotkiewicz:
Multipolar robust optimization. EURO J. Comput. Optim. 6(4): 395-434 (2018) - 2017
- [j25]Walid Ben-Ameur, Adam Ouorou, Guanglei Wang:
Convex and concave envelopes: Revisited and new perspectives. Oper. Res. Lett. 45(5): 421-426 (2017) - 2016
- [j24]Guanglei Wang, Walid Ben-Ameur, José Neto, Adam Ouorou:
Optimal Mapping of Cloud Virtual Machines. Electron. Notes Discret. Math. 52: 93-100 (2016) - [j23]Adam Ouorou:
Robust models for linear programming with uncertain right hand side. Networks 68(3): 200-211 (2016) - 2014
- [j22]Hassan L. Hijazi
An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs. INFORMS J. Comput. 26(1): 31-44 (2014) - 2013
- [j21]Hassan L. Hijazi
Robust delay-constrained routing in telecommunications. Ann. Oper. Res. 206(1): 163-181 (2013) - [j20]Adam Ouorou:
Tractable approximations to a robust capacity assignment model in telecommunications under demand uncertainty. Comput. Oper. Res. 40(1): 318-327 (2013) - [j19]Adam Ouorou:
The proximal Chebychev center cutting plane algorithm for convex additive functions. Math. Program. 140(1): 163-187 (2013) - [j18]Walid Ben-Ameur, Makhlouf Hadji, Adam Ouorou:
Minimum-weight subgraphs with unicyclic components and a lower-bounded girth. Networks 61(4): 335-355 (2013) - [j17]Frédéric Babonneau
Robust capacity assignment solutions for telecommunications networks with uncertain demands. Networks 62(4): 255-272 (2013) - [c3]Mayssa Youssef, Ruby Krishnaswamy, Adam Ouorou:
Green virtual desktop: Design and operation. ICCIT 2013: 115-120 - 2012
- [j16]Hassan L. Hijazi
Mixed-integer nonlinear programs featuring "on/off" constraints. Comput. Optim. Appl. 52(2): 537-558 (2012) - 2011
- [c2]Adam Ouorou:
Affine Decision Rules for Tractable Approximations to Robust Capacity Planning in Telecommunications. INOC 2011: 277-282 - 2010
- [j15]Lucile Denoeud-Belgacem, Éric Gourdin, Ruby Krishnaswamy, Adam Ouorou:
Combinatorial auctions for exchanging resources over a grid network. Ann. des Télécommunications 65(11-12): 689-704 (2010) - [j14]Walid Ben-Ameur, Makhlouf Hadji, Adam Ouorou:
Networks with unicyclic connected components and without short cycles. Electron. Notes Discret. Math. 36: 961-968 (2010) - [j13]Hassan L. Hijazi
Mixed Integer NonLinear Programs featuring "On/Off" constraints: convex analysis and applications. Electron. Notes Discret. Math. 36: 1153-1160 (2010) - [j12]Claude Lemaréchal, Adam Ouorou, Georgios Petrou:
Robust network design in telecommunications under polytope demand uncertainty. Eur. J. Oper. Res. 206(3): 634-641 (2010) - [p1]Melanie Moßmann, Jochen Stößer, Adam Ouorou, Éric Gourdin, Ruby Krishnaswamy, Dirk Neumann:
A Combinatorial Exchange for Complex Grid Services. Economic Models and Algorithms for Distributed Systems 2010: 221-237
2000 – 2009
- 2009
- [j11]Claude Lemaréchal, Adam Ouorou, Georgios Petrou:
A bundle-type algorithm for routing in telecommunication data networks. Comput. Optim. Appl. 44(3): 385-409 (2009) - [j10]Adam Ouorou:
A proximal cutting plane method using Chebychev center for nonsmooth convex optimization. Math. Program. 119(2): 239-271 (2009) - 2007
- [j9]Adam Ouorou:
Implementing a proximal algorithm for some nonlinear multicommodity flow problems. Networks 49(1): 18-27 (2007) - [j8]Adam Ouorou:
A proximal subgradient projection algorithm for linearly constrained strictly convex problems. Optim. Methods Softw. 22(4): 617-636 (2007) - [j7]Georgios Petrou, Claude Lemaréchal, Adam Ouorou:
An approach to robust network design in telecommunications. RAIRO Oper. Res. 41(4): 411-426 (2007) - [c1]Adam Ouorou, Jean-Philippe Vial:
A model for robust capacity planning for telecommunications networks under demand uncertainty. DRCN 2007: 1-4 - 2006
- [j6]Walid Ben-Ameur, Adam Ouorou:
Mathematical Models of the Delay Constrained Routing Problem. Algorithmic Oper. Res. 1(2) (2006) - [j5]Adam Ouorou:
Robust Capacity Assignment in Telecommunications. Comput. Manag. Sci. 3(4): 285-305 (2006) - 2004
- [j4]Adam Ouorou:
Epsilon-proximal decomposition method. Math. Program. 99(1): 89-108 (2004) - 2000
- [j3]Adam Ouorou:
A Primal-Dual Algorithm for Monotropic Programming and its Application to Network Optimization. Comput. Optim. Appl. 15(2): 125-143 (2000) - [j2]Adam Ouorou, Philippe Mahey:
A minimum mean cycle cancelling method for nonlinear multicommodity flow problems. Eur. J. Oper. Res. 121(3): 532-548 (2000)
1990 – 1999
- 1998
- [j1]Philippe Mahey, Adam Ouorou, Larry J. LeBlanc, Jerome Chifflet:
A new proximal decomposition algorithm for routing in telecommunication networks. Networks 31(4): 227-238 (1998)
Coauthor Index
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-30 20:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: