( en | de | ru )

 

Disambiguation of "Letchford, Adam N."

Author of the publication

copydeleteadd this publication to your clipboard
Preface.

, , , and . Discret. Appl. Math., 156 (3): 289-290 (2008)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

n n n

Joshua Letchford

n AÊ¿w n

N -L N Nguyen

n-hy n Yi

 

Other publications of authors with the same name

On Nonconvex Quadratic Programming with Box Constraints., and . SIAM J. Optimization, 20 (2): 1073-1089 (2009)Iterated Chvátal-Gomory Cuts and the Geometry of Numbers., and . SIAM J. Optimization, 24 (3): 1294-1312 (2014)A heuristic for fair dynamic resource allocation in overloaded OFDMA systems., , and . J. Heuristics, 26 (1): 21-32 (2020)On some lower bounds for the permutation flowshop problem., , and . Comput. Oper. Res., (November 2023)Matheuristics: survey and synthesis., , and . Int. Trans. Oper. Res., 30 (6): 2840-2866 (November 2023)Integer Quadratic Quasi-polyhedra.. IPCO, volume 6080 of Lecture Notes in Computer Science, page 258-270. Springer, (2010)An Augment-and-Branch-and-Cut Framework for Mixed 0-1 Programming., and . Combinatorial Optimization, volume 2570 of Lecture Notes in Computer Science, page 119-133. Springer, (2001)Polynomial-Time Separation of a Superclass of Simple Comb Inequalities., , and . Math. Oper. Res., 31 (4): 696-713 (2006)Separating a Superclass of Comb Inequalities in Planar Graphs.. Math. Oper. Res., 25 (3): 443-454 (2000)A branch-and-cut algorithm for the capacitated open vehicle routing problem., , and . JORS, 58 (12): 1642-1651 (2007)