| Publication | Date of Publication | Type |
|---|
Easy cases of probabilistic satisfiability
Annals of Mathematics and Artificial Intelligence | 2015-06-17 | Paper |
Ranking paths in stochastic time-dependent networks
European Journal of Operational Research | 2015-02-03 | Paper |
The bicriterion multimodal assignment problem: introduction, analysis, and experimental results
INFORMS Journal on Computing | 2012-07-28 | Paper |
Capacitated network design with uncertain demand
INFORMS Journal on Computing | 2012-05-30 | Paper |
A tabu search approach to clustering
Operations Research Proceedings 2008 | 2011-04-07 | Paper |
Bicriterion shortest paths in stochastic time-dependent networks
Multiobjective Programming and Goal Programming | 2009-12-04 | Paper |
Erratum to ``An algorithm for ranking assignments using reoptimization [Computers \& Operations Research 35 (2008) 3714-3726]
Computers & Operations Research | 2009-10-15 | Paper |
Time-adaptive and history-adaptive multicriterion routing in stochastic, time-dependent networks
Operations Research Letters | 2009-08-14 | Paper |
An algorithm for ranking assignments using reoptimization
Computers & Operations Research | 2008-04-28 | Paper |
Solving a large-scale precedence constrained scheduling problem with elastic jobs using tabu search
Computers & Operations Research | 2007-02-19 | Paper |
Applying the minimax criterion in stochastic recourse programs
European Journal of Operational Research | 2005-04-21 | Paper |
Finding the \(K\) shortest hyperpaths
Computers & Operations Research | 2005-02-22 | Paper |
Multiperiod capacity expansion of a telecommunications connection with uncertain demand
Computers & Operations Research | 2004-10-14 | Paper |
Bicriteria network location (BNL) problems with criteria dependent lengths and minisum objectives
European Journal of Operational Research | 2004-08-19 | Paper |
Bicriterion shortest hyperpaths in random time-dependent networks
IMA Journal of Management Mathematics | 2004-05-27 | Paper |
The bicriterion semi-obnoxious location (BSL) problem solved by an \(\varepsilon\)-approximation
European Journal of Operational Research | 2003-04-28 | Paper |
A label correcting approach for solving bicriterion shortest-path problems
Computers & Operations Research | 2001-03-04 | Paper |
On consistency in probabilistic logic for logical formulas represented by \(B\)-hypertrees
European Journal of Operational Research | 2000-09-27 | Paper |
| scientific article; zbMATH DE number 1187083 (Why is no real title available?) | 2000-09-27 | Paper |
Computing the NTU-Shapley value of NTU-games defined by multiple objective linear programs
International Journal of Game Theory | 2000-07-26 | Paper |
| scientific article; zbMATH DE number 1187080 (Why is no real title available?) | 1998-08-10 | Paper |
On bicriterion minimal spanning trees: An approximation
Computers & Operations Research | 1997-07-15 | Paper |
Determining lower and upper bounds on probabilities of atomic propositions in sets of logical formulas represented by digraphs
Annals of Operations Research | 1996-11-19 | Paper |
Characterizing consistency in probabilistic logic for a class of Horn clauses
Mathematical Programming. Series A. Series B | 1994-12-11 | Paper |
