Theses
|
2010
|
Stochastic Optimization Problems with Knapsack Constraint Thesis presented to obtain the doctoral degree in science of the Université Paris XI, Orsay (France) - Specialty: Computer Science
|
Papers published in scientific journals
|
2013
|
S. K.:
Approximability of the Two-Stage Stochastic Knapsack problem with discretely distributed weights. [preprint]
Discrete Applied Mathematics 165: 192-204
|
2012
|
S. K., Pierre Le Bodic, Janny Leung, Abdel Lisser:
On a Stochastic Bilevel Programming Problem with Knapsack constraints. [preprint]
Networks 59 (1): 107-116
|
2011
|
S. K., Abdel Lisser:
On two-stage stochastic knapsack problems. [preprint]
Discrete Applied Mathematics 159 (16): 1827-1841
|
2010
|
S. K., Abdel Lisser:
Upper bounds for the 0-1 stochastic knapsack problem and a B&B algorithm.
Annals of Operations Research 176 (1): 77-93 [Link to a more recent version by S. Kosuch, with a little bit more insight information and some important corrections made]
|
2009
|
Henning Bruhn, S. K., Melanie Win Myint:
Bicycles and left-right tours in locally finite graphs. [preprint]
European Journal of Combinatorics 30(2): 356-371
|
Published extended abstracts
|
2009
|
S. K., Abdel Lisser:
Stochastic Shortest Path Problem with Delay Excess Penalty. [preprint]
Electronic Notes in Discrete Mathematics 36(1): 511-518
Proceedings of the International Symposium on Combinatorial Optimization (ISCO 2010)
|
Talks at and contributions to International Conferences and Workshops
|
2012
|
Bogdan Tanasa, Unmesh Bordoloi, S. K., Petru Eles, Zebo Peng:
Schedulability Analysis for the Dynamic Segment of FlexRay: A Generalization to Slot Multiplexing. [extended abstact (pre-review)]
18th IEEE Real-Time and Embedded Technology and Applications Symposium (Beijing, China)
|
|
Jianqiang Cheng, S. K., Abdel Lisser:
Stochastic Shortest Path Problem with Uncertain Delays. [extended abstact]
1st International Conference on Operations Research and Enterprise Systems (Algave, Portugal)
***This contribution won the "Best student paper award" of the ICORES 2012 conference.***
|
2011
|
S. K.:
An Ant Colony Optimization Algorithm for the Two-Stage Knapsack Problem.
[proceedings] [extended abstact] [slides]
10th Biannual International Conference on Artificial Evolution (Angers, France)
|
|
S. K.:
Approximability of the Two-Stage Knapsack problem with discretely distributed weights.
[proceedings] [extended abstact] [slides]
10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (Rome, Italy)
|
|
S. K.:
Towards an Ant Colony Optimization algorithm for the Two-Stage Knapsack problem.
[proceedings] [slides]
VII. ALIO/EURO Workshop on Applied Combinatorial Optimization (Porto, Portugal)
|
2010
|
S. K., Marc Letournel, Abdel Lisser:
On a Stochastic Knapsack Problem.
[extended abstract] [slides]
9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (Cologne, Germany)
|
2009
|
S. K., Abdel Lisser:
On a Two-Stage Stochastic Knapsack Problem with Probabilistic Constraint.
[proceedings] [slides]
8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (Paris, France)
|
|
S. K., Pierre Le Bodic, Janny Leung, Abdel Lisser:
On a stochastic bilevel programming problem with knapsack constraints.
[extended abstract]
[slides]
International Network Optimization Conference (Pisa, Italy)
|
2008
|
S. K., Abdel Lisser:
Stochastic Knapsack Problem. [slides]
Modelling, Computation and Optimization in Information Systems and Management Sciences (Metz, France)
|
Talks at National Conferences
|
2010
|
Jianqiang Cheng, S. K., Abdel Lisser:
Stochastic Shortest Path Problem with Delay Excess Penalty.
[extended abstract]
[slides]
11ème congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (Toulouse, France)
|
2009
|
S. K., Abdel Lisser:
Ploblèmes relaxés du sac-à-dos stochastique.
[extended abstract]
[slides]
10èmes Journées Doctorales en Informatique et Réseaux (Belfort, France)
|
|
S. K., Abdel Lisser:
On Two-Stage Stochastic Knapsack Problems with Probabilistic Constraint.
[abstract] [slides]
5ème journée Optimeo (Gif-sur-Yvette, France)
|
2007
|
S. K., Matthieu Latapy:
Modèle multiparti pour les grands graphes de terrain.
[slides]
9èmes Journées Graphes et Algorithmes (Paris, France)
|
Working Papers
|
|
S. K.:
A new class of Probabilistic Graph Coloring problems
S. K., Marc Letournel, Abdel Lisser:
Stochastic Knapsack Problem with expectation constraint
|