Adam N. Letchford
Numerical Analysis · 2004–2017
A researcher in the Science corpus: 3 papers; trusts 21 researchers and is trusted by 14 researchers here, as inferred from the citation graph.
Subfields
- Numerical Analysis — 19 citations into it; #1,773 of 3,586 by trust here, #2,107 by citations
- Control and Systems Engineering — 13 citations into it; #3,908 of 8,257 by trust here, #5,784 by citations
- Computational Theory and Mathematics — 10 citations into it; #6,373 of 12,182 by trust here, #8,294 by citations
- Artificial Intelligence — 6 citations into it
- Statistics and Probability — 6 citations into it
- Industrial and Manufacturing Engineering — 5 citations into it; #360 of 2,521 by trust here, #1,203 by citations
Whom Adam N. Letchford trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Christodoulos A. Floudas
- Jean B. Lasserre
- Mohit Tawarmalani
- S. Burer
- Paolo Toth
- Gerhard Reinelt
- Robert Tibshirani
- Nikolaos V. Sahinidis
- Silvano Martello
- Frank Hampel
Who trusts Adam N. Letchford overall
- Roberto Baldacci
- Juan Pablo Vielma
- Qingqing Wu
- David Pisinger
- Aristide Mingozzi
- Abdelkader Sbihi
- Ilgaz Sungur
- Mads Kehlet Jepsen
- Yaoxin Wu
- Rui Zhang
Papers from Adam N. Letchford's perspective
Ordered by how strongly the researchers Adam N. Letchford trusts endorse each paper. Same corpus, a different order for every researcher.
- Global optimization of mixed-integer nonlinear programs: A theoretical and computational study (Mathematical programming)
- A polyhedral branch-and-cut approach to global optimization (Mathematical programming)
- Branching and bounds tighteningtechniques for non-convex MINLP (Optim. Methods Softw.)
- Global Optimization with Polynomials and the Problem of Moments (SIAM Journal on Optimization)
- Estimating the Dimension of a Model
- Generalized Benders Decomposition (Encyclopedia of Optimization)
- Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization
- Geometry of cuts and metrics (Algorithms and Combinatorics)
Their papers
- Non-convex mixed-integer nonlinear programming: A survey (2012) — 623 citations
- Detecting Changes in Slope With an L0 Penalty (2017) — 70 citations
- A new branch-and-cut algorithm for the capacitated vehicle routing problem (2004) — 673 citations