120 citations · 127 across the 8 of their papers we have counts for
9 papers
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…
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…
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…
A Two-Level Graph Partitioning Problem Arising in Mobile Wireless Communications
Jamie Fairbrother, Adam Letchford, Keith Briggs
In the k-partition problem (k-PP), one is given an edge-weighted undirected graph, and one must partition the node set into at most k subsets, in order to minimise (or maximise) th…
Detecting changes in slope with an penalty
Robert Maidstone, Paul Fearnhead, Adam Letchford
Whilst there are many approaches to detecting changes in mean for a univariate time-series, the problem of detecting multiple changes in slope has comparatively been ignored. Part…
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'…
Compact Formulations of the Steiner Traveling Salesman Problem and Related Problems
Adam N. Letchford, Saeideh D. Nasiri, Dirk Oliver Theis
The Steiner Traveling Salesman Problem (STSP) is a variant of the Traveling Salesman Problem (TSP) that is particularly suitable when dealing with sparse networks, such as road net…
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…