World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
32
Citations
15030
World Ranking
12841
National Ranking
817

Mathematics

D-Index
32
Citations
15030
World Ranking
3087
National Ranking
201

Overview

Adam N. Letchford is affiliated with Lancaster University in the United Kingdom and has a research profile focused on engineering and computer science, with particular attention to industrial and manufacturing engineering as well as computational theory and mathematics.

The scientist's work covers several specialized subfields, including:

  • Industrial and Manufacturing Engineering
  • Computational Theory and Mathematics
  • Computer Networks and Communications
  • Organizational Behavior and Human Resource Management
  • Control and Systems Engineering

Research topics central to Adam N. Letchford's publications highlight optimization and algorithms, particularly in:

  • Vehicle Routing Optimization Methods
  • Optimization and Packing Problems
  • Advanced Manufacturing and Logistics Optimization
  • Advanced Graph Theory Research
  • Complexity and Algorithms in Graphs
  • Scheduling and Optimization Algorithms
  • Optimization and Search Problems

Frequent publication venues for this researcher include:

  • Operations Research Letters
  • Computers & Operations Research
  • Networks
  • Discrete Optimization
  • Journal of the Operational Research Society

Adam N. Letchford has collaborated regularly with several co-authors, including:

  • Thu Huong Dang
  • Burak Boyacı
  • Konstantinos Kaparis
  • Sebastian Cáceres Gelvez
  • Ioannis Mourtos

Recent research articles authored or co-authored by Adam N. Letchford span a range of topics and venues:

  • Operational Research: methods and applications (2023), Journal of the Operational Research Society
  • Newsvendor problems: An integrated method for estimation and optimisation (2021), European Journal of Operational Research
  • A cut-and-branch algorithm for the Quadratic Knapsack Problem (2020), Discrete Optimization
  • Vehicle routing on road networks: How good is Euclidean approximation? (2020), Computers & Operations Research
  • A survey on exact algorithms for the maximum flow and minimum-cost flow problems (2023), Networks

Best Publications

  • Theory of Linear and Integer Programming

    Alexander Schrijver

  • A new branch-and-cut algorithm for the capacitated vehicle routing problem

    Jens Lysgaard;Adam N. Letchford;Richard W. Eglese

  • Non-convex mixed-integer nonlinear programming: A survey

    Samuel Burer;Adam N. Letchford

  • Projection results for vehicle routing

    Adam N. Letchford;Juan-José Salazar-González

  • Compact formulations of the Steiner Traveling Salesman Problem and related problems

    Adam N. Letchford;Saeideh D. Nasiri;Dirk Oliver Theis

  • A polyhedral approach to the single row facility layout problem

    André Renato Sales Amaral;Adam N. Letchford

  • Separation algorithms for 0-1 knapsack polytopes

    Konstantinos Kaparis;Adam N. Letchford

  • On Nonconvex Quadratic Programming with Box Constraints

    Samuel Burer;Adam N. Letchford

  • Multistars, partial multistars and the capacitated vehicle routing problem

    Adam N. Letchford;Richard W. Eglese;Jens Lysgaard

  • On the separation of split cuts and related inequalities

    Alberto Caprara;Adam N. Letchford

  • On the separation of maximally violated mod-k cuts

    Alberto Caprara;Matteo Fischetti;Adam N. Letchford

  • Strengthening Chvátal-Gomory cuts and Gomory fractional cuts

    Adam N. Letchford;Andrea Lodi

  • Operational Research: methods and applications

    Unknown

  • A cutting plane algorithm for the General Routing Problem

    Angel Corberán;Adam N. Letchford;José María Sanchis

  • A faster exact separation algorithm for Blossom inequalities

    Adam N. Letchford;Gerhard Reinelt;Dirk Oliver Theis

  • Exploiting sparsity in pricing routines for the capacitated arc routing problem

    Adam N. Letchford;Amar Oukil

  • Stronger multi-commodity flow formulations of the Capacitated Vehicle Routing Problem

    Adam N. Letchford;Juan-José Salazar-González

  • Odd Minimum Cut Sets and $b$-Matchings Revisited

    Adam N. Letchford;Gerhard Reinelt;Dirk Oliver Theis

  • Analysis of upper bounds for the pallet loading problem

    Adam N. Letchford;André Renato Sales Amaral

  • Detecting changes in slope with an L0 penalty

    Paul Fearnhead;Robert Maidstone;Adam Letchford

  • The rural postman problem with deadline classes

    Adam N. Letchford;Richard W. Eglese

  • New inequalities for the General Routing Problem

    Adam N. Letchford

  • Approximation Algorithms: VV Vazirani, Springer-Verlag, 2001. xix + 378 pp. $34.95 ISBN: 3-540-65367-8

    A N Letchford

  • A Branch-and-Cut Algorithm for the Capacitated Open Vehicle Routing Problem

    Adam N. Letchford;Jens Lysgaard;Richard W. Eglese

Frequent Co-Authors

Andrea Lodi
Andrea Lodi Cornell University
Richard W. Eglese
Richard W. Eglese Lancaster University
Juan-José Salazar-González
Juan-José Salazar-González University of La Laguna
Alberto Caprara
Alberto Caprara University of Bologna
Qiang Ni
Qiang Ni Lancaster University
Gerhard Reinelt
Gerhard Reinelt Heidelberg University
David Steurer
David Steurer ETH Zurich
Jean B. Lasserre
Jean B. Lasserre Laboratory for Analysis and Architecture of Systems
Paul Fearnhead
Paul Fearnhead Lancaster University
Matteo Fischetti
Matteo Fischetti University of Padua

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Pursuing a Mathematics degree in the USA opens doors to various interdisciplinary fields and career paths. Many students complement their math skills with degrees that enhance their marketability, such as an online marketing degree. This combination is valuable for data-driven marketing roles that require a strong analytical background.

For those interested in leadership and business management, an 12 month MBA programs provide an accelerated pathway to gain crucial managerial skills. These programs often attract students with technical degrees like Mathematics who want to transition into strategic roles in industry or consulting.

If transferring credits is a consideration, many reputable online MBA programs that accept transfer credits offer flexibility. This allows students to build on previously earned qualifications while managing work and study commitments effectively.

Another complementary path is pursuing an MS in data analytics. Mathematics graduates with expertise in analytics and data science are in high demand across industries such as finance, healthcare, and technology, making this a strategic choice for future-proof careers.

Best Scientists Citing Adam N. Letchford

Trending Scientists

Recently Published Articles