| Publication | Date of Publication | Type |
|---|
Finding hypernetworks in directed hypergraphs
European Journal of Operational Research | 2015-07-28 | Paper |
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 |
Apportionments with minimum Gini index of disproportionality: a quadratic knapsack approach
Annals of Operations Research | 2014-09-26 | Paper |
Optimization and probabilistic satisfiability on nested and co-nested formulas
Annals of Operations Research | 2011-11-17 | Paper |
An aggregate label setting policy for the multi-objective shortest path problem
European Journal of Operational Research | 2010-12-20 | Paper |
Bicriterion shortest paths in stochastic time-dependent networks
Multiobjective Programming and Goal Programming | 2009-12-04 | Paper |
Time-adaptive and history-adaptive multicriterion routing in stochastic, time-dependent networks
Operations Research Letters | 2009-08-14 | Paper |
Theory and Applications of Satisfiability Testing
Lecture Notes in Computer Science | 2009-07-24 | Paper |
The stack loading and unloading problem
Discrete Applied Mathematics | 2009-03-04 | Paper |
Shortest paths in piecewise continuous time-dependent networks
Operations Research Letters | 2009-01-09 | Paper |
Probability logic and optimization SAT: The PSAT and CPA models
Annals of Mathematics and Artificial Intelligence | 2005-05-13 | Paper |
Finding the \(K\) shortest hyperpaths
Computers & Operations Research | 2005-02-22 | Paper |
On bandwidth-2 graphs
Discrete Applied Mathematics | 2002-05-15 | Paper |
Auction algorithms for shortest hyperpath problems
SIAM Journal on Optimization | 2001-03-19 | Paper |
A directed hypergraph model for random time dependent shortest paths
European Journal of Operational Research | 2000-07-09 | Paper |
Hierarchies of polynomially solvable satisfiability problems
Annals of Mathematics and Artificial Intelligence | 1998-07-19 | Paper |
Lower bounds for the quadratic semi-assignment problem
European Journal of Operational Research | 1998-06-11 | Paper |
Max Horn SAT and the minimum cut problem in directed hypergraphs
Mathematical Programming. Series A. Series B | 1998-03-11 | Paper |
| scientific article; zbMATH DE number 956861 (Why is no real title available?) | 1997-06-09 | Paper |
A new algorithm for the propositional satisfiability problem
Discrete Applied Mathematics | 1995-09-06 | Paper |
Efficient labelling algorithms for the maximum noncrossing matching problem
Discrete Applied Mathematics | 1994-03-17 | Paper |
A linear time algorithm for unique Horn satisfiability
Information Processing Letters | 1994-02-24 | Paper |
