| Publication | Date of Publication | Type |
|---|
Time consistent expected mean-variance in multistage stochastic quadratic optimization: a model and a matheuristic
Annals of Operations Research | 2020-01-20 | Paper |
A parallel branch-and-fix coordination based matheuristic algorithm for solving large sized multistage stochastic mixed 0-1 problems
European Journal of Operational Research | 2018-05-25 | Paper |
Scenario cluster decomposition of the Lagrangian dual in two-stage stochastic mixed 0-1 optimization
Computers & Operations Research | 2016-11-11 | Paper |
An algorithmic framework for solving large-scale multistage stochastic mixed 0-1 problems with nonsymmetric scenario trees. II: Parallelization
Computers & Operations Research | 2016-11-10 | Paper |
On time stochastic dominance induced by mixed integer-linear recourse in multistage stochastic programs
European Journal of Operational Research | 2016-10-07 | Paper |
On parallelization of a stochastic dynamic programming algorithm for solving large-scale mixed \(0-1\) problems under uncertainty
Top | 2015-11-06 | Paper |
On solving strong multistage nonsymmetric stochastic mixed 0-1 problems
Operations Research Proceedings | 2015-03-03 | Paper |
| scientific article; zbMATH DE number 6296773 (Why is no real title available?) | 2014-05-19 | Paper |
Lagrangian decomposition for large-scale two-stage stochastic mixed 0-1 problems
Top | 2013-02-26 | Paper |
A so-called cluster Benders decomposition approach for solving two-stage stochastic linear problems
Top | 2013-02-26 | Paper |
An algorithmic framework for solving large-scale multistage stochastic mixed 0-1 problems with nonsymmetric scenario trees
Computers & Operations Research | 2012-11-15 | Paper |
Erratum: ``An algorithmic framework for solving large scale multistage stochastic mixed 0-1 problems with nonsymmetric scenario trees''
Computers & Operations Research | 2012-11-15 | Paper |
Staff rostering for the station personnel of a railway company
The Journal of the Operational Research Society | 2010-09-02 | Paper |
An exact algorithm for solving large-scale two-stage stochastic mixed-integer problems: some theoretical and experimental aspects
European Journal of Operational Research | 2010-01-15 | Paper |
On \(BFC-MSMIP\) strategies for scenario cluster partitioning, and twin node family branching selection and bounding for multistage stochastic mixed integer programming
Computers & Operations Research | 2009-11-27 | Paper |
On multistage stochastic integer programming for incorporating logical constraints in asset and liability management under uncertainty
Computational Management Science | 2009-09-03 | Paper |
BFC-MSMIP: an exact branch-and-fix coordination approach for solving multistage stochastic mixed 0-1 problems
Top | 2009-09-03 | Paper |
Rostering in a rail passenger carrier
Journal of Scheduling | 2009-08-28 | Paper |
A general algorithm for solving two-stage stochastic mixed 0-1 first-stage problems
Computers & Operations Research | 2009-04-03 | Paper |
A two-stage stochastic integer programming approach as a mixture of branch-and-fix coordination and Benders decomposition schemes
Annals of Operations Research | 2008-03-31 | Paper |
The value of the stochastic solution in multistage problems
Top | 2007-08-31 | Paper |
An approach for strategic supply chain planning under uncertainty based on stochastic 0-1 programming
Journal of Global Optimization | 2004-02-12 | Paper |
An \(O(n \log n)\) procedure for identifying facets of the knapsack polytope.
Operations Research Letters | 2003-06-17 | Paper |
\(O(n \log n)\) procedures for tightening cover inequalities
European Journal of Operational Research | 1999-11-28 | Paper |
On using an automatic scheme for obtaining the convex hull defining inequalities of a Weismantel 0-1 knapsack constraint
Top | 1999-09-22 | Paper |
Some properties of cliques in 0-1 mixed integer programs
Top | 1998-05-06 | Paper |
On using clique overlapping for detecting knapsack constraint redundancy and infeasibility in 0-1 mixed integer programs
Top | 1996-11-24 | Paper |
On the Dietrich-Escudero approach for solving the \(0-1\) knapsack problem with a \(0-1\) objective function
European Journal of Operational Research | 1994-07-26 | Paper |
\(O(n)\) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates
Top | 1993-01-01 | Paper |
Strategies for LP-based solving a general class of scheduling problems
Trabajos de Investigacion Operativa | 1990-01-01 | Paper |
