Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Adam N. Letchford" ( http://dblp.L3S.de/Authors/Adam_N._Letchford )

  Author page on DBLP  Author page in RDF  Community of Adam N. Letchford in ASPL-2

Publication years (Num. hits)
1999-2004 (16) 2005-2009 (17) 2010-2012 (14)
Publication types (Num. hits)
article(39) incollection(1) inproceedings(7)
Venues (Conferences, Journals, ...)
Math. Program.(10) Oper. Res. Lett.(8) IPCO(6) Computers & OR(3) European Journal of Operationa...(3) 4OR(2) Discrete Optimization(2) Electronic Notes in Discrete M...(2) Math. Oper. Res.(2) Combinatorial Optimization(1) CoRR(1) Discrete Applied Mathematics(1) Encyclopedia of Optimization(1) INFORMS Journal on Computing(1) J. Comb. Optim.(1) Networks(1) More (+10 of total 18)
Authors
Adam N. Letchford(47) Alberto Caprara(6) Andrea Lodi(6) Juan José Salazar González(5) Konstantinos Kaparis(4) Richard W. Eglese(4) Dirk Oliver Theis(3) Laura Galli(3) Monia Giandomenico(3) Nicholas A. Pearson(3) André R. S. Amaral(2) Fabrizio Rossi(2) Gerhard Reinelt(2) Jens Lysgaard(2) Michael M. Sørensen(2) Stefano Smriglio(2) More (+10 of total 29)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 18 occurrences of 14 keywords
Results
Found 47 publication records. Showing 47 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
1Laura Galli, Konstantinos Kaparis, Adam N. Letchford Complexity results for the gap inequalities for the max-cut problem. Search on Bibsonomy Oper. Res. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Adam N. Letchford, Sebastian J. Miller Fast bounding procedures for large instances of the Simple Plant Location Problem. Search on Bibsonomy Computers & OR The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Adam N. Letchford, Saeideh D. Nasiri, Dirk Oliver Theis Compact Formulations of the Steiner Traveling Salesman Problem and Related Problems Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Adam N. Letchford, Michael M. Sørensen Binary positive semidefinite matrices and associated integer polytopes. Search on Bibsonomy Math. Program. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Laura Galli, Konstantinos Kaparis, Adam N. Letchford Gap inequalities for non-convex mixed-integer quadratic programs. Search on Bibsonomy Oper. Res. Lett. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Adam N. Letchford, Sebastian Pokutta, Andreas S. Schulz On the membership problem for the {0, 1/2}-closure. Search on Bibsonomy Oper. Res. Lett. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Corinne Feremans, Martine Labbé, Adam N. Letchford, Juan José Salazar González Generalized network design polyhedra. Search on Bibsonomy Networks The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Alberto Caprara, Adam N. Letchford, Juan José Salazar González Decorous Lower Bounds for Minimum Linear Arrangement. Search on Bibsonomy INFORMS Journal on Computing The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Monia Giandomenico, Adam N. Letchford, Fabrizio Rossi, Stefano Smriglio A New Approach to the Stable Set Problem Based on Ellipsoids. Search on Bibsonomy IPCO The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Laura Galli, Adam N. Letchford Small bipartite subgraph polytopes. Search on Bibsonomy Oper. Res. Lett. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Alberto Caprara, Adam N. Letchford, Juan José Salazar González Lower Bounds for the Minimum Linear Arrangement of a Graph. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Konstantinos Kaparis, Adam N. Letchford Separation algorithms for 0-1 knapsack polytopes. Search on Bibsonomy Math. Program. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Alberto Caprara, Adam N. Letchford New techniques for cost sharing in combinatorial optimization games. Search on Bibsonomy Math. Program. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Adam N. Letchford Integer Quadratic Quasi-polyhedra. Search on Bibsonomy IPCO The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Samuel Burer, Adam N. Letchford On Nonconvex Quadratic Programming with Box Constraints. Search on Bibsonomy SIAM Journal on Optimization The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Adam N. Letchford, Amar Oukil Exploiting sparsity in pricing routines for the capacitated arc routing problem. Search on Bibsonomy Computers & OR The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Monia Giandomenico, Adam N. Letchford, Fabrizio Rossi, Stefano Smriglio An application of the Lovász-Schrijver M(K, K) operator to the stable set problem. Search on Bibsonomy Math. Program. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000) 90C27
1Richard W. Eglese, Adam N. Letchford General Routing Problem. Search on Bibsonomy Encyclopedia of Optimization The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Routing
1André R. S. Amaral, Alberto Caprara, Adam N. Letchford, Juan José Salazar González A New Lower Bound for the Minimum Linear Arrangement of a Graph. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Adam N. Letchford, Nicholas A. Pearson Exploiting planarity in separation routines for the symmetric traveling salesman problem. Search on Bibsonomy Discrete Optimization The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Konstantinos Kaparis, Adam N. Letchford Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem. Search on Bibsonomy European Journal of Operational Research The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Adam N. Letchford, Nicholas A. Pearson Good triangulations yield good tours. Search on Bibsonomy Computers & OR The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Adam N. Letchford, Gerhard Reinelt, Dirk Oliver Theis Odd Minimum Cut Sets and b-Matchings Revisited. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Alistair R. Clark, Richard W. Eglese, Adam N. Letchford, Michael B. Wright Preface. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Adam N. Letchford, Michael M. Sørensen Binary Positive Semidefinite Matrices and Associated Integer Polytopes. Search on Bibsonomy IPCO The full citation details ... 2008 DBLP  DOI  BibTeX  RDF semidefinite programming, Polyhedral combinatorics
1Jon Lee, Adam N. Letchford Mixed integer programming. Search on Bibsonomy Discrete Optimization The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Adam N. Letchford, Andrea Lodi The traveling salesman problem: a book review. Search on Bibsonomy 4OR The full citation details ... 2007 DBLP  DOI  BibTeX  RDF MSC classification (2000) 90C05, 90C27, 90C57, 90C35
1Lisa Fleischer, Adam N. Letchford, Andrea Lodi Polynomial-Time Separation of a Superclass of Simple Comb Inequalities. Search on Bibsonomy Math. Oper. Res. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Adam N. Letchford, Juan José Salazar González Projection results for vehicle routing. Search on Bibsonomy Math. Program. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Integer programming, Projection, Vehicle routing
1Monia Giandomenico, Adam N. Letchford Exploring the Relationship Between Max-Cut and Stable Set Relaxations. Search on Bibsonomy Math. Program. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Stable set problem, Polyhedral combinatorics, Max-cut problem
1Adam N. Letchford, Nicholas A. Pearson A fast algorithm for minimum weight odd circuits and cuts in planar graphs. Search on Bibsonomy Oper. Res. Lett. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Adam N. Letchford Book review. Search on Bibsonomy Oper. Res. Lett. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Jens Lysgaard, Adam N. Letchford, Richard W. Eglese A new branch-and-cut algorithm for the capacitated vehicle routing problem. Search on Bibsonomy Math. Program. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF separation, vehicle routing, branch-and-cut
1Adam N. Letchford, Gerhard Reinelt, Dirk Oliver Theis A Faster Exact Separation Algorithm for Blossom Inequalities. Search on Bibsonomy IPCO The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Adam N. Letchford, Andrea Lodi Primal separation algorithms. Search on Bibsonomy 4OR The full citation details ... 2003 DBLP  DOI  BibTeX  RDF primal algorithms, stable set problem, Integer programming, travelling salesman problem, separation, knapsack problem
1Adam N. Letchford Binary clutter inequalities for integer programs. Search on Bibsonomy Math. Program. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Alberto Caprara, Adam N. Letchford On the separation of split cuts and related inequalities. Search on Bibsonomy Math. Program. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Adam N. Letchford Totally tight Chvátal-Gomory cuts. Search on Bibsonomy Oper. Res. Lett. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Adam N. Letchford, Andrea Lodi Strengthening Chvátal-Gomory cuts and Gomory fractional cuts. Search on Bibsonomy Oper. Res. Lett. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Adam N. Letchford, Richard W. Eglese, Jens Lysgaard Multistars, partial multistars and the capacitated vehicle routing problem. Search on Bibsonomy Math. Program. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Adam N. Letchford, Andrea Lodi Polynomial-Time Separation of Simple Comb Inequalities. Search on Bibsonomy IPCO The full citation details ... 2002 DBLP  BibTeX  RDF
1Adam N. Letchford On Disjunctive Cuts for Combinatorial Optimization. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Adam N. Letchford, André R. S. Amaral Analysis of upper bounds for the Pallet Loading Problem. Search on Bibsonomy European Journal of Operational Research The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Adam N. Letchford, Andrea Lodi An Augment-and-Branch-and-Cut Framework for Mixed 0-1 Programming. Search on Bibsonomy Combinatorial Optimization The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Adam N. Letchford Separating a Superclass of Comb Inequalities in Planar Graphs. Search on Bibsonomy Math. Oper. Res. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Adam N. Letchford The general routing polyhedron: A unifying framework. Search on Bibsonomy European Journal of Operational Research The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Alberto Caprara, Matteo Fischetti, Adam N. Letchford On the Separation of Maximally Violated mod-k Cuts. Search on Bibsonomy IPCO The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #47 of 47 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.