default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Adam N. Letchford
@article{DBLP:journals/orl/LetchfordS25,
author = {Adam N. Letchford and
Michael Malmros S{\o}rensen},
title = {New facets of the clique partitioning polytope},
journal = {Oper. Res. Lett.},
volume = {59},
pages = {107242},
year = {2025},
url = {https://doi.org/10.1016/j.orl.2025.107242},
doi = {10.1016/J.ORL.2025.107242},
timestamp = {Sat, 31 May 2025 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/LetchfordS25.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jors/PetropoulosLAAAABBBBBCCCCCCDDDEEEF24,
author = {Fotios Petropoulos and
Gilbert Laporte and
Emel Aktas and
Sibel A. Alumur and
Claudia Archetti and
Hayriye Ayhan and
Maria Battarra and
Julia A. Bennell and
Jean{-}Marie Bourjolly and
John E. Boylan and
Mich{\`{e}}le Breton and
David Canca and
Laurent Charlin and
Bo Chen and
Cihan Tugrul Cicek and
Louis Anthony Cox and
Christine S. M. Currie and
Erik Demeulemeester and
Li Ding and
Stephen M. Disney and
Matthias Ehrgott and
Martin J. Eppler and
G{\"{u}}nes Erdogan and
Bernard Fortz and
L. Alberto Franco and
Jens Frische and
Salvatore Greco and
Amanda J. Gregory and
Raimo P. H{\"{a}}m{\"{a}}l{\"{a}}inen and
Willy Herroelen and
Mike Hewitt and
Jan Holmstr{\"{o}}m and
John N. Hooker and
Tug{\c{c}}e Isik and
Jill Johnes and
Bahar Yetis Kara and
{\"{O}}zlem Karsu and
Katherine Kent and
Charlotte K{\"{o}}hler and
Martin H. Kunc and
Yong{-}Hong Kuo and
Adam N. Letchford and
Janny Leung and
Dong Li and
Haitao Li and
Judit Lienert and
Ivana Ljubic and
Andrea Lodi and
Sebasti{\'{a}}n Lozano and
Virginie Lurkin and
Silvano Martello and
Ian G. McHale and
Gerald Midgley and
John D. W. Morecroft and
Akshay Mutha and
Ceyda Oguz and
Sanja Petrovic and
Ulrich Pferschy and
Harilaos N. Psaraftis and
Sam Rose and
Lauri Saarinen and
Sa{\"{\i}}d Salhi and
Jing{-}Sheng Song and
Dimitrios Sotiros and
Kathryn E. Stecke and
Arne K. Strauss and
Isten{\c{c}} Tarhan and
Clemens Thielen and
Paolo Toth and
Tom Van Woensel and
Greet Vanden Berghe and
Christos Vasilakis and
Vikrant Vaze and
Daniele Vigo and
Kai Virtanen and
Xun Wang and
Rafal Weron and
Leroy White and
Mike Yearworth and
E. Alper Yildirim and
Georges Zaccour and
Xuying Zhao},
title = {Operational Research: methods and applications},
journal = {J. Oper. Res. Soc.},
volume = {75},
number = {3},
pages = {423--617},
year = {2024},
url = {https://doi.org/10.1080/01605682.2023.2253852},
doi = {10.1080/01605682.2023.2253852},
timestamp = {Thu, 01 May 2025 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jors/PetropoulosLAAAABBBBBCCCCCCDDDEEEF24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mpc/SorensenL24,
author = {Michael Malmros S{\o}rensen and
Adam N. Letchford},
title = {CP-Lib: Benchmark Instances of the Clique Partitioning Problem},
journal = {Math. Program. Comput.},
volume = {16},
number = {1},
pages = {93--111},
year = {2024},
url = {https://doi.org/10.1007/s12532-023-00249-1},
doi = {10.1007/S12532-023-00249-1},
timestamp = {Fri, 22 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mpc/SorensenL24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/GalliL24,
author = {Laura Galli and
Adam N. Letchford},
title = {On upper bounds for the multiple knapsack assignment problem},
journal = {Oper. Res. Lett.},
volume = {54},
pages = {107104},
year = {2024},
url = {https://doi.org/10.1016/j.orl.2024.107104},
doi = {10.1016/J.ORL.2024.107104},
timestamp = {Fri, 19 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/GalliL24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/LetchfordC24,
author = {Adam N. Letchford and
Licong Cheng},
title = {On a variant of the change-making problem},
journal = {Oper. Res. Lett.},
volume = {57},
pages = {107165},
year = {2024},
url = {https://doi.org/10.1016/j.orl.2024.107165},
doi = {10.1016/J.ORL.2024.107165},
timestamp = {Mon, 09 Dec 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/LetchfordC24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/GelvezDL23,
author = {Sebastian C{\'{a}}ceres Gelvez and
Thu Huong Dang and
Adam N. Letchford},
title = {On some lower bounds for the permutation flowshop problem},
journal = {Comput. Oper. Res.},
volume = {159},
pages = {106320},
year = {2023},
url = {https://doi.org/10.1016/j.cor.2023.106320},
doi = {10.1016/J.COR.2023.106320},
timestamp = {Sat, 31 May 2025 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cor/GelvezDL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/KaparisLM23,
author = {Konstantinos Kaparis and
Adam N. Letchford and
Ioannis Mourtos},
title = {On cut polytopes and graph minors},
journal = {Discret. Optim.},
volume = {50},
pages = {100807},
year = {2023},
url = {https://doi.org/10.1016/j.disopt.2023.100807},
doi = {10.1016/J.DISOPT.2023.100807},
timestamp = {Sat, 13 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/KaparisLM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/itor/BoschettiLM23,
author = {Marco A. Boschetti and
Adam N. Letchford and
Vittorio Maniezzo},
title = {Matheuristics: survey and synthesis},
journal = {Int. Trans. Oper. Res.},
volume = {30},
number = {6},
pages = {2840--2866},
year = {2023},
url = {https://doi.org/10.1111/itor.13301},
doi = {10.1111/ITOR.13301},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/itor/BoschettiLM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BoyaciDL23,
author = {Burak Boyaci and
Thu Huong Dang and
Adam N. Letchford},
title = {Improving a constructive heuristic for the general routing problem},
journal = {Networks},
volume = {81},
number = {1},
pages = {93--106},
year = {2023},
url = {https://doi.org/10.1002/net.22119},
doi = {10.1002/NET.22119},
timestamp = {Sat, 31 May 2025 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BoyaciDL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BoyaciDL23a,
author = {Burak Boyaci and
Thu Huong Dang and
Adam N. Letchford},
title = {Fast upper and lower bounds for a large-scale real-world arc routing
problem},
journal = {Networks},
volume = {81},
number = {1},
pages = {107--124},
year = {2023},
url = {https://doi.org/10.1002/net.22120},
doi = {10.1002/NET.22120},
timestamp = {Sat, 31 May 2025 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BoyaciDL23a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/CruzMejiaL23,
author = {Oliverio Cruz{-}Mejia and
Adam N. Letchford},
title = {A survey on exact algorithms for the maximum flow and minimum-cost
flow problems},
journal = {Networks},
volume = {82},
number = {2},
pages = {167--176},
year = {2023},
url = {https://doi.org/10.1002/net.22169},
doi = {10.1002/NET.22169},
timestamp = {Sat, 08 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/CruzMejiaL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/FomeniKL22,
author = {Franklin Djeumou Fomeni and
Konstantinos Kaparis and
Adam N. Letchford},
title = {A cut-and-branch algorithm for the Quadratic Knapsack Problem},
journal = {Discret. Optim.},
volume = {44},
number = {Part},
pages = {100579},
year = {2022},
url = {https://doi.org/10.1016/j.disopt.2020.100579},
doi = {10.1016/J.DISOPT.2020.100579},
timestamp = {Fri, 03 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/disopt/FomeniKL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/LiuLS22,
author = {Congzheng Liu and
Adam N. Letchford and
Ivan Svetunkov},
title = {Newsvendor problems: An integrated method for estimation and optimisation},
journal = {Eur. J. Oper. Res.},
volume = {300},
number = {2},
pages = {590--601},
year = {2022},
url = {https://doi.org/10.1016/j.ejor.2021.08.013},
doi = {10.1016/J.EJOR.2021.08.013},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eor/LiuLS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BoyaciDL22,
author = {Burak Boyaci and
Thu Huong Dang and
Adam N. Letchford},
title = {On matchings, T-joins, and arc routing in road networks},
journal = {Networks},
volume = {79},
number = {1},
pages = {20--31},
year = {2022},
url = {https://doi.org/10.1002/net.22033},
doi = {10.1002/NET.22033},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BoyaciDL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/KaparisLM22,
author = {Konstantinos Kaparis and
Adam N. Letchford and
Ioannis Mourtos},
title = {Generalised 2-circulant inequalities for the max-cut problem},
journal = {Oper. Res. Lett.},
volume = {50},
number = {2},
pages = {122--128},
year = {2022},
url = {https://doi.org/10.1016/j.orl.2022.01.005},
doi = {10.1016/J.ORL.2022.01.005},
timestamp = {Fri, 01 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/KaparisLM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/DokkaLM22,
author = {Trivikram Dokka and
Adam N. Letchford and
M. Hasan Mansoor},
title = {Revisiting surrogate relaxation for the multidimensional knapsack
problem},
journal = {Oper. Res. Lett.},
volume = {50},
number = {6},
pages = {674--678},
year = {2022},
url = {https://doi.org/10.1016/j.orl.2022.10.003},
doi = {10.1016/J.ORL.2022.10.003},
timestamp = {Mon, 03 Mar 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/DokkaLM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/BoyaciDL21,
author = {Burak Boyaci and
Thu Huong Dang and
Adam N. Letchford},
title = {Vehicle routing on road networks: How good is Euclidean approximation?},
journal = {Comput. Oper. Res.},
volume = {129},
pages = {105197},
year = {2021},
url = {https://doi.org/10.1016/j.cor.2020.105197},
doi = {10.1016/J.COR.2020.105197},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cor/BoyaciDL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/GalliL21,
author = {Laura Galli and
Adam N. Letchford},
title = {Valid inequalities for quadratic optimisation with domain constraints},
journal = {Discret. Optim.},
volume = {41},
pages = {100661},
year = {2021},
url = {https://doi.org/10.1016/j.disopt.2021.100661},
doi = {10.1016/J.DISOPT.2021.100661},
timestamp = {Wed, 01 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/disopt/GalliL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/LetchfordV21,
author = {Adam N. Letchford and
Anh N. Vu},
title = {Facets from gadgets},
journal = {Math. Program.},
volume = {185},
number = {1-2},
pages = {297--314},
year = {2021},
url = {https://doi.org/10.1007/s10107-019-01430-y},
doi = {10.1007/S10107-019-01430-Y},
timestamp = {Sun, 19 Jan 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/LetchfordV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/LetchfordNZ21,
author = {Adam N. Letchford and
Qiang Ni and
Zhaoyu Zhong},
title = {Bi-perspective functions for mixed-integer fractional programs with
indicator variables},
journal = {Math. Program.},
volume = {190},
number = {1},
pages = {39--55},
year = {2021},
url = {https://doi.org/10.1007/s10107-020-01519-9},
doi = {10.1007/S10107-020-01519-9},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/LetchfordNZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/DokkaLM21,
author = {Trivikram Dokka and
Adam N. Letchford and
M. Hasan Mansoor},
title = {On the complexity of surrogate and group relaxation for integer linear
programs},
journal = {Oper. Res. Lett.},
volume = {49},
number = {4},
pages = {530--534},
year = {2021},
url = {https://doi.org/10.1016/j.orl.2021.05.011},
doi = {10.1016/J.ORL.2021.05.011},
timestamp = {Mon, 03 Mar 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/DokkaLM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/LetchfordV21,
author = {Adam N. Letchford and
Paolo Ventura},
title = {Strengthened clique-family inequalities for the stable set polytope},
journal = {Oper. Res. Lett.},
volume = {49},
number = {4},
pages = {586--589},
year = {2021},
url = {https://doi.org/10.1016/j.orl.2021.06.008},
doi = {10.1016/J.ORL.2021.06.008},
timestamp = {Thu, 29 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/LetchfordV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/GalliL21,
author = {Laura Galli and
Adam N. Letchford},
title = {A separation algorithm for the simple plant location problem},
journal = {Oper. Res. Lett.},
volume = {49},
number = {4},
pages = {610--615},
year = {2021},
url = {https://doi.org/10.1016/j.orl.2021.06.011},
doi = {10.1016/J.ORL.2021.06.011},
timestamp = {Thu, 29 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/GalliL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/BektasL20,
author = {Tolga Bektas and
Adam N. Letchford},
title = {Using {\(\mathscr{l}\)}\({}^{\mbox{\emph{p}}}\)-norms for fairness
in combinatorial optimisation},
journal = {Comput. Oper. Res.},
volume = {120},
pages = {104975},
year = {2020},
url = {https://doi.org/10.1016/j.cor.2020.104975},
doi = {10.1016/J.COR.2020.104975},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cor/BektasL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/LetchfordRS20,
author = {Adam N. Letchford and
Fabrizio Rossi and
Stefano Smriglio},
title = {The stable set problem: Clique and nodal inequalities revisited},
journal = {Comput. Oper. Res.},
volume = {123},
pages = {105024},
year = {2020},
url = {https://doi.org/10.1016/j.cor.2020.105024},
doi = {10.1016/J.COR.2020.105024},
timestamp = {Sat, 19 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cor/LetchfordRS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KaparisLM20,
author = {Konstantinos Kaparis and
Adam N. Letchford and
Ioannis Mourtos},
title = {On matroid parity and matching polytopes},
journal = {Discret. Appl. Math.},
volume = {284},
pages = {322--331},
year = {2020},
url = {https://doi.org/10.1016/j.dam.2020.03.049},
doi = {10.1016/J.DAM.2020.03.049},
timestamp = {Thu, 06 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/KaparisLM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/GrantLGSL20,
author = {James A. Grant and
David S. Leslie and
Kevin Glazebrook and
Roberto Szechtman and
Adam N. Letchford},
title = {Adaptive policies for perimeter surveillance problems},
journal = {Eur. J. Oper. Res.},
volume = {283},
number = {1},
pages = {265--278},
year = {2020},
url = {https://doi.org/10.1016/j.ejor.2019.11.004},
doi = {10.1016/J.EJOR.2019.11.004},
timestamp = {Sun, 19 Jan 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/GrantLGSL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/heuristics/LetchfordNZ20,
author = {Adam N. Letchford and
Qiang Ni and
Zhaoyu Zhong},
title = {A heuristic for fair dynamic resource allocation in overloaded {OFDMA}
systems},
journal = {J. Heuristics},
volume = {26},
number = {1},
pages = {21--32},
year = {2020},
url = {https://doi.org/10.1007/s10732-019-09422-z},
doi = {10.1007/S10732-019-09422-Z},
timestamp = {Sun, 19 Jan 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/heuristics/LetchfordNZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/LetchfordS20,
author = {Adam N. Letchford and
Georgia Souli},
title = {Valid inequalities for mixed-integer programmes with fixed charges
on sets of variables},
journal = {Oper. Res. Lett.},
volume = {48},
number = {3},
pages = {240--244},
year = {2020},
url = {https://doi.org/10.1016/j.orl.2020.03.004},
doi = {10.1016/J.ORL.2020.03.004},
timestamp = {Mon, 19 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/LetchfordS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/LetchfordS20a,
author = {Adam N. Letchford and
Georgia Souli},
title = {Lifting the knapsack cover inequalities for the knapsack polytope},
journal = {Oper. Res. Lett.},
volume = {48},
number = {5},
pages = {607--611},
year = {2020},
url = {https://doi.org/10.1016/j.orl.2020.07.010},
doi = {10.1016/J.ORL.2020.07.010},
timestamp = {Tue, 20 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/LetchfordS20a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/LetchfordG19,
author = {Adam N. Letchford and
Juan Jos{\'{e}} Salazar Gonz{\'{a}}lez},
title = {The Capacitated Vehicle Routing Problem: Stronger bounds in pseudo-polynomial
time},
journal = {Eur. J. Oper. Res.},
volume = {272},
number = {1},
pages = {24--31},
year = {2019},
url = {https://doi.org/10.1016/j.ejor.2018.06.002},
doi = {10.1016/J.EJOR.2018.06.002},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/LetchfordG19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/LetchfordS19,
author = {Adam N. Letchford and
Georgia Souli},
title = {On lifted cover inequalities: {A} new lifting procedure with unusual
properties},
journal = {Oper. Res. Lett.},
volume = {47},
number = {2},
pages = {83--87},
year = {2019},
url = {https://doi.org/10.1016/j.orl.2018.12.005},
doi = {10.1016/J.ORL.2018.12.005},
timestamp = {Sun, 19 Jan 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/LetchfordS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/LetchfordS19a,
author = {Adam N. Letchford and
Georgia Souli},
title = {New valid inequalities for the fixed-charge and single-node flow polytopes},
journal = {Oper. Res. Lett.},
volume = {47},
number = {5},
pages = {353--357},
year = {2019},
url = {https://doi.org/10.1016/j.orl.2019.06.005},
doi = {10.1016/J.ORL.2019.06.005},
timestamp = {Thu, 19 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/LetchfordS19a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/coap/FairbrotherLB18,
author = {Jamie Fairbrother and
Adam N. Letchford and
Keith Briggs},
title = {A two-level graph partitioning problem arising in mobile wireless
communications},
journal = {Comput. Optim. Appl.},
volume = {69},
number = {3},
pages = {653--676},
year = {2018},
url = {https://doi.org/10.1007/s10589-017-9967-9},
doi = {10.1007/S10589-017-9967-9},
timestamp = {Tue, 14 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/coap/FairbrotherLB18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/GalliLM18,
author = {Laura Galli and
Adam N. Letchford and
Sebastian J. Miller},
title = {New valid inequalities and facets for the Simple Plant Location Problem},
journal = {Eur. J. Oper. Res.},
volume = {269},
number = {3},
pages = {824--833},
year = {2018},
url = {https://doi.org/10.1016/j.ejor.2018.03.009},
doi = {10.1016/J.EJOR.2018.03.009},
timestamp = {Sun, 19 Jan 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/GalliLM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/KaparisL18,
author = {Konstantinos Kaparis and
Adam N. Letchford},
title = {A note on the 2-circulant inequalities for the max-cut problem},
journal = {Oper. Res. Lett.},
volume = {46},
number = {4},
pages = {443--447},
year = {2018},
url = {https://doi.org/10.1016/j.orl.2018.05.006},
doi = {10.1016/J.ORL.2018.05.006},
timestamp = {Sun, 19 Jan 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/KaparisL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/GalliL18,
author = {Laura Galli and
Adam N. Letchford},
title = {A binarisation heuristic for non-convex quadratic programming with
box constraints},
journal = {Oper. Res. Lett.},
volume = {46},
number = {5},
pages = {529--533},
year = {2018},
url = {https://doi.org/10.1016/j.orl.2018.08.005},
doi = {10.1016/J.ORL.2018.08.005},
timestamp = {Sun, 19 Jan 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/GalliL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rairo/LetchfordP18,
author = {Adam N. Letchford and
Andrew J. Parkes},
title = {A guide to conic optimisation and its applications},
journal = {{RAIRO} Oper. Res.},
volume = {52},
number = {4},
pages = {1087--1106},
year = {2018},
url = {https://doi.org/10.1051/ro/2018034},
doi = {10.1051/RO/2018034},
timestamp = {Wed, 02 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rairo/LetchfordP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iscopt/LetchfordNZ18,
author = {Adam N. Letchford and
Qiang Ni and
Zhaoyu Zhong},
editor = {Jon Lee and
Giovanni Rinaldi and
Ali Ridha Mahjoub},
title = {A Heuristic for Maximising Energy Efficiency in an {OFDMA} System
Subject to QoS Constraints},
booktitle = {Combinatorial Optimization - 5th International Symposium, {ISCO} 2018,
Marrakesh, Morocco, April 11-13, 2018, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {10856},
pages = {303--312},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-96151-4\_26},
doi = {10.1007/978-3-319-96151-4\_26},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iscopt/LetchfordNZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-02176,
author = {James A. Grant and
David S. Leslie and
Kevin Glazebrook and
Roberto Szechtman and
Adam N. Letchford},
title = {Adaptive Policies for Perimeter Surveillance Problems},
journal = {CoRR},
volume = {abs/1810.02176},
year = {2018},
url = {http://arxiv.org/abs/1810.02176},
eprinttype = {arXiv},
eprint = {1810.02176},
timestamp = {Sat, 31 May 2025 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1810-02176.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/coap/LetchfordNZ17,
author = {Adam N. Letchford and
Qiang Ni and
Zhaoyu Zhong},
title = {An exact algorithm for a resource allocation problem in mobile wireless
communications},
journal = {Comput. Optim. Appl.},
volume = {68},
number = {2},
pages = {193--208},
year = {2017},
url = {https://doi.org/10.1007/s10589-017-9914-9},
doi = {10.1007/S10589-017-9914-9},
timestamp = {Tue, 14 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/coap/LetchfordNZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/GalliL17,
author = {Laura Galli and
Adam N. Letchford},
title = {On the Lov{\'{a}}sz theta function and some variants},
journal = {Discret. Optim.},
volume = {25},
pages = {159--174},
year = {2017},
url = {https://doi.org/10.1016/j.disopt.2017.04.001},
doi = {10.1016/J.DISOPT.2017.04.001},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/GalliL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/FairbrotherL17,
author = {Jamie Fairbrother and
Adam N. Letchford},
title = {Projection results for the -partition problem},
journal = {Discret. Optim.},
volume = {26},
pages = {97--111},
year = {2017},
url = {https://doi.org/10.1016/j.disopt.2017.08.001},
doi = {10.1016/J.DISOPT.2017.08.001},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/FairbrotherL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/LetchfordG17,
author = {Adam N. Letchford and
Daniel John Grainger},
title = {A note on representations of linear inequalities in non-convex mixed-integer
quadratic programs},
journal = {Oper. Res. Lett.},
volume = {45},
number = {6},
pages = {631--634},
year = {2017},
url = {https://doi.org/10.1016/j.orl.2017.10.007},
doi = {10.1016/J.ORL.2017.10.007},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/LetchfordG17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FairbrotherLB17,
author = {Jamie Fairbrother and
Adam N. Letchford and
Keith Briggs},
title = {A Two-Level Graph Partitioning Problem Arising in Mobile Wireless
Communications},
journal = {CoRR},
volume = {abs/1705.08773},
year = {2017},
url = {http://arxiv.org/abs/1705.08773},
eprinttype = {arXiv},
eprint = {1705.08773},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FairbrotherLB17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/LetchfordG16,
author = {Adam N. Letchford and
Juan Jos{\'{e}} Salazar Gonz{\'{a}}lez},
title = {Stronger multi-commodity flow formulations of the (capacitated) sequential
ordering problem},
journal = {Eur. J. Oper. Res.},
volume = {251},
number = {1},
pages = {74--84},
year = {2016},
url = {https://doi.org/10.1016/j.ejor.2015.11.001},
doi = {10.1016/J.EJOR.2015.11.001},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/LetchfordG16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iscopt/LetchfordMRS16,
author = {Adam N. Letchford and
Francesca Marzi and
Fabrizio Rossi and
Stefano Smriglio},
editor = {Raffaele Cerulli and
Satoru Fujishige and
Ali Ridha Mahjoub},
title = {Strengthening Chv{\'{a}}tal-Gomory Cuts for the Stable Set Problem},
booktitle = {Combinatorial Optimization - 4th International Symposium, {ISCO} 2016,
Vietri sul Mare, Italy, May 16-18, 2016, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {9849},
pages = {201--212},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-45587-7\_18},
doi = {10.1007/978-3-319-45587-7\_18},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iscopt/LetchfordMRS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/LetchfordG15,
author = {Adam N. Letchford and
Juan Jos{\'{e}} Salazar Gonz{\'{a}}lez},
title = {Stronger multi-commodity flow formulations of the Capacitated Vehicle
Routing Problem},
journal = {Eur. J. Oper. Res.},
volume = {244},
number = {3},
pages = {730--738},
year = {2015},
url = {https://doi.org/10.1016/j.ejor.2015.02.028},
doi = {10.1016/J.EJOR.2015.02.028},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/LetchfordG15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/LetchfordN15,
author = {Adam N. Letchford and
Saeideh D. Nasiri},
title = {The Steiner travelling salesman problem with correlated costs},
journal = {Eur. J. Oper. Res.},
volume = {245},
number = {1},
pages = {62--69},
year = {2015},
url = {https://doi.org/10.1016/j.ejor.2015.02.044},
doi = {10.1016/J.EJOR.2015.02.044},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/LetchfordN15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/LetchfordLPS15,
author = {Adam N. Letchford and
Jean B. Lasserre and
Pablo A. Parrilo and
David Steurer},
title = {The 2013 Newton Institute Programme on polynomial optimization},
journal = {Math. Program.},
volume = {151},
number = {2},
pages = {375--377},
year = {2015},
url = {https://doi.org/10.1007/s10107-015-0886-1},
doi = {10.1007/S10107-015-0886-1},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/LetchfordLPS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/FomeniKL15,
author = {Franklin Djeumou Fomeni and
Konstantinos Kaparis and
Adam N. Letchford},
title = {Cutting planes for {RLT} relaxations of mixed 0-1 polynomial programs},
journal = {Math. Program.},
volume = {151},
number = {2},
pages = {639--658},
year = {2015},
url = {https://doi.org/10.1007/s10107-015-0863-8},
doi = {10.1007/S10107-015-0863-8},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/FomeniKL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamjo/GiandomenicoLRS15,
author = {Monia Giandomenico and
Adam N. Letchford and
Fabrizio Rossi and
Stefano Smriglio},
title = {Ellipsoidal Relaxations of the Stable Set Problem: Theory and Algorithms},
journal = {{SIAM} J. Optim.},
volume = {25},
number = {3},
pages = {1944--1963},
year = {2015},
url = {https://doi.org/10.1137/140966332},
doi = {10.1137/140966332},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamjo/GiandomenicoLRS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/LetchfordNO14,
author = {Adam N. Letchford and
Saeideh D. Nasiri and
Amar Oukil},
title = {Pricing routines for vehicle routing with time windows on road networks},
journal = {Comput. Oper. Res.},
volume = {51},
pages = {331--337},
year = {2014},
url = {https://doi.org/10.1016/j.cor.2014.06.022},
doi = {10.1016/J.COR.2014.06.022},
timestamp = {Tue, 18 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cor/LetchfordNO14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/LetchfordS14,
author = {Adam N. Letchford and
Michael Malmros S{\o}rensen},
title = {A new separation algorithm for the Boolean quadric and cut polytopes},
journal = {Discret. Optim.},
volume = {14},
pages = {61--71},
year = {2014},
url = {https://doi.org/10.1016/j.disopt.2014.07.002},
doi = {10.1016/J.DISOPT.2014.07.002},
timestamp = {Sat, 04 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/LetchfordS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/LetchfordM14,
author = {Adam N. Letchford and
Sebastian J. Miller},
title = {An aggressive reduction scheme for the simple plant location problem},
journal = {Eur. J. Oper. Res.},
volume = {234},
number = {3},
pages = {674--682},
year = {2014},
url = {https://doi.org/10.1016/j.ejor.2013.10.020},
doi = {10.1016/J.EJOR.2013.10.020},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/LetchfordM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/informs/FomeniL14,
author = {Franklin Djeumou Fomeni and
Adam N. Letchford},
title = {A Dynamic Programming Heuristic for the Quadratic Knapsack Problem},
journal = {{INFORMS} J. Comput.},
volume = {26},
number = {1},
pages = {173--182},
year = {2014},
url = {https://doi.org/10.1287/ijoc.2013.0555},
doi = {10.1287/IJOC.2013.0555},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/informs/FomeniL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/BurerL14,
author = {Samuel Burer and
Adam N. Letchford},
title = {Unbounded convex sets for non-convex mixed-integer quadratic programming},
journal = {Math. Program.},
volume = {143},
number = {1-2},
pages = {231--256},
year = {2014},
url = {https://doi.org/10.1007/s10107-012-0609-9},
doi = {10.1007/S10107-012-0609-9},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/BurerL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ol/GalliL14,
author = {Laura Galli and
Adam N. Letchford},
title = {A compact variant of the {QCR} method for quadratically constrained
quadratic 0-1 programs},
journal = {Optim. Lett.},
volume = {8},
number = {4},
pages = {1213--1224},
year = {2014},
url = {https://doi.org/10.1007/s11590-013-0676-8},
doi = {10.1007/S11590-013-0676-8},
timestamp = {Fri, 03 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ol/GalliL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamjo/AlievL14,
author = {Iskander Aliev and
Adam N. Letchford},
title = {Iterated Chv{\'{a}}tal-Gomory Cuts and the Geometry of Numbers},
journal = {{SIAM} J. Optim.},
volume = {24},
number = {3},
pages = {1294--1312},
year = {2014},
url = {https://doi.org/10.1137/130926389},
doi = {10.1137/130926389},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamjo/AlievL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/GiandomenicoLRS13,
author = {Monia Giandomenico and
Adam N. Letchford and
Fabrizio Rossi and
Stefano Smriglio},
title = {Approximating the Lov{\'{a}}sz {\texttheta} Function with the
Subgradient Method},
journal = {Electron. Notes Discret. Math.},
volume = {41},
pages = {157--164},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.05.088},
doi = {10.1016/J.ENDM.2013.05.088},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/GiandomenicoLRS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/LetchfordNT13,
author = {Adam N. Letchford and
Saeideh D. Nasiri and
Dirk Oliver Theis},
title = {Compact formulations of the Steiner Traveling Salesman Problem and
related problems},
journal = {Eur. J. Oper. Res.},
volume = {228},
number = {1},
pages = {83--92},
year = {2013},
url = {https://doi.org/10.1016/j.ejor.2013.01.044},
doi = {10.1016/J.EJOR.2013.01.044},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/LetchfordNT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/AmaralL13,
author = {Andr{\'{e}} Renato Sales Amaral and
Adam N. Letchford},
title = {A polyhedral approach to the single row facility layout problem},
journal = {Math. Program.},
volume = {141},
number = {1-2},
pages = {453--477},
year = {2013},
url = {https://doi.org/10.1007/s10107-012-0533-z},
doi = {10.1007/S10107-012-0533-Z},
timestamp = {Mon, 12 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/AmaralL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/LetchfordM12,
author = {Adam N. Letchford and
Sebastian J. Miller},
title = {Fast bounding procedures for large instances of the Simple Plant Location
Problem},
journal = {Comput. Oper. Res.},
volume = {39},
number = {5},
pages = {985--990},
year = {2012},
url = {https://doi.org/10.1016/j.cor.2011.06.014},
doi = {10.1016/J.COR.2011.06.014},
timestamp = {Tue, 18 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cor/LetchfordM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/LetchfordS12,
author = {Adam N. Letchford and
Michael Malmros S{\o}rensen},
title = {Binary positive semidefinite matrices and associated integer polytopes},
journal = {Math. Program.},
volume = {131},
number = {1-2},
pages = {253--271},
year = {2012},
url = {https://doi.org/10.1007/s10107-010-0352-z},
doi = {10.1007/S10107-010-0352-Z},
timestamp = {Sat, 04 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/LetchfordS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/GalliKL12,
author = {Laura Galli and
Konstantinos Kaparis and
Adam N. Letchford},
title = {Complexity results for the gap inequalities for the max-cut problem},
journal = {Oper. Res. Lett.},
volume = {40},
number = {3},
pages = {149--152},
year = {2012},
url = {https://doi.org/10.1016/j.orl.2012.01.010},
doi = {10.1016/J.ORL.2012.01.010},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/GalliKL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iscopt/GalliKL12,
author = {Laura Galli and
Konstantinos Kaparis and
Adam N. Letchford},
editor = {Ali Ridha Mahjoub and
Vangelis Markakis and
Ioannis Milis and
Vangelis Th. Paschos},
title = {Gap Inequalities for the Max-Cut Problem: {A} Cutting-Plane Algorithm},
booktitle = {Combinatorial Optimization - Second International Symposium, {ISCO}
2012, Athens, Greece, April 19-21, 2012, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {7422},
pages = {178--188},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-32147-4\_17},
doi = {10.1007/978-3-642-32147-4\_17},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/iscopt/GalliKL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1203-3854,
author = {Adam N. Letchford and
Saeideh D. Nasiri and
Dirk Oliver Theis},
title = {Compact Formulations of the Steiner Traveling Salesman Problem and
Related Problems},
journal = {CoRR},
volume = {abs/1203.3854},
year = {2012},
url = {http://arxiv.org/abs/1203.3854},
eprinttype = {arXiv},
eprint = {1203.3854},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1203-3854.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/informs/CapraraLG11,
author = {Alberto Caprara and
Adam N. Letchford and
Juan Jos{\'{e}} Salazar Gonz{\'{a}}lez},
title = {Decorous Lower Bounds for Minimum Linear Arrangement},
journal = {{INFORMS} J. Comput.},
volume = {23},
number = {1},
pages = {26--40},
year = {2011},
url = {https://doi.org/10.1287/ijoc.1100.0390},
doi = {10.1287/IJOC.1100.0390},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/informs/CapraraLG11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mpc/FortiniLLW11,
author = {Matteo Fortini and
Adam N. Letchford and
Andrea Lodi and
Klaus Michael Wenger},
title = {Computing compatible tours for the symmetric traveling salesman problem},
journal = {Math. Program. Comput.},
volume = {3},
number = {1},
pages = {59--78},
year = {2011},
url = {https://doi.org/10.1007/s12532-010-0021-5},
doi = {10.1007/S12532-010-0021-5},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mpc/FortiniLLW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/FeremansLLG11,
author = {Corinne Feremans and
Martine Labb{\'{e}} and
Adam N. Letchford and
Juan Jos{\'{e}} Salazar Gonz{\'{a}}lez},
title = {Generalized network design polyhedra},
journal = {Networks},
volume = {58},
number = {2},
pages = {125--136},
year = {2011},
url = {https://doi.org/10.1002/net.20455},
doi = {10.1002/NET.20455},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/FeremansLLG11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/GalliKL11,
author = {Laura Galli and
Konstantinos Kaparis and
Adam N. Letchford},
title = {Gap inequalities for non-convex mixed-integer quadratic programs},
journal = {Oper. Res. Lett.},
volume = {39},
number = {5},
pages = {297--300},
year = {2011},
url = {https://doi.org/10.1016/j.orl.2011.07.002},
doi = {10.1016/J.ORL.2011.07.002},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/GalliKL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/LetchfordPS11,
author = {Adam N. Letchford and
Sebastian Pokutta and
Andreas S. Schulz},
title = {On the membership problem for the \{0, 1/2\}-closure},
journal = {Oper. Res. Lett.},
volume = {39},
number = {5},
pages = {301--304},
year = {2011},
url = {https://doi.org/10.1016/j.orl.2011.07.003},
doi = {10.1016/J.ORL.2011.07.003},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/LetchfordPS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/GiandomenicoLRS11,
author = {Monia Giandomenico and
Adam N. Letchford and
Fabrizio Rossi and
Stefano Smriglio},
editor = {Oktay G{\"{u}}nl{\"{u}}k and
Gerhard J. Woeginger},
title = {A New Approach to the Stable Set Problem Based on Ellipsoids},
booktitle = {Integer Programming and Combinatoral Optimization - 15th International
Conference, {IPCO} 2011, New York, NY, USA, June 15-17, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6655},
pages = {223--234},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-20807-2\_18},
doi = {10.1007/978-3-642-20807-2\_18},
timestamp = {Tue, 29 Dec 2020 18:40:14 +0100},
biburl = {https://dblp.org/rec/conf/ipco/GiandomenicoLRS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/CapraraLG10,
author = {Alberto Caprara and
Adam N. Letchford and
Juan Jos{\'{e}} Salazar Gonz{\'{a}}lez},
title = {Lower Bounds for the Minimum Linear Arrangement of a Graph},
journal = {Electron. Notes Discret. Math.},
volume = {36},
pages = {843--849},
year = {2010},
url = {https://doi.org/10.1016/j.endm.2010.05.107},
doi = {10.1016/J.ENDM.2010.05.107},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/CapraraLG10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/KaparisL10,
author = {Konstantinos Kaparis and
Adam N. Letchford},
title = {Separation algorithms for 0-1 knapsack polytopes},
journal = {Math. Program.},
volume = {124},
number = {1-2},
pages = {69--91},
year = {2010},
url = {https://doi.org/10.1007/s10107-010-0359-5},
doi = {10.1007/S10107-010-0359-5},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/KaparisL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/CapraraL10,
author = {Alberto Caprara and
Adam N. Letchford},
title = {New techniques for cost sharing in combinatorial optimization games},
journal = {Math. Program.},
volume = {124},
number = {1-2},
pages = {93--118},
year = {2010},
url = {https://doi.org/10.1007/s10107-010-0357-7},
doi = {10.1007/S10107-010-0357-7},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/CapraraL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/GalliL10,
author = {Laura Galli and
Adam N. Letchford},
title = {Small bipartite subgraph polytopes},
journal = {Oper. Res. Lett.},
volume = {38},
number = {5},
pages = {337--340},
year = {2010},
url = {https://doi.org/10.1016/j.orl.2010.05.004},
doi = {10.1016/J.ORL.2010.05.004},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/GalliL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/Letchford10,
author = {Adam N. Letchford},
editor = {Friedrich Eisenbrand and
F. Bruce Shepherd},
title = {Integer Quadratic Quasi-polyhedra},
booktitle = {Integer Programming and Combinatorial Optimization, 14th International
Conference, {IPCO} 2010, Lausanne, Switzerland, June 9-11, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6080},
pages = {258--270},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13036-6\_20},
doi = {10.1007/978-3-642-13036-6\_20},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/ipco/Letchford10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/LetchfordO09,
author = {Adam N. Letchford and
Amar Oukil},
title = {Exploiting sparsity in pricing routines for the capacitated arc routing
problem},
journal = {Comput. Oper. Res.},
volume = {36},
number = {7},
pages = {2320--2327},
year = {2009},
url = {https://doi.org/10.1016/j.cor.2008.09.008},
doi = {10.1016/J.COR.2008.09.008},
timestamp = {Tue, 18 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cor/LetchfordO09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/GiandomenicoLRS09,
author = {Monia Giandomenico and
Adam N. Letchford and
Fabrizio Rossi and
Stefano Smriglio},
title = {An application of the Lov{\'{a}}sz-Schrijver \emph{M}(\emph{K},
\emph{K}) operator to the stable set problem},
journal = {Math. Program.},
volume = {120},
number = {2},
pages = {381--401},
year = {2009},
url = {https://doi.org/10.1007/s10107-008-0219-8},
doi = {10.1007/S10107-008-0219-8},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/GiandomenicoLRS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamjo/BurerL09,
author = {Samuel Burer and
Adam N. Letchford},
title = {On Nonconvex Quadratic Programming with Box Constraints},
journal = {{SIAM} J. Optim.},
volume = {20},
number = {2},
pages = {1073--1089},
year = {2009},
url = {https://doi.org/10.1137/080729529},
doi = {10.1137/080729529},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamjo/BurerL09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/opt/EgleseL09,
author = {Richard W. Eglese and
Adam N. Letchford},
editor = {Christodoulos A. Floudas and
Panos M. Pardalos},
title = {General Routing Problem},
booktitle = {Encyclopedia of Optimization, Second Edition},
pages = {1252--1254},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-0-387-74759-0\_217},
doi = {10.1007/978-0-387-74759-0\_217},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/reference/opt/EgleseL09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/LetchfordP08,
author = {Adam N. Letchford and
Nicholas A. Pearson},
title = {Good triangulations yield good tours},
journal = {Comput. Oper. Res.},
volume = {35},
number = {2},
pages = {638--647},
year = {2008},
url = {https://doi.org/10.1016/j.cor.2006.03.025},
doi = {10.1016/J.COR.2006.03.025},
timestamp = {Tue, 18 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cor/LetchfordP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ClarkELW08,
author = {Alistair R. Clark and
Richard W. Eglese and
Adam N. Letchford and
Michael B. Wright},
title = {Preface},
journal = {Discret. Appl. Math.},
volume = {156},
number = {3},
pages = {289--290},
year = {2008},
url = {https://doi.org/10.1016/j.dam.2007.08.003},
doi = {10.1016/J.DAM.2007.08.003},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ClarkELW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/LetchfordP08,
author = {Adam N. Letchford and
Nicholas A. Pearson},
title = {Exploiting planarity in separation routines for the symmetric traveling
salesman problem},
journal = {Discret. Optim.},
volume = {5},
number = {2},
pages = {220--230},
year = {2008},
url = {https://doi.org/10.1016/j.disopt.2007.05.002},
doi = {10.1016/J.DISOPT.2007.05.002},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/LetchfordP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/AmaralCLG08,
author = {Andr{\'{e}} Renato Sales Amaral and
Alberto Caprara and
Adam N. Letchford and
Juan Jos{\'{e}} Salazar Gonz{\'{a}}lez},
title = {A New Lower Bound for the Minimum Linear Arrangement of a Graph},
journal = {Electron. Notes Discret. Math.},
volume = {30},
pages = {87--92},
year = {2008},
url = {https://doi.org/10.1016/j.endm.2008.01.016},
doi = {10.1016/J.ENDM.2008.01.016},
timestamp = {Mon, 12 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/endm/AmaralCLG08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/KaparisL08,
author = {Konstantinos Kaparis and
Adam N. Letchford},
title = {Local and global lifted cover inequalities for the 0-1 multidimensional
knapsack problem},
journal = {Eur. J. Oper. Res.},
volume = {186},
number = {1},
pages = {91--103},
year = {2008},
url = {https://doi.org/10.1016/j.ejor.2007.01.032},
doi = {10.1016/J.EJOR.2007.01.032},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/KaparisL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/LetchfordRT08,
author = {Adam N. Letchford and
Gerhard Reinelt and
Dirk Oliver Theis},
title = {Odd Minimum Cut Sets and b-Matchings Revisited},
journal = {{SIAM} J. Discret. Math.},
volume = {22},
number = {4},
pages = {1480--1487},
year = {2008},
url = {https://doi.org/10.1137/060664793},
doi = {10.1137/060664793},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/LetchfordRT08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/LetchfordS08,
author = {Adam N. Letchford and
Michael Malmros S{\o}rensen},
editor = {Andrea Lodi and
Alessandro Panconesi and
Giovanni Rinaldi},
title = {Binary Positive Semidefinite Matrices and Associated Integer Polytopes},
booktitle = {Integer Programming and Combinatorial Optimization, 13th International
Conference, {IPCO} 2008, Bertinoro, Italy, May 26-28, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5035},
pages = {125--139},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-68891-4\_9},
doi = {10.1007/978-3-540-68891-4\_9},
timestamp = {Sat, 04 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ipco/LetchfordS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/4or/LetchfordL07,
author = {Adam N. Letchford and
Andrea Lodi},
title = {The traveling salesman problem: a book review},
journal = {4OR},
volume = {5},
number = {4},
pages = {315--317},
year = {2007},
url = {https://doi.org/10.1007/s10288-007-0058-0},
doi = {10.1007/S10288-007-0058-0},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/4or/LetchfordL07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/LeeL07,
author = {Jon Lee and
Adam N. Letchford},
title = {Mixed integer programming},
journal = {Discret. Optim.},
volume = {4},
number = {1},
pages = {1--2},
year = {2007},
url = {https://doi.org/10.1016/j.disopt.2006.10.005},
doi = {10.1016/J.DISOPT.2006.10.005},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/LeeL07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jors/LetchfordLE07,
author = {Adam N. Letchford and
Jens Lysgaard and
Richard W. Eglese},
title = {A branch-and-cut algorithm for the capacitated open vehicle routing
problem},
journal = {J. Oper. Res. Soc.},
volume = {58},
number = {12},
pages = {1642--1651},
year = {2007},
url = {https://doi.org/10.1057/palgrave.jors.2602345},
doi = {10.1057/PALGRAVE.JORS.2602345},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jors/LetchfordLE07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/FleischerLL06,
author = {Lisa Fleischer and
Adam N. Letchford and
Andrea Lodi},
title = {Polynomial-Time Separation of a Superclass of Simple Comb Inequalities},
journal = {Math. Oper. Res.},
volume = {31},
number = {4},
pages = {696--713},
year = {2006},
url = {https://doi.org/10.1287/moor.1060.0214},
doi = {10.1287/MOOR.1060.0214},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mor/FleischerLL06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/LetchfordG06,
author = {Adam N. Letchford and
Juan Jos{\'{e}} Salazar Gonz{\'{a}}lez},
title = {Projection results for vehicle routing},
journal = {Math. Program.},
volume = {105},
number = {2-3},
pages = {251--274},
year = {2006},
url = {https://doi.org/10.1007/s10107-005-0652-x},
doi = {10.1007/S10107-005-0652-X},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/LetchfordG06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/GiandomenicoL06,
author = {Monia Giandomenico and
Adam N. Letchford},
title = {Exploring the Relationship Between Max-Cut and Stable Set Relaxations},
journal = {Math. Program.},
volume = {106},
number = {1},
pages = {159--175},
year = {2006},
url = {https://doi.org/10.1007/s10107-005-0604-5},
doi = {10.1007/S10107-005-0604-5},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/GiandomenicoL06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LetchfordT06,
author = {Adam N. Letchford and
Dirk Oliver Theis},
title = {Odd minimum cut sets and b-matchings revisited},
journal = {CoRR},
volume = {abs/math/0607088},
year = {2006},
url = {http://arxiv.org/abs/math/0607088},
eprinttype = {arXiv},
eprint = {math/0607088},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/LetchfordT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/LetchfordP05,
author = {Adam N. Letchford and
Nicholas A. Pearson},
title = {A fast algorithm for minimum weight odd circuits and cuts in planar
graphs},
journal = {Oper. Res. Lett.},
volume = {33},
number = {6},
pages = {625--628},
year = {2005},
url = {https://doi.org/10.1016/j.orl.2004.12.001},
doi = {10.1016/J.ORL.2004.12.001},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/LetchfordP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/LysgaardLE04,
author = {Jens Lysgaard and
Adam N. Letchford and
Richard W. Eglese},
title = {A new branch-and-cut algorithm for the capacitated vehicle routing
problem},
journal = {Math. Program.},
volume = {100},
number = {2},
pages = {423--445},
year = {2004},
url = {https://doi.org/10.1007/s10107-003-0481-8},
doi = {10.1007/S10107-003-0481-8},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/LysgaardLE04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Letchford04,
author = {Adam N. Letchford},
title = {Book review},
journal = {Oper. Res. Lett.},
volume = {32},
number = {4},
pages = {393--394},
year = {2004},
url = {https://doi.org/10.1016/j.orl.2003.10.005},
doi = {10.1016/J.ORL.2003.10.005},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/Letchford04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/LetchfordRT04,
author = {Adam N. Letchford and
Gerhard Reinelt and
Dirk Oliver Theis},
editor = {George L. Nemhauser and
Daniel Bienstock},
title = {A Faster Exact Separation Algorithm for Blossom Inequalities},
booktitle = {Integer Programming and Combinatorial Optimization, 10th International
{IPCO} Conference, New York, NY, USA, June 7-11, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3064},
pages = {196--205},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-25960-2\_15},
doi = {10.1007/978-3-540-25960-2\_15},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/ipco/LetchfordRT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/4or/LetchfordL03,
author = {Adam N. Letchford and
Andrea Lodi},
title = {Primal separation algorithms},
journal = {4OR},
volume = {1},
number = {3},
pages = {209--224},
year = {2003},
url = {https://doi.org/10.1007/s10288-003-0012-8},
doi = {10.1007/S10288-003-0012-8},
timestamp = {Mon, 05 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/4or/LetchfordL03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/CapraraL03,
author = {Alberto Caprara and
Adam N. Letchford},
title = {On the separation of split cuts and related inequalities},
journal = {Math. Program.},
volume = {94},
number = {2-3},
pages = {279--294},
year = {2003},
url = {https://doi.org/10.1007/s10107-002-0320-3},
doi = {10.1007/S10107-002-0320-3},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/CapraraL03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Letchford03,
author = {Adam N. Letchford},
title = {Binary clutter inequalities for integer programs},
journal = {Math. Program.},
volume = {98},
number = {1-3},
pages = {201--221},
year = {2003},
url = {https://doi.org/10.1007/s10107-003-0402-x},
doi = {10.1007/S10107-003-0402-X},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/Letchford03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jors/Letchford02,
author = {Adam N. Letchford},
title = {Approximation Algorithms},
journal = {J. Oper. Res. Soc.},
volume = {53},
number = {7},
pages = {807--808},
year = {2002},
url = {https://doi.org/10.1057/palgrave.jors.2601377},
doi = {10.1057/PALGRAVE.JORS.2601377},
timestamp = {Sun, 11 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jors/Letchford02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mmor/LetchfordL02,
author = {Adam N. Letchford and
Andrea Lodi},
title = {Primal cutting plane algorithms revisited},
journal = {Math. Methods Oper. Res.},
volume = {56},
number = {1},
pages = {67--81},
year = {2002},
url = {https://doi.org/10.1007/s001860200200},
doi = {10.1007/S001860200200},
timestamp = {Tue, 03 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mmor/LetchfordL02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/LetchfordEL02,
author = {Adam N. Letchford and
Richard W. Eglese and
Jens Lysgaard},
title = {Multistars, partial multistars and the capacitated vehicle routing
problem},
journal = {Math. Program.},
volume = {94},
number = {1},
pages = {21--40},
year = {2002},
url = {https://doi.org/10.1007/s10107-002-0336-8},
doi = {10.1007/S10107-002-0336-8},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/LetchfordEL02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Letchford02,
author = {Adam N. Letchford},
title = {Totally tight Chv{\'{a}}tal-Gomory cuts},
journal = {Oper. Res. Lett.},
volume = {30},
number = {2},
pages = {71--73},
year = {2002},
url = {https://doi.org/10.1016/S0167-6377(02)00111-6},
doi = {10.1016/S0167-6377(02)00111-6},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/Letchford02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/LetchfordL02,
author = {Adam N. Letchford and
Andrea Lodi},
title = {Strengthening Chv{\'{a}}tal-Gomory cuts and Gomory fractional
cuts},
journal = {Oper. Res. Lett.},
volume = {30},
number = {2},
pages = {74--82},
year = {2002},
url = {https://doi.org/10.1016/S0167-6377(02)00112-8},
doi = {10.1016/S0167-6377(02)00112-8},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/LetchfordL02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/LetchfordL02,
author = {Adam N. Letchford and
Andrea Lodi},
editor = {William J. Cook and
Andreas S. Schulz},
title = {Polynomial-Time Separation of Simple Comb Inequalities},
booktitle = {Integer Programming and Combinatorial Optimization, 9th International
{IPCO} Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2337},
pages = {93--108},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-47867-1\_8},
doi = {10.1007/3-540-47867-1\_8},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/ipco/LetchfordL02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/LetchfordA01,
author = {Adam N. Letchford and
Andr{\'{e}} Renato Sales Amaral},
title = {Analysis of upper bounds for the Pallet Loading Problem},
journal = {Eur. J. Oper. Res.},
volume = {132},
number = {3},
pages = {582--593},
year = {2001},
url = {https://doi.org/10.1016/S0377-2217(00)00163-6},
doi = {10.1016/S0377-2217(00)00163-6},
timestamp = {Mon, 12 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eor/LetchfordA01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Letchford01,
author = {Adam N. Letchford},
title = {On Disjunctive Cuts for Combinatorial Optimization},
journal = {J. Comb. Optim.},
volume = {5},
number = {3},
pages = {299--315},
year = {2001},
url = {https://doi.org/10.1023/A:1011493126498},
doi = {10.1023/A:1011493126498},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/Letchford01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/CorberanLS01,
author = {Angel Corber{\'{a}}n and
Adam N. Letchford and
Jos{\'{e}} Mar{\'{\i}}a Sanchis},
title = {A cutting plane algorithm for the General Routing Problem},
journal = {Math. Program.},
volume = {90},
number = {2},
pages = {291--316},
year = {2001},
url = {https://doi.org/10.1007/PL00011426},
doi = {10.1007/PL00011426},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/CorberanLS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aussois/LetchfordL01,
author = {Adam N. Letchford and
Andrea Lodi},
editor = {Michael J{\"{u}}nger and
Gerhard Reinelt and
Giovanni Rinaldi},
title = {An Augment-and-Branch-and-Cut Framework for Mixed 0-1 Programming},
booktitle = {Combinatorial Optimization - Eureka, You Shrink!, Papers Dedicated
to Jack Edmonds, 5th International Workshop, Aussois, France, March
5-9, 2001, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {2570},
pages = {119--133},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-36478-1\_12},
doi = {10.1007/3-540-36478-1\_12},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/aussois/LetchfordL01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/Letchford00,
author = {Adam N. Letchford},
title = {Separating a Superclass of Comb Inequalities in Planar Graphs},
journal = {Math. Oper. Res.},
volume = {25},
number = {3},
pages = {443--454},
year = {2000},
url = {https://doi.org/10.1287/moor.25.3.443.12213},
doi = {10.1287/MOOR.25.3.443.12213},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mor/Letchford00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/CapraraFL00,
author = {Alberto Caprara and
Matteo Fischetti and
Adam N. Letchford},
title = {On the separation of maximally violated mod- \emph{k} cuts},
journal = {Math. Program.},
volume = {87},
number = {1},
pages = {37--56},
year = {2000},
url = {https://doi.org/10.1007/s101079900107},
doi = {10.1007/S101079900107},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/CapraraFL00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/Letchford99,
author = {Adam N. Letchford},
title = {The general routing polyhedron: {A} unifying framework},
journal = {Eur. J. Oper. Res.},
volume = {112},
number = {1},
pages = {122--133},
year = {1999},
url = {https://doi.org/10.1016/S0377-2217(97)00377-9},
doi = {10.1016/S0377-2217(97)00377-9},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/Letchford99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/CapraraFL99,
author = {Alberto Caprara and
Matteo Fischetti and
Adam N. Letchford},
editor = {G{\'{e}}rard Cornu{\'{e}}jols and
Rainer E. Burkard and
Gerhard J. Woeginger},
title = {On the Separation of Maximally Violated mod-k Cuts},
booktitle = {Integer Programming and Combinatorial Optimization, 7th International
{IPCO} Conference, Graz, Austria, June 9-11, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1610},
pages = {87--98},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-48777-8\_7},
doi = {10.1007/3-540-48777-8\_7},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/ipco/CapraraFL99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/LetchfordE98,
author = {Adam N. Letchford and
Richard W. Eglese},
title = {The rural postman problem with deadline classes},
journal = {Eur. J. Oper. Res.},
volume = {105},
number = {3},
pages = {390--400},
year = {1998},
url = {https://doi.org/10.1016/S0377-2217(97)00090-8},
doi = {10.1016/S0377-2217(97)00090-8},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/LetchfordE98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-06-02 01:33 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
