Letchford Adam N

Adam N Letchford

Information about the author Adam N Letchford will soon be added to the site.
Found 7 papers in total
An aggressive reduction scheme for the simple plant location problem
An aggressive reduction scheme for the simple plant location problem
2014
Pisinger et al. introduced the concept of ‘aggressive reduction’ for...
Complexity results for the gap inequalities for the max‐cut problem
Complexity results for the gap inequalities for the max‐cut problem
2012
We prove several complexity results about the gap inequalities for the max‐cut...
Fast bounding procedures for large instances of the Simple Plant Location Problem
Fast bounding procedures for large instances of the Simple Plant Location Problem
2012
Some new, simple and extremely fast bounding procedures are presented for...
Gap inequalities for non‐convex mixed‐integer quadratic programs
Gap inequalities for non‐convex mixed‐integer quadratic programs
2011
The gap inequalities form a very general class of cutting planes for the...
On the membership problem for the {1,1/2}‐closure
On the membership problem for the {1,1/2}‐closure
2011
Zero‐half cuts are a class of cutting planes for integer programming problems....
Decorous Lower Bounds for Minimum Linear Arrangement
Decorous Lower Bounds for Minimum Linear Arrangement
2011
Minimum linear arrangement is a classical basic combinatorial optimization problem...
Polynomial-time separation of a superclass of simple comb inequalities
Polynomial-time separation of a superclass of simple comb inequalities
2006
The comb inequalities are a well–known class of facet–inducing...
Papers per page: