Publications (7)
Naive Newsvendor Adjustments: Are They Always Detrimental?
Congzheng Liu, Adam N. Letchford, Ivan Svetunkov
Newsvendor problems are an important and much-studied topic in stochastic inventory control. One strand of the literature on newsvendor problems is concerned with the fact that pra…
Operational Research: Methods and Applications
Fotios Petropoulos, Gilbert Laporte, Emel Aktas +79
Throughout its history, Operational Research has evolved to include a variety of methods, models and algorithms that have been applied to a diverse and wide range of contexts. This…
Adaptive Policies for Perimeter Surveillance Problems
James A. Grant, David S. Leslie, Kevin Glazebrook +2
Maximising the detection of intrusions is a fundamental and often critical aim of perimeter surveillance. Commonly, this requires a decision-maker to optimally allocate multiple se…
On a class of metrics related to graph layout problems
Adam N. Letchford, Hanna Seitz, Dirk Oliver Theis
We examine the metrics that arise when a finite set of points is embedded in the real line, in such a way that the distance between each pair of points is at least 1. These metrics…
Odd minimum cut sets and b-matchings revisited
Adam N. Letchford, Dirk Oliver Theis
The famous Padberg-Rao separation algorithm for b-matching polyhedra can be implemented to run in O(n^2m log(n^2/m)) time in the uncapacitated case, and in O(nm^2 log(n^2/m)) time…
Iterated Chvatal-Gomory Cuts and the Geometry of Numbers
Iskander Aliev, Adam N. Letchford
Chvatal-Gomory cutting planes (CG-cuts for short) are a fundamental tool in Integer Programming. Given any single CG-cut, one can derive an entire family of CG-cuts, by `iterating'…