Abdel Lisser
Abdel Lisser
Université Paris Saclay - CentraleSupelec
Adresse e-mail validée de l2s.centralesupelec.fr - Page d'accueil
Citée par
Citée par
Graph partitioning using linear and semidefinite programming
A Lisser, F Rendl
Mathematical Programming 95 (1), 91-101, 2003
A second-order cone programming approach for linear programs with joint probabilistic constraints
J Cheng, A Lisser
Operations Research Letters 40 (5), 325-328, 2012
Distributionally robust stochastic knapsack problem
J Cheng, E Delage, A Lisser
SIAM Journal on Optimization 24 (3), 1485-1506, 2014
Upper bounds for the 0-1 stochastic knapsack problem and a B&B algorithm
S Kosuch, A Lisser
Annals of Operations Research 176 (1), 77-93, 2010
Simplex and interior point specialized algorithms for solving nonoriented multicommodity flow problems
P Chardaire, A Lisser
Operations Research 50 (2), 260-276, 2002
Knapsack problem with probability constraints
AA Gaivoronski, A Lisser, R Lopez, H Xu
Journal of Global Optimization 49 (3), 397-413, 2011
Capacity planning under uncertain demand in telecommunications networks
A Lisser, A Ouorou, JP Vial, J Gondzio
Integer linear models with a polynomial number of variables and constraints for some classical combinatorial optimization problems
N Maculan, G Plateau, A Lisser
Pesquisa Operacional 23 (1), 161-168, 2003
On two-stage stochastic knapsack problems
S Kosuch, A Lisser
Discrete Applied Mathematics 159 (16), 1827-1841, 2011
Telecommunication network capacity design for uncertain demand
R Andrade, A Lisser, N Maculan, G Plateau
Computational Optimization and Applications 29 (2), 127-146, 2004
On a stochastic bilevel programming problem
S Kosuch, P Le Bodic, J Leung, A Lisser
Networks 59 (1), 107-116, 2012
Existence of Nash equilibrium for chance-constrained games
VV Singh, O Jouini, A Lisser
Operations Research Letters 44 (5), 640-644, 2016
Optimal joint synthesis of base and reserve telecommunication networks
A Lisser, R Sarkissian, JP Vial
CNET Technical Note NT jPAAj ATRjORlj 4491, 1995
Survivability in telecommunication networks
A Lisser, R Sarkissian, JP Vial
HEC Univ. de Genève, 1995
B&B frameworks for the capacity expansion of high speed telecommunication networks under uncertainty
R Andrade, A Lisser, N Maculan, G Plateau
Annals of Operations Research 140 (1), 49-65, 2005
Distributionally robust stochastic shortest path problem
J Cheng, A Lisser, M Letournel
Electronic Notes in Discrete Mathematics 41, 511-518, 2013
Stochastic nuclear outages semidefinite relaxations
A Gorge, A Lisser, R Zorgati
Computational Management Science 9 (3), 363-379, 2012
Survivability in transmission telecommunication networks
A Lisser, R Sarkissian, J Vial
Note Technique, CNET, Paris, France 26, 1995
Distributionally robust chance-constrained games: existence and characterization of Nash equilibrium
VV Singh, O Jouini, A Lisser
Optimization Letters 11 (7), 1385-1405, 2017
Stochastic shortest path problem with delay excess penalty
S Kosuch, A Lisser
Electronic Notes in Discrete Mathematics 36, 511-518, 2010
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20