Items where Author is "Letchford, A N"

Journal Article

Galli, Laura and Kaparis, Konstantinos and Letchford, A N (2012) Complexity results for the gap inequalities for the max-cut problem. Operations Research Letters, 40 (3). pp. 149-152. ISSN 0167-6377

Letchford, A N and Miller, Sebastian John (2012) Fast bounding procedures for large instances of the simple plant location problem. Computers and Operations Research, 39 (5). pp. 985-990. ISSN 0305-0548

Letchford, A N and Sorensen, M M (2012) Binary positive semidefinite matrices and associated integer polytopes. Mathematical Programming, 131 (1-2). pp. 253-271. ISSN 0025-5610

Letchford, A N and Pokutta, Sebastian and Schulz, AS (2011) On the membership problem for the {0, 1/2}-closure. Operations Research Letters, 39 (5). pp. 301-304. ISSN 0167-6377

Fortini, M and Letchford, A N and Lodi, A and Wenger, K M (2011) Computing compatible tours for the traveling salesman problem. Mathematical Programming Computation, 3 (1). pp. 59-78. ISSN 1867-2957

Caprara, A and Letchford, A N and Salazar, J J (2011) Decorous lower bounds for minimum linear arrangement. INFORMS Journal on Computing, 23 (1). pp. 26-40. ISSN 1526-5528

Galli, Laura and Kaparis, Konstantinos and Letchford, A N (2011) Gap inequalities for non-convex mixed-integer quadratic programs. Operations Research Letters, 39 (5). pp. 297-300. ISSN 0167-6377

Caprara, A and Letchford, A N (2010) New techniques for cost sharing in combinatorial optimization games. Mathematical Programming, 124 (1-2). pp. 93-118. ISSN 0025-5610

Letchford, A N and Reinelt, G and Seitz, H and Theis, D O (2010) On a class of metrics related to graph layout problems. Linear Algebra and its Applications, 433 (11-12). pp. 1760-1777.

Letchford, A N (2010) Review of "Applying mod-k-cuts for solving linear ordering problems". Mathematical Reviews.

Letchford, A N (2010) Review of "Coefficient strengthening: a tool for reformulating mixed-integer programs". Mathematical Reviews.

Letchford, A N (2010) Review of "Extended formulations in combinatorial optimization". Mathematical Reviews.

Letchford, A N (2010) Review of "Gear composition of stable set polytopes and G-perfection". Mathematical Reviews.

Letchford, A N (2010) Review of "Minimal inequalities for an infinite relaxation of integer programs". Mathematical Reviews.

Galli, L and Letchford, A N (2010) Small bipartite subgraph polytopes. Operations Research Letters, 38 (5). pp. 337-340. ISSN 0167-6377

Letchford, A N and Oukil, A (2009) Exploiting sparsity in pricing routines for the capacitated arc routing problem. Computers and Operations Research, 36 (7). pp. 2320-2327. ISSN 0305-0548

Burer, S and Letchford, A N (2009) On non-convex quadratic programming with box constraints. SIAM Journal on Optimization, 20 (2). pp. 1073-1089. ISSN 1095-7189

Letchford, A N (2009) Review of "A note on the continuous mixing sets". Mathematical Reviews.

Letchford, A N (2009) Review of "Generalized mixed integer rounding inequalities: facets for infinite group polyhedra. Mathematical Reviews.

Letchford, A N (2009) Review of "Local cuts revisited". Mathematical Reviews.

Letchford, A N (2009) Review of "MIR closures of polyhedral sets". Mathematical Reviews.

Giandomenico, M and Letchford, A N and Rossi, F and Smriglio, S (2009) An application of the Lovasz-Schrijver M(K,K) operator to the stable set problem. Mathematical Programming, 120 (2). pp. 381-401. ISSN 0025-5610

Kaparis, Konstantinos and Letchford, A N (2008) Local and global lifted cover inequalities for the multidimensional knapsack problem. European Journal of Operational Research, 186 (1). pp. 91-103. ISSN 0377-2217

Letchford, A N and Pearson, N (2008) Exploiting planarity in separation routines for the symmetric travelling salesman problem. Discrete Optimization, 5 (2). pp. 220-230. ISSN 1572-5286

Letchford, A N and Pearson, N (2008) Good triangulations yield good tours. Computers and Operations Research, 35 (2). pp. 638-647. ISSN 0305-0548

Letchford, A N and Reinelt, G and Theis, D O (2008) Odd minimum cut-sets and b-matchings revisited. SIAM Journal on Discrete Mathematics, 22 (4). pp. 1480-1487. ISSN 0895-4801

Letchford, A N (2008) Review of "A branch-and-cut algorithm for a resource-constrained scheduling problem". Mathematical Reviews.

Letchford, A N (2008) Review of "FPTAS for optimizing polynomials over the mixed-integar points of polytopes in fixed dimension". Mathematical Reviews.

Letchford, A N (2008) Review of "New cutting-planes for the time and/or precedence-constrained ATSP and directed VRP". Mathematical Reviews.

Letchford, A N (2008) Review of "On clique separators, nearly chordal graphs and the maximum weight stable set problem". Mathematical Reviews.

Letchford, A N (2008) Review of "Projected Chvátal-Gomory cuts for mixed integer linear programs". Mathematical Reviews.

Letchford, A N and Lodi, A (2007) The traveling salesman problem : a book review. 4OR: A Quarterly Journal of Operations Research, 5 (4). pp. 315-317. ISSN 1619-4500

Lee, Jon and Letchford, A N (2007) Editorial: Mixed integer programming. Discrete Optimization, 4 (1). pp. 1-2. ISSN 1572-5286

Letchford, A N (2007) Review of "A new min-cut max-flow ratio for multicommodity flows". Mathematical Reviews.

Letchford, A N (2007) Review of "Integer programming formulations for the two 4-hop constrained paths problem". Mathematical Reviews.

Letchford, A N (2007) Review of "Optimization with binet matrices". Mathematical Reviews.

Letchford, A N (2007) Review of "Using critical sets to solve the maximum independent set problem". Mathematical Reviews.

Letchford, A N (2007) Review of "Using mixed-integer programming to solve power grid blackout problems". Mathematical Reviews.

Letchford, A N and Lysgaard, J and Eglese, R W (2007) A branch-and-cut algorithm for the capacitated open vehicle routing problem. Journal of the Operational Research Society, 58 (12). pp. 1642-1651. ISSN 1476-9360

Giandomenico, M and Letchford, A N (2006) Exploring the relationship between max-cut and stable set relaxations. Mathematical Programming, 106 (1). pp. 159-175. ISSN 0025-5610

Fleischer, L K and Letchford, A N and Lodi, A (2006) Polynomial-time separation of a superclass of simple comb inequalities. Mathematics of Operations Research, 31 (4). pp. 696-713. ISSN 0364-765X

Letchford, A N and Salazar, J J (2006) Projection results for vehicle routing. Mathematical Programming, 105 (2-3). pp. 251-274. ISSN 0025-5610

Letchford, A N and Pearson, N (2005) A fast algorithm for minimum weight odd cuts and circuits in planar graphs. Operations Research Letters, 33 (6). pp. 625-628. ISSN 0167-6377

Letchford, A N (2004) Review of "The Vehicle Routing Problem". Operations Research Letters, 32 (4). pp. 392-393. ISSN 0167-6377

Letchford, A N (2004) Review of "Introduction to the Theory of Cooperative Games". Journal of the Operational Research Society, 55 (7). pp. 787-788. ISSN 1476-9360

Letchford, A N and Eglese, R W and Lysgaard, J (2004) A new branch-and-cut algorithm for the capacitated vehicle routing problem. Mathematical Programming, 100 (2). pp. 423-445. ISSN 0025-5610

Letchford, A N (2003) Binary clutter inequalities for integer programs. Mathematical Programming, 98 (1-3). pp. 201-221. ISSN 0025-5610

Caprara, A and Letchford, A N (2003) On the separation of split cuts and related inequalities. Mathematical Programming, 94 (2-3). pp. 279-294. ISSN 0025-5610

Letchford, A N (2002) Review of "Approximation Algorithms". Journal of the Operational Research Society, 53 (7). pp. 807-808. ISSN 1476-9360

Lysgaard, J and Eglese, R W and Letchford, A N (2002) Multistars, partial multistars and the capacitated vehicle routing problem. Mathematical Programming, 94 (1). pp. 21-40. ISSN 0025-5610

Letchford, A N and Amaral, A R S (2001) Analysis of upper bounds for the pallet loading problem. European Journal of Operational Research, 132 (3). pp. 582-593. ISSN 0377-2217

Corberan, A and Sanchis, J M and Letchford, A N (2001) A cutting plane algorithm for the general routing problem. Mathematical Programming, 90 (2). pp. 291-316. ISSN 0025-5610

Caprara, A and Fischetti, M and Letchford, A N (2000) On the separation of maximally violated mod-k cuts. Mathematical Programming, 87 (1). pp. 37-56. ISSN 0025-5610

Letchford, A N (2000) Review of "Model Building in Mathematical Programming". Journal of the Operational Research Society, 51 (10). pp. 1212-1213. ISSN 1476-9360

Letchford, A N (2000) Review of "Theory of Linear and Integer Programming". Journal of the Operational Research Society, 51 (7). pp. 892-893. ISSN 1476-9360

Letchford, A N and Clarke, D D (1998) Action rules extracted by machine induction from feature-coded self reports. Journal of Social Behavior and Personality, 13. pp. 33-50. ISSN 0886-1641

Letchford, A N (1996) Allocation of school bus contracts by integer programming. Journal of the Operational Research Society, 47 (3). pp. 369-372. ISSN 1476-9360

Contribution in Book/Report/Proceedings

Kaparis, Konstantinos and Letchford, A N (2011) Cover Inequalities. In: Wiley Encyclopedia of Operations Research and Management Science :. Wiley. ISBN 978-0-470-40063-0

Letchford, A N and Lodi, A (2011) Mathematical programming approaches to the traveling salesman problem. In: Wiley Encyclopedia of Operations Research and Management Science :. John Wiley and Sons Ltd, Chichester. ISBN 9780470400630

Giandomenico, M and Letchford, A N and Rossi, F and Smriglio, S (2011) A new approach to the stable set problem based on ellipsoids. In: Integer Programming and Combinatorial Optimization : Proceedings of the 15th International IPCO Conference. Lecture Notes in Computer Science . Springer, USA, pp. 223-234. ISBN 9783642208065

Letchford, A N (2010) Integer quadratic quasi-polyhedra. In: Integer Programming and Combinatorial Optimization : Proceedings of the 14th International IPCO Conference. Lecture Notes in Computer Science . Springer, CHE, pp. 258-270.

Letchford, A N and Sorensen, M M (2008) Binary positive semidefinite matrices and associated integer polytopes. In: Integer Programming and Combinatorial Optimization : Proceedings of the 13th International IPCO Conference. Lecture Notes in Computer Science . Springer, ITA, pp. 125-139. ISBN 3540688862

Letchford, A N and Reinelt, G and Theis, D O (2004) A faster exact separation algorithm for blossom inequalities. In: Integer Programming and Combinatorial Optimization : Proceedings of the 10th International IPCO Conference. Lecture Notes in Computer Science . Springer, USA, pp. 19-52. ISBN 3-540-22113-1

Letchford, A N and Lodi, A (2003) An augment-and-branch-and-cut framework for mixed 0-1 programming. In: Combinatorial Optimization : Eureka! You Shrink. Lecture Notes in Computer Science . Springer, FRA, pp. 119-133. ISBN 3-540-00580-3

Lodi, A and Letchford, A N (2002) Polynomial-time separation of simple comb inequalities. In: Integer Programming and Combinatorial Optimization : Proceedings of the 9th International IPCO Conference. Lecture Notes in Computer Science . Springer, USA, pp. 93-108. ISBN 3-540-43676-6

Letchford, A N and Eglese, R W (2001) The general routing problem. In: Encyclopedia of Optimization, Vol II (E - Integer) :. Kluwer Academic Publishers, Dordrecht, pp. 206-207. ISBN 0-7923-6932-7

Caprara, A and Fischetti, M and Letchford, A N (1999) On the separation of maximally violated mod-k cuts. In: Integer Programming and Combinatorial Optimization : Proceedings of the 7th International IPCO Conference. Lecture Notes in Computer Science . Springer, AUT, pp. 87-98. ISBN 978-3-540-66019-4

Monograph

Giandomenico, M and Letchford, A N and Rossi, F and Smriglio, S (2011) A new approach to the stable set problem based on ellipsoids. Working Paper. The Department of Management Science, Lancaster University.

Letchford, A N and Amaral, Andre (2011) A polyhedral approach to the single row facility layout problem. Working Paper. The Department of Management Science, Lancaster University.

Letchford, A N and Lysgaard, J and Eglese, R W (2006) A branch-and-cut algorithm for the capacitated open vehicle routing problem. Working Paper. The Department of Management Science, Lancaster University.

Letchford, A N and Pearson, N (2005) Exploiting planarity in separation routines for the symmetric travelling salesman problem. Working Paper. The Department of Management Science, Lancaster University.

Letchford, A N and Lodi, A (2003) Polynomial-time separation of simple comb inequalities. Working Paper. The Department of Management Science, Lancaster University.

Eglese, R W and Letchford, A N and Lysgaard, J (2003) A new branch-and-cut algorithm for capacitated vehicle routing problems. Working Paper. The Department of Management Science, Lancaster University.

Letchford, A N (2002) Binary clutter inequalities for integer programs. Working Paper. The Department of Management Science, Lancaster University.