Adam Ouorou

According to our database1, Adam Ouorou authored at least 38 papers between 1998 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Optimizing subscriber migrations for a telecommunication operator in uncertain context.
Eur. J. Oper. Res., 2022

2021
Optimizing the investments in mobile networks and subscriber migrations for a telecommunication operator.
Networks, 2021

From Weakly Supervised Learning to Biquality Learning: an Introduction.
Proceedings of the International Joint Conference on Neural Networks, 2021

Importance Reweighting for Biquality Learning.
Proceedings of the International Joint Conference on Neural Networks, 2021

2020
Fast proximal algorithms for nonsmooth convex optimization.
Oper. Res. Lett., 2020

From Weakly Supervised Learning to Biquality Learning, a brief introduction.
CoRR, 2020

2019
A Lagrange decomposition based branch and bound algorithm for the optimal mapping of cloud virtual machines.
Eur. J. Oper. Res., 2019

A Triple Stabilized Bundle Method for Constrained Nonconvex Nonsmooth Optimization.
Proceedings of the Advanced Computational Methods for Knowledge Engineering, 2019

2018
Multipolar robust optimization.
EURO J. Comput. Optim., 2018

2017
Convex and concave envelopes: Revisited and new perspectives.
Oper. Res. Lett., 2017

2016
Robust models for linear programming with uncertain right hand side.
Networks, 2016

Optimal Mapping of Cloud Virtual Machines.
Electron. Notes Discret. Math., 2016

2014
An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs.
INFORMS J. Comput., 2014

2013
Minimum-weight subgraphs with unicyclic components and a lower-bounded girth.
Networks, 2013

Robust capacity assignment solutions for telecommunications networks with uncertain demands.
Networks, 2013

The proximal Chebychev center cutting plane algorithm for convex additive functions.
Math. Program., 2013

Tractable approximations to a robust capacity assignment model in telecommunications under demand uncertainty.
Comput. Oper. Res., 2013

Robust delay-constrained routing in telecommunications.
Ann. Oper. Res., 2013

Green virtual desktop: Design and operation.
Proceedings of the Third International Conference on Communications and Information Technology, 2013

2012
Mixed-integer nonlinear programs featuring "on/off" constraints.
Comput. Optim. Appl., 2012

2011
Affine Decision Rules for Tractable Approximations to Robust Capacity Planning in Telecommunications.
Proceedings of the Network Optimization - 5th International Conference, 2011

2010
Robust network design in telecommunications under polytope demand uncertainty.
Eur. J. Oper. Res., 2010

Mixed Integer NonLinear Programs featuring "On/Off" constraints: convex analysis and applications.
Electron. Notes Discret. Math., 2010

Networks with unicyclic connected components and without short cycles.
Electron. Notes Discret. Math., 2010

Combinatorial auctions for exchanging resources over a grid network.
Ann. des Télécommunications, 2010

A Combinatorial Exchange for Complex Grid Services.
Proceedings of the Economic Models and Algorithms for Distributed Systems, 2010

2009
A proximal cutting plane method using Chebychev center for nonsmooth convex optimization.
Math. Program., 2009

A bundle-type algorithm for routing in telecommunication data networks.
Comput. Optim. Appl., 2009

2007
An approach to robust network design in telecommunications.
RAIRO Oper. Res., 2007

A proximal subgradient projection algorithm for linearly constrained strictly convex problems.
Optim. Methods Softw., 2007

Implementing a proximal algorithm for some nonlinear multicommodity flow problems.
Networks, 2007

A model for robust capacity planning for telecommunications networks under demand uncertainty.
Proceedings of the 6th International Workshop on Design and Reliable Communication Networks, 2007

2006
Robust Capacity Assignment in Telecommunications.
Comput. Manag. Sci., 2006

Mathematical Models of the Delay Constrained Routing Problem.
Algorithmic Oper. Res., 2006

2004
Epsilon-proximal decomposition method.
Math. Program., 2004

2000
A minimum mean cycle cancelling method for nonlinear multicommodity flow problems.
Eur. J. Oper. Res., 2000

A Primal-Dual Algorithm for Monotropic Programming and its Application to Network Optimization.
Comput. Optim. Appl., 2000

1998
A new proximal decomposition algorithm for routing in telecommunication networks.
Networks, 1998


  Loading...