| Publication | Date of Publication | Type |
|---|
Benders decomposition: solving binary master problems by enumeration
Operations Research Letters | 2018-09-28 | Paper |
Hierarchical benders decomposition for open-pit mine block sequencing
Operations Research | 2016-10-31 | Paper |
Theoretical and computational advances for network diversion
Networks | 2016-06-10 | Paper |
A sliding time window heuristic for open pit mine block sequencing
Optimization Letters | 2012-11-30 | Paper |
The multi-terminal maximum-flow network-interdiction problem
European Journal of Operational Research | 2012-10-26 | Paper |
Solving the bi-objective maximum-flow network-interdiction problem
INFORMS Journal on Computing | 2012-06-18 | Paper |
Dantzig-Wolfe decomposition for solving multistage stochastic capacity-planning problems
Operations Research | 2011-11-24 | Paper |
Interdicting a Nuclear-Weapons Project
Operations Research | 2011-11-24 | Paper |
Lagrangian relaxation and enumeration for solving constrained shortest-path problems
Networks | 2008-12-17 | Paper |
Solving a class of stochastic mixed-integer programs with branch and price
Mathematical Programming. Series A. Series B | 2006-09-12 | Paper |
Near-shortest and K-shortest simple paths
Networks | 2005-09-22 | Paper |
| scientific article; zbMATH DE number 2050721 (Why is no real title available?) | 2004-03-07 | Paper |
Shortest-path network interdiction
Networks | 2002-12-17 | Paper |
Stochastic network interdiction
Operations Research | 2002-03-18 | Paper |
Restricted-recourse bounds for stochastic linear programming
Operations Research | 2002-02-07 | Paper |
Monte Carlo bounding techniques for determinig solution quality in stochastic programs
Operations Research Letters | 2001-03-18 | Paper |
| scientific article; zbMATH DE number 1114460 (Why is no real title available?) | 1998-02-08 | Paper |
Deterministic network interdiction
Mathematical and Computer Modelling | 1993-06-29 | Paper |
| scientific article; zbMATH DE number 89096 (Why is no real title available?) | 1993-01-16 | Paper |
Multivariable and multirate self-tuning control: a distillation column case study
IEE Proceedings D Control Theory and Applications | 1992-06-26 | Paper |
Triconnected decomposition for computingK-terminal network reliability
Networks | 1989-01-01 | Paper |
Variance Reduction Using Nonlinear Controls and Transformations
Communications in Statistics. Simulation and Computation | 1989-01-01 | Paper |
Formal proof for the constant trace forgetting factor
International Journal of Control | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4083345 (Why is no real title available?) | 1988-01-01 | Paper |
Factoring Algorithms for Computing K-Terminal Network Reliability
IEEE Transactions on Reliability | 1986-01-01 | Paper |
A factoring algorithm using polygon-to-chain reductions for computing K-terminal network reliability
Networks | 1985-01-01 | Paper |
Extracting embedded generalized networks from linear programming problems
Mathematical Programming | 1985-01-01 | Paper |
Robust multivariable control of a binary distillation column
IEE Proceedings D Control Theory and Applications | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3786604 (Why is no real title available?) | 1982-01-01 | Paper |
A reply to Comments on self-tuning regulator applied to a binary distillation column
Automatica | 1979-01-01 | Paper |
