Abdel Lisser

According to our database1, Abdel Lisser authored at least 88 papers between 2002 and 2020.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
A sparse chance constrained portfolio selection model with multiple constraints.
J. Glob. Optim., 2020

2019
Partial sample average approximation method for chance constrained problems.
Optim. Lett., 2019

A second-order cone programming formulation for two player zero-sum games with chance constraints.
Eur. J. Oper. Res., 2019

Notoriously hard (mixed-)binary QPs: empirical evidence on new completely positive approaches.
Comput. Manag. Sci., 2019

A Variable Neighborhood Search Algorithm for Massive MIMO Resource Allocation.
Proceedings of the Mobile Web and Intelligent Information Systems, 2019

2018
General sum games with joint chance constraints.
Oper. Res. Lett., 2018

A Characterization of Nash Equilibrium for the Games with Random Payoffs.
J. Optim. Theory Appl., 2018

Variational inequality formulation for the games with random payoffs.
J. Glob. Optim., 2018

Improved solution strategies for dominating trees.
Expert Syst. Appl., 2018

2017
Distributionally robust chance-constrained games: existence and characterization of Nash equilibrium.
Optim. Lett., 2017

A fresh CP look at mixed-binary QPs: new formulations and relaxations.
Math. Program., 2017

Minimum cost dominating tree sensor networks under probabilistic constraints.
Comput. Networks, 2017

On a Traveling Salesman based Bilevel Programming Problem.
Proceedings of the 6th International Conference on Operations Research and Enterprise Systems, 2017

2016
Uplink scheduling for joint wireless orthogonal frequency and time division multiple access networks.
J. Sched., 2016

Existence of Nash equilibrium for chance-constrained games.
Oper. Res. Lett., 2016

Stochastic geometric optimization with joint probabilistic constraints.
Oper. Res. Lett., 2016

Random-payoff two-person zero-sum game with joint chance constraints.
Eur. J. Oper. Res., 2016

A computational study for bilevel quadratic programs using semidefinite relaxations.
Eur. J. Oper. Res., 2016

Equivalent Nonlinear Complementarity Problem for Chance-constrained Games.
Electron. Notes Discret. Math., 2016

Stochastic geometric programming with joint probabilistic constraints.
Electron. Notes Discret. Math., 2016

Stochastic nonlinear resource allocation problem.
Electron. Notes Discret. Math., 2016

Models for minimum cost dominating trees.
Electron. Notes Discret. Math., 2016

Resource allocation in uplink wireless multi-cell OFDMA networks.
Comput. Stand. Interfaces, 2016

New reformulations of distributionally robust shortest path problem.
Comput. Oper. Res., 2016

Solving Chance-Constrained Games Using Complementarity Problems.
Proceedings of the Operations Research and Enterprise Systems, 2016

A Complementarity Problem Formulation for Chance-constraine Games.
Proceedings of 5th the International Conference on Operations Research and Enterprise Systems (ICORES 2016), 2016

A Two-stage Stochastic Programming Approach for the Traveling Salesman Problem.
Proceedings of 5th the International Conference on Operations Research and Enterprise Systems (ICORES 2016), 2016

2015
Jamming Attacks Reliable Prevention in a Clustered Wireless Sensor Network.
Wirel. Pers. Commun., 2015

Chance constrained 0-1 quadratic programs using copulas.
Optim. Lett., 2015

Stochastic maximum weight forest problem.
Networks, 2015

Maximum probability shortest path problem.
Discret. Appl. Math., 2015

Generating cutting planes for the semidefinite relaxation of quadratic programs.
Comput. Oper. Res., 2015

Piecewise Linear Formulations for Downlink Wireless OFDMA Networks.
Proceedings of the Mobile Web and Intelligent Information Systems, 2015

Stochastic Semidefinite Optimization Using Sampling Methods.
Proceedings of the Operations Research and Enterprise Systems, 2015

A Sampling Method to Chance-constrained Semidefinite Optimization.
Proceedings of the ICORES 2015, 2015

Distributionally Robust Optimization for Scheduling Problem in Call Centers with Uncertain Forecasts.
Proceedings of the Operations Research and Enterprise Systems, 2015

Scheduling Problem in Call Centers with Uncertain Arrival Rates Forecasts - A Distributionally Robust Approach.
Proceedings of the ICORES 2015, 2015

A Comparative Study of Network-based Approaches for Routing in Healthcare Wireless Body Area Networks.
Proceedings of the ICORES 2015, 2015

Stochastic bilevel network design problems.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

Bi-matrix Game with Random Payoffs.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

Probabilistic constrained dominating trees.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2014
Distributionally Robust Stochastic Knapsack Problem.
SIAM J. Optim., 2014

Stochastic and semidefinite optimization for scheduling in orthogonal frequency division multiple access networks.
J. Sched., 2014

An evaluation of semidefinite programming based approaches for discrete lot-sizing problems.
Eur. J. Oper. Res., 2014

Stochastic Resource Allocation for Uplink Wireless Multi-cell OFDMA Networks.
Proceedings of the Mobile Web Information Systems - 11th International Conference, 2014

The p-Median Problem with Concave Costs.
Proceedings of the ICORES 2014, 2014

Archimedean Copulas in Joint Chance-Constrained Programming.
Proceedings of the Operations Research and Enterprise Systems, 2014

On the Use of Copulas in Joint Chance-constrained Programming.
Proceedings of the ICORES 2014, 2014

Comparison of Stochastic Programming Approaches for Staffing and Scheduling Call Centers with Uncertain Demand Forecasts.
Proceedings of the Operations Research and Enterprise Systems, 2014

A Stochastic Programming Approach for Staffing and Scheduling Call Centers with Uncertain Demand Forecasts.
Proceedings of the ICORES 2014, 2014

A Multicommodity Formulation for Routing in Healthcare Wireless Body Area Networks.
Proceedings of the ICORES 2014, 2014

A chance constrained approach for uplink wireless OFDMA networks.
Proceedings of the 9th International Symposium on Communication Systems, 2014

2013
A completely positive representation of 0-1 linear programs with joint probabilistic constraints.
Oper. Res. Lett., 2013

Distributionally robust stochastic shortest path problem.
Electron. Notes Discret. Math., 2013

A polynomial formulation for the stochastic maximum weight forest problem.
Electron. Notes Discret. Math., 2013

A Distributionally Robust Formulation for Stochastic Quadratic Bi-level Programming.
Proceedings of the ICORES 2013, 2013

2012
A second-order cone programming approach for linear programs with joint probabilistic constraints.
Oper. Res. Lett., 2012

On a stochastic bilevel programming problem.
Networks, 2012

A quadratic semidefinite relaxation approach for resource allocation in orthogonal frequency division multiple access.
Networks, 2012

Stochastic nuclear outages semidefinite relaxations.
Comput. Manag. Sci., 2012

Multi-service multi-facility network design under uncertainty.
Ann. Oper. Res., 2012

Semidefinite Relaxations for Mixed 0-1 Second-Order Cone Program.
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

A Second-Order Cone Programming Approximation to Joint Chance-Constrained Linear Programs.
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

Semidefinite Relaxations for the Scheduling Nuclear Outages Problem.
Proceedings of the ICORES 2012, 2012

Stochastic Shortest Path Problem with Uncertain Delays.
Proceedings of the ICORES 2012, 2012

Maximum Probability Problem in Stochastic Programming.
Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

A Semidefinite Relaxation Approach for Stochastic Bilevel Programming.
Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

2011
Knapsack problem with probability constraints.
J. Glob. Optim., 2011

A Two Stage Stochastic Semidefinite Relaxation for wireless OFDMA Networks.
Electron. Notes Discret. Math., 2011

On two-stage stochastic knapsack problems.
Discret. Appl. Math., 2011

Robust semidefinite relaxations for a quadratic OFDMA resource allocation scheme.
Comput. Oper. Res., 2011

Tight lower bounds by semidefinite relaxations for the discrete lot-sizing and scheduling problem with sequence-dependent changeover costs.
Proceedings of the Operations Research Proceedings 2011, Selected Papers of the International Conference on Operations Research (OR 2011), August 30, 2011

Computing Upper Bounds for a LBPP with and without Probabilistic Constraints.
Proceedings of the Network Optimization - 5th International Conference, 2011

2010
Application of semi definite relaxation and variable neighborhood search for multiuser detection in synchronous CDMA.
Networks, 2010

Stochastic Quadratic Knapsack with Recourse.
Electron. Notes Discret. Math., 2010

Stochastic Shortest Path Problem with Delay Excess Penalty.
Electron. Notes Discret. Math., 2010

Semidefinite and Conic Programming for Robust wireless OFDMA networks.
Electron. Notes Discret. Math., 2010

Upper bounds for the 0-1 stochastic knapsack problem and a B&B algorithm.
Ann. Oper. Res., 2010

On a Stochastic Knapsack Problem.
Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2010

Semidenite Programming for Stochastic Wireless OFDMA Networks.
Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2010

2009
Nonoriented Multicommodity Flow Problems.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

On a Two-Stage Stochastic Knapsack Problem with Probabilistic Constraint.
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2006
Enhancing a Branch-and-Bound Algorithm for Two-Stage Stochastic Integer Network Design-Based Models.
Manag. Sci., 2006

Multicommodity Flow Problems and Decomposition in Telecommunications Networks.
Proceedings of the Handbook of Optimization in Telecommunications, 2006

2005
B&B Frameworks for the Capacity Expansion of High Speed Telecommunication Networks Under Uncertainty.
Ann. Oper. Res., 2005

2004
Telecommunication Network Capacity Design for Uncertain Demand.
Comput. Optim. Appl., 2004

2003
Graph partitioning using linear and semidefinite programming.
Math. Program., 2003

2002
Simplex and Interior Point Specialized Algorithms for Solving Nonoriented Multicommodity Flow Problems.
Oper. Res., 2002


  Loading...