Movatterモバイル変換

[0]ホーム
URL:

×

zbMATH Open — the first resource for mathematics

from until
Reset all

Examples

Simon Donald*Search inall parts of an author's name (results containSimon, Donald M. andDonaldson,Simon Kirwan).
ln: Donald* fn: SimonSearch for specified family (ln) and given (fn) name.
au: Stefan Müller cc:49Combine name search (au) with main MSC fields (cc).
au: Helga BunkeSearch results includename variations, in particularname changes, differenttransliterations andpseudonyms. Names of collectives will be displayed as a separate entity.
(st:r & b) | (st:o)Search results include allreviewers withbiographic information orcollectives.
(en:MGP | wikidata) ln:a*Search results include all authors having either anentry in theMath Genealogy Project or inWikidata and whose family name starts with''A''.
aw: Fields AbelSearch for allFields Medalaward winners who also received anAbel Prize. The& operator is default and ommitted here.

Fields

ai zbMATH author ID
any Includes ai, au, aw, cc
au Author name
aw Name of an award (to find laureates)
cc Main Fields of the author (given by first two MSC digits)
cm Name of a collective (to find members of this collective)
co Name of an author (to find collectives the author is a member of)
en External author ID: ORCID, MGP, Wikidata object number and others
fn First name
ln Last name
py Year(s) in which the author has published. Interval search with “-”
rv Reviewer ID
st State: has biographic references (st:b), is cited (st:c), is collective (st:o), has references (st:r)

Operators

a & bLogical and (default)
a | bLogical or
!abLogical not
abc*Right wildcard
ab cPhrase
(ab c)Term grouping

See also ourGeneral Help.



Letchford, Adam N.

Co-Author Distance
Author ID:
letchford.adam-n Recent zbMATH articles by "Letchford, Adam N."
Published as:
Letchford, Adam N.;Letchford, Adam;Letchfoed, Adam N.;Letchford, A. N.
External Links:
MGP ·ORCID ·Wikidata
Software Indexed:
1 Package
alltop 5

Co-Authors

9single-authored
10 Galli, Laura
10 Kaparis, Konstantinos
8 Lodi, Andrea
8 Salazar-González, Juan-José
7 Caprara, Alberto
5 Dang, Thu Huong
5 Eglese, Richard W.
5 Rossi, Fabrizio
5 Smriglio, Stefano
4 Boyacı, Burak
4 Giandomenico, Monia
4 Sørensen, Michael Malmros
4 Souli, Georgia
4 Theis, Dirk Oliver
3 Amaral, André R. S.
3 Fomeni, Franklin Djeumou
3 Miller, Sebastian J.
3 Nasiri, Saeideh D.
3 Ni, Qiang
3 Pearson, Nicholas A.
3 Reinelt, Gerhard
3 Zhong, Zhaoyu
2 Burer, Samuel
2 Dokka, Trivikram
2 Fairbrother, Jamie
2 Fischetti, Matteo
2 Hasan Mansoor, M.
2 Liu, Congzheng
2 Lysgaard, Jens
2 Mourtos, Ioannis
2 Oukil, Amar
2 Svetunkov, Ivan
1 Aktaş, Emel
1 Aliev, Iskander M.
1 Alumur, Sibel A.
1 Archetti, Claudia
1 Ayhan, Hayriye
1 Battarra, Maria
1 Bektas, Tolga
1 Bennell, Julia A.
1 Boschetti, Marco Antonio
1 Bourjolly, Jean-Marie
1 Boylan, John Edward
1 Breton, Michèle
1 Briggs, Keith M.
1 Cáceres Gelvez, Sebastian
1 Canca, David
1 Charlin, Laurent
1 Chen, Bo
1 Cicek, Cihan Tugrul
1 Clark, Alistair Richard
1 Corberán, Angel
1 Cox, Louis Anthony jun.
1 Cruz-Mejía, Oliverio
1 Currie, Christine S. M.
1 Demeulemeester, Erik L.
1 Ding, Li
1 Disney, Stephen M.
1 Ehrgott, Matthias
1 Eppler, Martin J.
1 Erdoğan, Güneş
1 Fearnhead, Paul
1 Feremans, Corinne
1 Fleischer, Lisa K.
1 Fortini, Matteo
1 Fortz, Bernard
1 Franco, L. Alberto
1 Frische, Jens
1 Glazebrook, Kevin
1 Grainger, Daniel J.
1 Grant, James A.
1 Greco, Salvatore
1 Gregory, Amanda J.
1 Hämäläinen, Raimo P.
1 Herroelen, Willy S.
1 Hewitt, Michael R.
1 Holmström, Jan
1 Hooker, John N. jun.
1 Işık, Tuğçe
1 Johnes, Jill
1 Kara, Bahar Yetis
1 Karsu, Özlem
1 Kent, Katherine
1 Köhler, Charlotte
1 Kunc, Martin
1 Kuo, Yonghong
1 Labbé, Martine V.
1 Laporte, Gilbert
1 Lasserre, Jean-Bernard
1 Lee, Jon
1 Leslie, David S.
1 Leung, Janny M. Y.
1 Li, Dong
1 Lienert, Judit
1 Ljubić, Ivana
1 Lozano, Sebastián
1 Lurkin, Virginie
1 Maidstone, Robert
1 Maniezzo, Vittorio
1 Martello, Silvano
...and 44 more Co-Authors

Publications by Year

Citations contained in zbMATH Open

93 Publications have been cited 964 times in719 DocumentsCited by ▼Year ▼
A new branch-and-cut algorithm for the capacitated vehicle routing problem. Zbl 1073.90068
Lysgaard, Jens;Letchford, Adam N.;Eglese, Richard W.
2004
Projection results for vehicle routing. Zbl 1085.90032
Letchford, Adam N.;Salazar-González, Juan-José
2006
Separation algorithms for 0-1 knapsack polytopes. Zbl 1198.90297
Kaparis, Konstantinos;Letchford, Adam N.
2010
Multistars, partial multistars and the capacitated vehicle routing problem. Zbl 1023.90073
Letchford, Adam N.;Eglese, Richard W.;Lysgaard, Jens
2002
Compact formulations of the Steiner traveling salesman problem and related problems. Zbl 1332.90329
Letchford, Adam N.;Nasiri, Saeideh D.;Theis, Dirk Oliver
2013
A cutting plane algorithm for the general routing problem. Zbl 0989.90026
Corberán, Angel;Letchford, Adam N.;Sanchis, José María
2001
On nonconvex quadratic programming with box constraints. Zbl 1201.90146
Burer, Samuel;Letchford, Adam N.
2009
On the separation of split cuts and related inequalities. Zbl 1030.90095
Caprara, Alberto;Letchford, Adam N.
2003
A polyhedral approach to the single row facility layout problem. Zbl 1280.90132
Amaral, André R. S.;Letchford, Adam N.
2013
Odd minimum cut sets and \(b\)-matchings revisited. Zbl 1178.90290
Letchford, Adam N.;Reinelt, Gerhard;Theis, Dirk Oliver
2008
Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem. Zbl 1138.90016
Kaparis, Konstantinos;Letchford, Adam N.
2008
Strengthening Chvátal-Gomory cuts and Gomory fractional cuts. Zbl 1027.90062
Letchford, Adam N.;Lodi, Andrea
2002
Stronger multi-commodity flow formulations of the capacitated vehicle routing problem. Zbl 1346.90615
Letchford, Adam N.;Salazar-González, Juan-José
2015
On the separation of maximally violated mod-\(k\) cuts. Zbl 0959.90035
Caprara, Alberto;Fischetti, Matteo;Letchford, Adam N.
2000
A dynamic programming heuristic for the quadratic knapsack problem. Zbl 1356.90165
Fomeni, Franklin Djeumou;Letchford, Adam N.
2014
A faster exact separation algorithm for blossom inequalities. Zbl 1092.90542
Letchford, Adam N.;Reinelt, Gerhard;Theis, Dirk Oliver
2004
New inequalities for the general routing problem. Zbl 0924.90127
Letchford, Adam N.
1997
Exploiting sparsity in pricing routines for the capacitated arc routing problem. Zbl 1158.90321
Letchford, Adam N.;Oukil, Amar
2009
New techniques for cost sharing in combinatorial optimization games. Zbl 1194.91036
Caprara, Alberto;Letchford, Adam N.
2010
Decorous lower bounds for minimum linear arrangement. Zbl 1243.90185
Caprara, Alberto;Letchford, Adam N.;Salazar-González, Juan-José
2011
On disjunctive cuts for combinatorial optimization. Zbl 1078.90039
Letchford, Adam N.
2001
Detecting changes in slope with an \(L_0\) penalty. Zbl 07499051
Fearnhead, Paul;Maidstone, Robert;Letchford, Adam
2019
On lifted cover inequalities: a new lifting procedure with unusual properties. Zbl 1476.90285
Letchford, Adam N.;Souli, Georgia
2019
Analysis of upper bounds for the pallet loading problem. Zbl 1054.90062
Letchford, Adam N.;Amaral, André
2001
Exploring the relationship between max-cut and stable set relaxations. Zbl 1134.90519
Giandomenico, Monia;Letchford, Adam N.
2006
Pricing routines for vehicle routing with time windows on road networks. Zbl 1348.90547
Letchford, Adam N.;Nasiri, Saeideh D.;Oukil, Amar
2014
Polyhedral theory for arc routing problems. Zbl 0970.90071
Eglese, Richard W.;Letchford, Adam N.
2000
An application of the Lovász-Schrijver \(M(K, K)\) operator to the stable set problem. Zbl 1176.90494
Giandomenico, Monia;Letchford, Adam N.;Rossi, Fabrizio;Smriglio, Stefano
2009
A new separation algorithm for the Boolean quadric and cut polytopes. Zbl 1308.90209
Letchford, Adam N.;Sørensen, Michael M.
2014
An aggressive reduction scheme for the simple plant location problem. Zbl 1304.90123
Letchford, Adam N.;Miller, Sebastian J.
2014
Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem. Zbl 1346.90709
Letchford, Adam N.;Salazar-González, Juan-José
2016
A compact variant of the QCR method for quadratically constrained quadratic \(0-1\) programs. Zbl 1292.90206
Galli, Laura;Letchford, Adam N.
2014
Primal cutting plane algorithms revisited. Zbl 1023.90087
Letchford, Adam N.;Lodi, Andrea
2002
The rural postman problem with deadline classes. Zbl 0955.90111
Letchford, A. N.;Eglese, R. W.
1998
Unbounded convex sets for non-convex mixed-integer quadratic programming. Zbl 1291.90146
Burer, Samuel;Letchford, Adam N.
2014
Separating a superclass of comb inequalities in planar graphs. Zbl 0977.90075
Letchford, Adam N.
2000
Gap inequalities for non-convex mixed-integer quadratic programs. Zbl 1235.90102
Galli, Laura;Kaparis, Konstantinos;Letchford, Adam N.
2011
A two-level graph partitioning problem arising in mobile wireless communications. Zbl 1397.90325
Fairbrother, Jamie;Letchford, Adam N.;Briggs, Keith
2018
Binary positive semidefinite matrices and associated integer polytopes. Zbl 1235.90113
Letchford, Adam N.;Sørensen, Michael M.
2012
Fast bounding procedures for large instances of the simple plant location problem. Zbl 1251.90243
Letchford, Adam N.;Miller, Sebastian J.
2012
The general routing polyhedron: A unifying framework. Zbl 0937.90008
Letchford, Adam N.
1999
Projection results for the \(k\)-partition problem. Zbl 1387.90213
Fairbrother, Jamie;Letchford, Adam N.
2017
Ellipsoidal relaxations of the stable set problem: theory and algorithms. Zbl 1330.90093
Giandomenico, Monia;Letchford, Adam N.;Rossi, Fabrizio;Smriglio, Stefano
2015
Cutting planes for RLT relaxations of mixed 0-1 polynomial programs. Zbl 1328.90111
Fomeni, Franklin Djeumou;Kaparis, Konstantinos;Letchford, Adam N.
2015
A cut-and-branch algorithm for the quadratic knapsack problem. Zbl 1510.90224
Djeumou Fomeni, Franklin;Kaparis, Konstantinos;Letchford, Adam N.
2022
Newsvendor problems: an integrated method for estimation and optimisation. Zbl 1495.90008
Liu, Congzheng;Letchford, Adam N.;Svetunkov, Ivan
2022
New valid inequalities and facets for the simple plant location problem. Zbl 1388.90065
Galli, Laura;Letchford, Adam N.;Miller, Sebastian J.
2018
The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time. Zbl 1403.90578
Letchford, Adam N.;Salazar-González, Juan-José
2019
A fast algorithm for minimum weight odd circuits and cuts in planar graphs. Zbl 1080.05091
Letchford, Adam N.;Pearson, Nicholas A.
2005
The stable set problem: clique and nodal inequalities revisited. Zbl 1458.90550
Letchford, Adam N.;Rossi, Fabrizio;Smriglio, Stefano
2020
Binary clutter inequalities for integer programs. Zbl 1082.90069
Letchford, Adam N.
2003
A guide to conic optimisation and its applications. Zbl 1411.90256
Letchford, Adam N.;Parkes, Andrew J.
2018
Integer quadratic quasi-polyhedra. Zbl 1285.90066
Letchford, Adam N.
2010
Good triangulations yield good tours. Zbl 1141.90032
Letchford, Adam N.;Pearson, Nicholas A.
2008
The Steiner travelling salesman problem with correlated costs. Zbl 1346.90708
Letchford, Adam N.;Nasiri, Saeideh D.
2015
A new approach to the stable set problem based on ellipsoids. Zbl 1341.90098
Giandomenico, Monia;Letchford, Adam N.;Rossi, Fabrizio;Smriglio, Stefano
2011
On the complexity of surrogate and group relaxation for integer linear programs. Zbl 1525.90275
Dokka, Trivikram;Letchford, Adam N.;Hasan Mansoor, M.
2021
Using \(\ell^p\)-norms for fairness in combinatorial optimisation. Zbl 1458.90538
Bektaş, Tolga;Letchford, Adam N.
2020
A new lower bound for the minimum linear arrangement of a graph. Zbl 1341.05236
Amaral, André R. S.;Caprara, Alberto;Letchford, Adam N.;Salazar-Gonzalez, Juan-José
2008
On the Lovász theta function and some variants. Zbl 1387.90181
Galli, Laura;Letchford, Adam N.
2017
Polynomial-time separation of a superclass of simple comb inequalities. Zbl 1278.90337
Fleischer, Lisa K.;Letchford, Adam N.;Lodi, Andrea
2006
Matheuristics: survey and synthesis. Zbl 07745315
Boschetti, Marco A.;Letchford, Adam N.;Maniezzo, Vittorio
2023
On the membership problem for the \({0, 1/2}\)-closure. Zbl 1235.90094
Letchford, Adam N.;Pokutta, Sebastian;Schulz, Andreas S.
2011
Gap inequalities for the max-cut problem: a cutting-plane algorithm. Zbl 1370.90214
Galli, Laura;Kaparis, Konstantinos;Letchford, Adam N.
2012
Vehicle routing on road networks: how good is Euclidean approximation? Zbl 1510.90276
Boyacı, Burak;Dang, Thu Huong;Letchford, Adam N.
2021
Adaptive policies for perimeter surveillance problems. Zbl 1431.62334
Grant, James A.;Leslie, David S.;Glazebrook, Kevin;Szechtman, Roberto;Letchford, Adam N.
2020
Allocation of school bus contracts by integer programming. Zbl 0852.90097
Letchford, Adam N.
1996
An augment-and-branch-and-cut framework for mixed 0-1 programming. Zbl 1024.90506
Letchford, Adam N.;Lodi, Andrea
2003
Primal separation algorithms. Zbl 1102.90074
Letchford, Adam N.;Lodi, Andrea
2003
Totally tight Chvatal-Gomory cuts. Zbl 1027.90061
Letchford, Adam N.
2002
Binary positive semidefinite matrices and associated integer polytopes. Zbl 1143.90370
Letchford, Adam N.;Sørensen, Michael M.
2008
Polynomial-time separation of simple comb inequalities. Zbl 1049.90046
Letchford, Adam N.;Lodi, Andrea
2002
A note on the 2-circulant inequalities for the MAX-cut problem. Zbl 1452.90269
Kaparis, Konstantinos;Letchford, Adam N.
2018
An exact algorithm for a resource allocation problem in mobile wireless communications. Zbl 1387.90160
Letchford, Adam N.;Ni, Qiang;Zhong, Zhaoyu
2017
A binarisation heuristic for non-convex quadratic programming with box constraints. Zbl 1476.90255
Galli, Laura;Letchford, Adam N.
2018
New valid inequalities for the fixed-charge and single-node flow polytopes. Zbl 1476.90355
Letchford, Adam N.;Souli, Georgia
2019
Lifting the knapsack cover inequalities for the knapsack polytope. Zbl 1479.90140
Letchford, Adam N.;Souli, Georgia
2020
Generalized network design polyhedra. Zbl 1233.90066
Feremans, Corinne;Labbé, Martine;Letchford, Adam N.;Salazar-González, Juan-José
2011
Strengthened clique-family inequalities for the stable set polytope. Zbl 1525.90366
Letchford, Adam N.;Ventura, Paolo
2021
On matroid parity and matching polytopes. Zbl 1443.05030
Kaparis, Konstantinos;Letchford, Adam N.;Mourtos, Ioannis
2020
On the separation of maximally violated mod-\(k\) cuts. Zbl 0955.90094
Caprara, Alberto;Fischetti, Matteo;Letchford, Adam N.
1999
The Boolean quadric polytope. Zbl 1506.90195
Letchford, Adam N.
2022
Revisiting surrogate relaxation for the multidimensional knapsack problem. Zbl 1525.90276
Dokka, Trivikram;Letchford, Adam N.;Mansoor, M. Hasan
2022
A heuristic for maximising energy efficiency in an OFDMA system subject to QoS constraints. Zbl 1404.90091
Letchford, Adam N.;Ni, Qiang;Zhong, Zhaoyu
2018
Lower bounds for the minimum linear arrangement of a graph. Zbl 1274.90449
Caprara, Alberto;Letchford, Adam N.;Salazar-González, Juan-José
2010
On a class of metrics related to graph layout problems. Zbl 1222.05036
Letchford, Adam N.;Reinelt, Gerhard;Seitz, Hanna;Theis, Dirk Oliver
2010
Small bipartite subgraph polytopes. Zbl 1231.05221
Galli, Laura;Letchford, Adam N.
2010
Complexity results for the gap inequalities for the max-cut problem. Zbl 1245.90101
Galli, Laura;Kaparis, Konstantinos;Letchford, Adam N.
2012
On matchings, \(T\)-joins, and arc routing in road networks. Zbl 1535.90121
Boyacı, Burak;Dang, Thu Huong;Letchford, Adam N.
2022
Exploiting planarity in separation routines for the symmetric traveling salesman problem. Zbl 1151.90039
Letchford, Adam N.;Pearson, Nicholas A.
2008
Strengthening Chvátal-Gomory cuts for the stable set problem. Zbl 1452.90272
Letchford, Adam N.;Marzi, Francesca;Rossi, Fabrizio;Smriglio, Stefano
2016
Improving a constructive heuristic for the general routing problem. Zbl 1529.90063
Boyacı, Burak;Dang, Thu Huong;Letchford, Adam N.
2023
Fast upper and lower bounds for a large-scale real-world arc routing problem. Zbl 1529.90013
Boyacı, Burak;Dang, Thu Huong;Letchford, Adam N.
2023
Matheuristics: survey and synthesis. Zbl 07745315
Boschetti, Marco A.;Letchford, Adam N.;Maniezzo, Vittorio
2023
Improving a constructive heuristic for the general routing problem. Zbl 1529.90063
Boyacı, Burak;Dang, Thu Huong;Letchford, Adam N.
2023
Fast upper and lower bounds for a large-scale real-world arc routing problem. Zbl 1529.90013
Boyacı, Burak;Dang, Thu Huong;Letchford, Adam N.
2023
A cut-and-branch algorithm for the quadratic knapsack problem. Zbl 1510.90224
Djeumou Fomeni, Franklin;Kaparis, Konstantinos;Letchford, Adam N.
2022
Newsvendor problems: an integrated method for estimation and optimisation. Zbl 1495.90008
Liu, Congzheng;Letchford, Adam N.;Svetunkov, Ivan
2022
The Boolean quadric polytope. Zbl 1506.90195
Letchford, Adam N.
2022
Revisiting surrogate relaxation for the multidimensional knapsack problem. Zbl 1525.90276
Dokka, Trivikram;Letchford, Adam N.;Mansoor, M. Hasan
2022
On matchings, \(T\)-joins, and arc routing in road networks. Zbl 1535.90121
Boyacı, Burak;Dang, Thu Huong;Letchford, Adam N.
2022
On the complexity of surrogate and group relaxation for integer linear programs. Zbl 1525.90275
Dokka, Trivikram;Letchford, Adam N.;Hasan Mansoor, M.
2021
Vehicle routing on road networks: how good is Euclidean approximation? Zbl 1510.90276
Boyacı, Burak;Dang, Thu Huong;Letchford, Adam N.
2021
Strengthened clique-family inequalities for the stable set polytope. Zbl 1525.90366
Letchford, Adam N.;Ventura, Paolo
2021
The stable set problem: clique and nodal inequalities revisited. Zbl 1458.90550
Letchford, Adam N.;Rossi, Fabrizio;Smriglio, Stefano
2020
Using \(\ell^p\)-norms for fairness in combinatorial optimisation. Zbl 1458.90538
Bektaş, Tolga;Letchford, Adam N.
2020
Adaptive policies for perimeter surveillance problems. Zbl 1431.62334
Grant, James A.;Leslie, David S.;Glazebrook, Kevin;Szechtman, Roberto;Letchford, Adam N.
2020
Lifting the knapsack cover inequalities for the knapsack polytope. Zbl 1479.90140
Letchford, Adam N.;Souli, Georgia
2020
On matroid parity and matching polytopes. Zbl 1443.05030
Kaparis, Konstantinos;Letchford, Adam N.;Mourtos, Ioannis
2020
Detecting changes in slope with an \(L_0\) penalty. Zbl 07499051
Fearnhead, Paul;Maidstone, Robert;Letchford, Adam
2019
On lifted cover inequalities: a new lifting procedure with unusual properties. Zbl 1476.90285
Letchford, Adam N.;Souli, Georgia
2019
The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time. Zbl 1403.90578
Letchford, Adam N.;Salazar-González, Juan-José
2019
New valid inequalities for the fixed-charge and single-node flow polytopes. Zbl 1476.90355
Letchford, Adam N.;Souli, Georgia
2019
A two-level graph partitioning problem arising in mobile wireless communications. Zbl 1397.90325
Fairbrother, Jamie;Letchford, Adam N.;Briggs, Keith
2018
New valid inequalities and facets for the simple plant location problem. Zbl 1388.90065
Galli, Laura;Letchford, Adam N.;Miller, Sebastian J.
2018
A guide to conic optimisation and its applications. Zbl 1411.90256
Letchford, Adam N.;Parkes, Andrew J.
2018
A note on the 2-circulant inequalities for the MAX-cut problem. Zbl 1452.90269
Kaparis, Konstantinos;Letchford, Adam N.
2018
A binarisation heuristic for non-convex quadratic programming with box constraints. Zbl 1476.90255
Galli, Laura;Letchford, Adam N.
2018
A heuristic for maximising energy efficiency in an OFDMA system subject to QoS constraints. Zbl 1404.90091
Letchford, Adam N.;Ni, Qiang;Zhong, Zhaoyu
2018
Projection results for the \(k\)-partition problem. Zbl 1387.90213
Fairbrother, Jamie;Letchford, Adam N.
2017
On the Lovász theta function and some variants. Zbl 1387.90181
Galli, Laura;Letchford, Adam N.
2017
An exact algorithm for a resource allocation problem in mobile wireless communications. Zbl 1387.90160
Letchford, Adam N.;Ni, Qiang;Zhong, Zhaoyu
2017
Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem. Zbl 1346.90709
Letchford, Adam N.;Salazar-González, Juan-José
2016
Strengthening Chvátal-Gomory cuts for the stable set problem. Zbl 1452.90272
Letchford, Adam N.;Marzi, Francesca;Rossi, Fabrizio;Smriglio, Stefano
2016
Stronger multi-commodity flow formulations of the capacitated vehicle routing problem. Zbl 1346.90615
Letchford, Adam N.;Salazar-González, Juan-José
2015
Ellipsoidal relaxations of the stable set problem: theory and algorithms. Zbl 1330.90093
Giandomenico, Monia;Letchford, Adam N.;Rossi, Fabrizio;Smriglio, Stefano
2015
Cutting planes for RLT relaxations of mixed 0-1 polynomial programs. Zbl 1328.90111
Fomeni, Franklin Djeumou;Kaparis, Konstantinos;Letchford, Adam N.
2015
The Steiner travelling salesman problem with correlated costs. Zbl 1346.90708
Letchford, Adam N.;Nasiri, Saeideh D.
2015
A dynamic programming heuristic for the quadratic knapsack problem. Zbl 1356.90165
Fomeni, Franklin Djeumou;Letchford, Adam N.
2014
Pricing routines for vehicle routing with time windows on road networks. Zbl 1348.90547
Letchford, Adam N.;Nasiri, Saeideh D.;Oukil, Amar
2014
A new separation algorithm for the Boolean quadric and cut polytopes. Zbl 1308.90209
Letchford, Adam N.;Sørensen, Michael M.
2014
An aggressive reduction scheme for the simple plant location problem. Zbl 1304.90123
Letchford, Adam N.;Miller, Sebastian J.
2014
A compact variant of the QCR method for quadratically constrained quadratic \(0-1\) programs. Zbl 1292.90206
Galli, Laura;Letchford, Adam N.
2014
Unbounded convex sets for non-convex mixed-integer quadratic programming. Zbl 1291.90146
Burer, Samuel;Letchford, Adam N.
2014
Compact formulations of the Steiner traveling salesman problem and related problems. Zbl 1332.90329
Letchford, Adam N.;Nasiri, Saeideh D.;Theis, Dirk Oliver
2013
A polyhedral approach to the single row facility layout problem. Zbl 1280.90132
Amaral, André R. S.;Letchford, Adam N.
2013
Binary positive semidefinite matrices and associated integer polytopes. Zbl 1235.90113
Letchford, Adam N.;Sørensen, Michael M.
2012
Fast bounding procedures for large instances of the simple plant location problem. Zbl 1251.90243
Letchford, Adam N.;Miller, Sebastian J.
2012
Gap inequalities for the max-cut problem: a cutting-plane algorithm. Zbl 1370.90214
Galli, Laura;Kaparis, Konstantinos;Letchford, Adam N.
2012
Complexity results for the gap inequalities for the max-cut problem. Zbl 1245.90101
Galli, Laura;Kaparis, Konstantinos;Letchford, Adam N.
2012
Decorous lower bounds for minimum linear arrangement. Zbl 1243.90185
Caprara, Alberto;Letchford, Adam N.;Salazar-González, Juan-José
2011
Gap inequalities for non-convex mixed-integer quadratic programs. Zbl 1235.90102
Galli, Laura;Kaparis, Konstantinos;Letchford, Adam N.
2011
A new approach to the stable set problem based on ellipsoids. Zbl 1341.90098
Giandomenico, Monia;Letchford, Adam N.;Rossi, Fabrizio;Smriglio, Stefano
2011
On the membership problem for the \({0, 1/2}\)-closure. Zbl 1235.90094
Letchford, Adam N.;Pokutta, Sebastian;Schulz, Andreas S.
2011
Generalized network design polyhedra. Zbl 1233.90066
Feremans, Corinne;Labbé, Martine;Letchford, Adam N.;Salazar-González, Juan-José
2011
Separation algorithms for 0-1 knapsack polytopes. Zbl 1198.90297
Kaparis, Konstantinos;Letchford, Adam N.
2010
New techniques for cost sharing in combinatorial optimization games. Zbl 1194.91036
Caprara, Alberto;Letchford, Adam N.
2010
Integer quadratic quasi-polyhedra. Zbl 1285.90066
Letchford, Adam N.
2010
Lower bounds for the minimum linear arrangement of a graph. Zbl 1274.90449
Caprara, Alberto;Letchford, Adam N.;Salazar-González, Juan-José
2010
On a class of metrics related to graph layout problems. Zbl 1222.05036
Letchford, Adam N.;Reinelt, Gerhard;Seitz, Hanna;Theis, Dirk Oliver
2010
Small bipartite subgraph polytopes. Zbl 1231.05221
Galli, Laura;Letchford, Adam N.
2010
On nonconvex quadratic programming with box constraints. Zbl 1201.90146
Burer, Samuel;Letchford, Adam N.
2009
Exploiting sparsity in pricing routines for the capacitated arc routing problem. Zbl 1158.90321
Letchford, Adam N.;Oukil, Amar
2009
An application of the Lovász-Schrijver \(M(K, K)\) operator to the stable set problem. Zbl 1176.90494
Giandomenico, Monia;Letchford, Adam N.;Rossi, Fabrizio;Smriglio, Stefano
2009
Odd minimum cut sets and \(b\)-matchings revisited. Zbl 1178.90290
Letchford, Adam N.;Reinelt, Gerhard;Theis, Dirk Oliver
2008
Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem. Zbl 1138.90016
Kaparis, Konstantinos;Letchford, Adam N.
2008
Good triangulations yield good tours. Zbl 1141.90032
Letchford, Adam N.;Pearson, Nicholas A.
2008
A new lower bound for the minimum linear arrangement of a graph. Zbl 1341.05236
Amaral, André R. S.;Caprara, Alberto;Letchford, Adam N.;Salazar-Gonzalez, Juan-José
2008
Binary positive semidefinite matrices and associated integer polytopes. Zbl 1143.90370
Letchford, Adam N.;Sørensen, Michael M.
2008
Exploiting planarity in separation routines for the symmetric traveling salesman problem. Zbl 1151.90039
Letchford, Adam N.;Pearson, Nicholas A.
2008
Projection results for vehicle routing. Zbl 1085.90032
Letchford, Adam N.;Salazar-González, Juan-José
2006
Exploring the relationship between max-cut and stable set relaxations. Zbl 1134.90519
Giandomenico, Monia;Letchford, Adam N.
2006
Polynomial-time separation of a superclass of simple comb inequalities. Zbl 1278.90337
Fleischer, Lisa K.;Letchford, Adam N.;Lodi, Andrea
2006
A fast algorithm for minimum weight odd circuits and cuts in planar graphs. Zbl 1080.05091
Letchford, Adam N.;Pearson, Nicholas A.
2005
A new branch-and-cut algorithm for the capacitated vehicle routing problem. Zbl 1073.90068
Lysgaard, Jens;Letchford, Adam N.;Eglese, Richard W.
2004
A faster exact separation algorithm for blossom inequalities. Zbl 1092.90542
Letchford, Adam N.;Reinelt, Gerhard;Theis, Dirk Oliver
2004
On the separation of split cuts and related inequalities. Zbl 1030.90095
Caprara, Alberto;Letchford, Adam N.
2003
Binary clutter inequalities for integer programs. Zbl 1082.90069
Letchford, Adam N.
2003
An augment-and-branch-and-cut framework for mixed 0-1 programming. Zbl 1024.90506
Letchford, Adam N.;Lodi, Andrea
2003
Primal separation algorithms. Zbl 1102.90074
Letchford, Adam N.;Lodi, Andrea
2003
Multistars, partial multistars and the capacitated vehicle routing problem. Zbl 1023.90073
Letchford, Adam N.;Eglese, Richard W.;Lysgaard, Jens
2002
Strengthening Chvátal-Gomory cuts and Gomory fractional cuts. Zbl 1027.90062
Letchford, Adam N.;Lodi, Andrea
2002
Primal cutting plane algorithms revisited. Zbl 1023.90087
Letchford, Adam N.;Lodi, Andrea
2002
Totally tight Chvatal-Gomory cuts. Zbl 1027.90061
Letchford, Adam N.
2002
Polynomial-time separation of simple comb inequalities. Zbl 1049.90046
Letchford, Adam N.;Lodi, Andrea
2002
A cutting plane algorithm for the general routing problem. Zbl 0989.90026
Corberán, Angel;Letchford, Adam N.;Sanchis, José María
2001
On disjunctive cuts for combinatorial optimization. Zbl 1078.90039
Letchford, Adam N.
2001
Analysis of upper bounds for the pallet loading problem. Zbl 1054.90062
Letchford, Adam N.;Amaral, André
2001
On the separation of maximally violated mod-\(k\) cuts. Zbl 0959.90035
Caprara, Alberto;Fischetti, Matteo;Letchford, Adam N.
2000
Polyhedral theory for arc routing problems. Zbl 0970.90071
Eglese, Richard W.;Letchford, Adam N.
2000
Separating a superclass of comb inequalities in planar graphs. Zbl 0977.90075
Letchford, Adam N.
2000
The general routing polyhedron: A unifying framework. Zbl 0937.90008
Letchford, Adam N.
1999
On the separation of maximally violated mod-\(k\) cuts. Zbl 0955.90094
Caprara, Alberto;Fischetti, Matteo;Letchford, Adam N.
1999
The rural postman problem with deadline classes. Zbl 0955.90111
Letchford, A. N.;Eglese, R. W.
1998
New inequalities for the general routing problem. Zbl 0924.90127
Letchford, Adam N.
1997
Allocation of school bus contracts by integer programming. Zbl 0852.90097
Letchford, Adam N.
1996
alltop 5

Cited by 1,156 Authors

57 Letchford, Adam N.
17 Corberán, Angel
17 Uchoa, Eduardo
16 Sanchis, José María
13 Reinelt, Gerhard
13 Salazar-González, Juan-José
12 Dey, Santanu Subhas
12 Lodi, Andrea
12 Plana, Isaac
11 Desaulniers, Guy
11 Pessoa, Artur Alves
10 Cordeau, Jean-François
10 Gendreau, Michel
9 Baldacci, Roberto
9 Coelho, Leandro C.
9 Del Pia, Alberto
9 Gouveia, Luis
9 Iori, Manuel
9 Lysgaard, Jens
8 Laporte, Gilbert
7 Amaral, André R. S.
7 Anjos, Miguel F.
7 Fischetti, Matteo
7 Galli, Laura
7 Kaparis, Konstantinos
7 Theis, Dirk Oliver
6 Benavent, Enrique
6 Côté, Jean-François
6 Elhallaoui, Issmail
6 Fukasawa, Ricardo
6 Hildebrand, Robert
6 Jans, Raf
6 Laganà, Demetrio
6 Ljubić, Ivana
6 Rossi, Fabrizio
6 Sinnl, Markus
6 Smriglio, Stefano
5 Burer, Samuel
5 Chen, Weikun
5 Contardo, Claudio
5 Dai, Yu-Hong
5 Dash, Sanjeeb
5 de Aragão, Marcus Poggi
5 Gounaris, Chrysanthos E.
5 Hungerländer, Philipp
5 Irnich, Stefan
5 Linderoth, Jeff T.
5 Martello, Silvano
5 Martinelli, Rafael
5 Oswald, Marcus
5 Pecin, Diego
5 Poggi, Marcus
5 Puerto Albandoz, Justo
5 Quilliot, Alain
5 Speranza, Maria Grazia
5 Subramanian, Anand Prabhu
4 Absi, Nabil
4 Anstreicher, Kurt M.
4 Archetti, Claudia
4 Bektas, Tolga
4 Ben Ticha, Hamza
4 Bienstock, Daniel
4 Boyacı, Burak
4 Buchheim, Christoph
4 Chen, Liang
4 Cornuéjols, Gérard P.
4 Eglese, Richard W.
4 Feillet, Dominique
4 Fernández, Elena
4 Fomeni, Franklin Djeumou
4 Fryzlewicz, Piotr
4 Gendron, Bernard
4 Giandomenico, Monia
4 Goycoolea, Marcos
4 Günlük, Oktay
4 Hoshino, Edna Ayako
4 Koster, Arie M. C. A.
4 Mingozzi, Aristide
4 Porumbel, Daniel Cosmin
4 Richard, Jean-Philippe Pascal
4 Sadykov, Ruslan
4 Seitz, Hanna
4 Souli, Georgia
4 Subramanyam, Anirudh
4 Toth, Paolo
4 Vasil’ev, Igor’ Leonidovich
4 Vidal, Thibaut
4 Vielma, Juan Pablo
4 Vigo, Daniele
4 Walter, Matthias
4 Yaman, Hande
4 Zhu, Haoran
3 Agarwal, Yogesh Kumar
3 Agra, Agostinho
3 Ali, Montaz M.
3 Álvarez-Miranda, Eduardo
3 Alves, Cláudio
3 Balas, Egon
3 Basu, Amitabh
3 Beasley, John E.
...and 1,056 more Authors
alltop 5

Cited in 76 Serials

135 European Journal of Operational Research
83 Computers & Operations Research
66 Mathematical Programming. Series A. Series B
36 Operations Research Letters
35 Discrete Optimization
30 Networks
26 INFORMS Journal on Computing
25 Discrete Applied Mathematics
17 International Transactions in Operational Research
17 Optimization Letters
15 Annals of Operations Research
15 Mathematical Programming Computation
13 Journal of Global Optimization
13 EURO Journal on Computational Optimization
10 Operations Research
10 SIAM Journal on Optimization
8 Computational Optimization and Applications
8 4OR
7 Top
5 Mathematical Methods of Operations Research
5 RAIRO. Operations Research
5 OR Spectrum
5 SN Operations Research Forum
4 Optimization Methods & Software
4 Journal of Combinatorial Optimization
4 INFOR: Information Systems and Operational Research
3 Applied Mathematics and Computation
3 Journal of Optimization Theory and Applications
3 Optimization
3 Soft Computing
3 CEJOR. Central European Journal of Operations Research
3 Computational Management Science
3 Electronic Journal of Statistics
2 Naval Research Logistics
2 Opsearch
2 European Journal of Combinatorics
2 Graphs and Combinatorics
2 SIAM Journal on Discrete Mathematics
2 Journal of Mathematical Sciences (New York)
2 Optimization and Engineering
2 Journal of Industrial and Management Optimization
1 Discrete Mathematics
1 Information Processing Letters
1 Metrika
1 Physica A
1 INFOR
1 Information Sciences
1 Journal of the American Statistical Association
1 Journal of Combinatorial Theory. Series B
1 Journal of Economic Theory
1 Journal of Econometrics
1 Mathematics of Operations Research
1 Numerische Mathematik
1 Technometrics
1 Combinatorica
1 International Journal of Production Research
1 Journal of Computational Mathematics
1 Algorithmica
1 Japan Journal of Industrial and Applied Mathematics
1 International Journal of Computational Geometry & Applications
1 Games and Economic Behavior
1 Communications in Statistics. Simulation and Computation
1 Linear Algebra and its Applications
1 Journal of Computer and Systems Sciences International
1 Statistical Papers
1 Numerical Linear Algebra with Applications
1 Journal of Heuristics
1 Journal of the Royal Statistical Society. Series B. Statistical Methodology
1 Trudy Instituta Matematiki
1 International Game Theory Review
1 Quantum Information Processing
1 The International Journal of Biostatistics
1 Science China. Mathematics
1 Statistics and Computing
1 Stat
1 CGT. Computing in Geometry and Topology

Citations by Year

The data are displayed as stored in Wikidata under aCreative Commons CC0 License. Updates and corrections should be madein Wikidata.
© 2025FIZ Karlsruhe GmbHPrivacy PolicyLegal NoticesTerms & Conditions
  • Mastodon logo
 (opens in new tab)
[8]ページ先頭
©2009-2025 Movatter.jp