S. K., Abdel Lisser:
On two-stage stochastic knapsack problems with or without probability constraint. [preprint]
Accepted for publication in Discrete Applied Mathematics
 

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
[Klick hier um zu einer aktuelleren Version dieses Artikels zu gelangen, mit ein wenig mehr Hintergrundinformationen und einigen wichtigen Korrekturen (verfasst von S. Kosuch)]
 

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
 

S. K., Pierre Le Bodic, Janny Leung, Abdel Lisser:
On a Stochastic Bilevel Programming Problem with Knapsack constraints.
[Revised version] Revised version submitted
 

S. K.: Non-Approximability of Two-Stage Knapsack problems.
 

S. K., Marc Letournel, Abdel Lisser: Calculating upper bounds for a B&B framework to solve the Expectation Constrained Stochastic Knapsack Problem.
 

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)  
 

On a Stochastic Knapsack Problem. [proceedings] [slides]
9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (Cologne, Germany)
 

On a Two-Stage Stochastic Knapsack Problem with Probabilistic Constraint. [proceedings] [slides]
8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (Paris, France)
 

On a stochastic bilevel programming problem with knapsack constraints.
[ext. abstract] [slides]
International Network Optimization Conference (Pisa, Italy)
 

Stochastic Knapsack Problem. [slides]
Modelling, Computation and Optimization in Information Systems and Management Sciences (Metz, France)
 

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)
 

Ploblèmes relaxés du sac-à-dos stochastique. [ext. abstract] [slides]
10èmes Journées Doctorales en Informatique et Réseaux (Belfort, France)
 

On Two-Stage Stochastic Knapsack Problems with Probabilistic Constraint.
[abstract] [slides]
5ème journée Optimeo (Gif-sur-Yvette, France)
 

Modèle multiparti pour les grands graphes de terrain. [abstract] [slides]
9èmes Journées Graphes et Algorithmes (Paris, France)