Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Jon Lee 0001
@article{DBLP:journals/siamdm/BorgwardtGL24,
author = {Steffen Borgwardt and
Weston Grewe and
Jon Lee},
title = {On the Combinatorial Diameters of Parallel and Series Connections},
journal = {{SIAM} J. Discret. Math.},
volume = {38},
number = {1},
pages = {485--503},
year = {2024},
url = {https://doi.org/10.1137/22m1490508},
doi = {10.1137/22M1490508},
timestamp = {Sun, 03 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/BorgwardtGL24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/AlThaniL23,
author = {Hessa Al{-}Thani and
Jon Lee},
title = {Tridiagonal maximum-entropy sampling and tridiagonal masks},
journal = {Discret. Appl. Math.},
volume = {337},
pages = {120--138},
year = {2023},
url = {https://doi.org/10.1016/j.dam.2023.04.020},
doi = {10.1016/J.DAM.2023.04.020},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/AlThaniL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jota/LeeSSX23,
author = {Jon Lee and
Daphne E. Skipper and
Emily Speakman and
Luze Xu},
title = {Gaining or Losing Perspective for Piecewise-Linear Under-Estimators
of Convex Univariate Functions},
journal = {J. Optim. Theory Appl.},
volume = {196},
number = {1},
pages = {1--35},
year = {2023},
url = {https://doi.org/10.1007/s10957-022-02144-6},
doi = {10.1007/S10957-022-02144-6},
timestamp = {Tue, 31 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jota/LeeSSX23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/acda/ChenF023,
author = {Zhongzhu Chen and
Marcia Fampa and
Jon Lee},
editor = {Jonathan W. Berry and
David B. Shmoys and
Lenore Cowen and
Uwe Naumann},
title = {Generalized Scaling for the Constrained Maximum-Entropy Sampling Problem},
booktitle = {{SIAM} Conference on Applied and Computational Discrete Algorithms,
{ACDA} 2023, Seattle, WA, USA, May 31 - June 2, 2023},
pages = {110--118},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977714.10},
doi = {10.1137/1.9781611977714.10},
timestamp = {Tue, 17 Oct 2023 16:38:11 +0200},
biburl = {https://dblp.org/rec/conf/acda/ChenF023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LeeMR22,
author = {Jon Lee and
Ali Ridha Mahjoub and
Giovanni Rinaldi},
title = {Preface: Combinatorial Optimization {ISCO} 2018},
journal = {Discret. Appl. Math.},
volume = {308},
pages = {1--3},
year = {2022},
url = {https://doi.org/10.1016/j.dam.2021.12.012},
doi = {10.1016/J.DAM.2021.12.012},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/LeeMR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgo/LeeSS22,
author = {Jon Lee and
Daphne E. Skipper and
Emily Speakman},
title = {Gaining or losing perspective},
journal = {J. Glob. Optim.},
volume = {82},
number = {4},
pages = {835--862},
year = {2022},
url = {https://doi.org/10.1007/s10898-021-01055-6},
doi = {10.1007/S10898-021-01055-6},
timestamp = {Wed, 27 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgo/LeeSS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/GaarLLST22,
author = {Elisabeth Gaar and
Jon Lee and
Ivana Ljubic and
Markus Sinnl and
K{\"{u}}bra Taninmis},
editor = {Karen I. Aardal and
Laura Sanit{\`{a}}},
title = {SOCP-Based Disjunctive Cuts for a Class of Integer Nonlinear Bilevel
Programs},
booktitle = {Integer Programming and Combinatorial Optimization - 23rd International
Conference, {IPCO} 2022, Eindhoven, The Netherlands, June 27-29, 2022,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13265},
pages = {262--276},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-06901-7\_20},
doi = {10.1007/978-3-031-06901-7\_20},
timestamp = {Tue, 25 Jul 2023 13:14:28 +0200},
biburl = {https://dblp.org/rec/conf/ipco/GaarLLST22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iscopt/FampaL22,
author = {Marcia Fampa and
Jon Lee},
editor = {Ivana Ljubic and
Francisco Barahona and
Santanu S. Dey and
Ali Ridha Mahjoub},
title = {An Outer-Approximation Algorithm for Maximum-Entropy Sampling},
booktitle = {Combinatorial Optimization - 7th International Symposium, {ISCO} 2022,
Virtual Event, May 18-20, 2022, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {13526},
pages = {130--142},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-18530-4\_10},
doi = {10.1007/978-3-031-18530-4\_10},
timestamp = {Mon, 06 Nov 2023 13:38:03 +0100},
biburl = {https://dblp.org/rec/conf/iscopt/FampaL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2207-05014,
author = {Elisabeth Gaar and
Jon Lee and
Ivana Ljubic and
Markus Sinnl and
K{\"{u}}bra Taninmis},
title = {On SOCP-based disjunctive cuts for solving a class of integer bilevel
nonlinear programs},
journal = {CoRR},
volume = {abs/2207.05014},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2207.05014},
doi = {10.48550/ARXIV.2207.05014},
eprinttype = {arXiv},
eprint = {2207.05014},
timestamp = {Thu, 14 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2207-05014.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/informs/DengJALS21,
author = {Yan Deng and
Huiwen Jia and
Shabbir Ahmed and
Jon Lee and
Siqian Shen},
title = {Scenario Grouping and Decomposition Algorithms for Chance-Constrained
Programs},
journal = {{INFORMS} J. Comput.},
volume = {33},
number = {2},
pages = {757--773},
year = {2021},
url = {https://doi.org/10.1287/ijoc.2020.0970},
doi = {10.1287/IJOC.2020.0970},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/informs/DengJALS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgo/FampaL21,
author = {Marcia Fampa and
Jon Lee},
title = {Convexification of bilinear forms through non-symmetric lifting},
journal = {J. Glob. Optim.},
volume = {80},
number = {2},
pages = {287--305},
year = {2021},
url = {https://doi.org/10.1007/s10898-020-00975-z},
doi = {10.1007/S10898-020-00975-Z},
timestamp = {Tue, 13 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgo/FampaL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgo/FampaLPX21,
author = {Marcia Fampa and
Jon Lee and
Gabriel Ponte and
Luze Xu},
title = {Experimental analysis of local searches for sparse reflexive generalized
inverses},
journal = {J. Glob. Optim.},
volume = {81},
number = {4},
pages = {1057--1093},
year = {2021},
url = {https://doi.org/10.1007/s10898-021-01087-y},
doi = {10.1007/S10898-021-01087-Y},
timestamp = {Wed, 15 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgo/FampaLPX21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/ChenFLL21,
author = {Zhongzhu Chen and
Marcia Fampa and
Am{\'{e}}lie Lambert and
Jon Lee},
title = {Mixing convex-optimization bounds for maximum-entropy sampling},
journal = {Math. Program.},
volume = {188},
number = {2},
pages = {539--568},
year = {2021},
url = {https://doi.org/10.1007/s10107-020-01588-w},
doi = {10.1007/S10107-020-01588-W},
timestamp = {Thu, 29 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/ChenFLL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ojmo/FampaLP21,
author = {Marcia Fampa and
Jon Lee and
Gabriel Ponte},
title = {Trading off 1-norm and sparsity against rank for linear models using
mathematical optimization: 1-norm minimizing partially reflexive ah-symmetric
generalized inverses},
journal = {Open J. Math. Optim.},
volume = {2},
pages = {1--14},
year = {2021},
url = {https://doi.org/10.5802/ojmo.6},
doi = {10.5802/OJMO.6},
timestamp = {Thu, 11 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ojmo/FampaLP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamjo/XuFLP21,
author = {Luze Xu and
Marcia Fampa and
Jon Lee and
Gabriel Ponte},
title = {Approximate 1-Norm Minimization and Minimum-Rank Structured Sparsity
for Various Generalized Inverses via Local Search},
journal = {{SIAM} J. Optim.},
volume = {31},
number = {3},
pages = {1722--1747},
year = {2021},
url = {https://doi.org/10.1137/19M1281514},
doi = {10.1137/19M1281514},
timestamp = {Wed, 03 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamjo/XuFLP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lagos/Al-Thani021,
author = {Hessa Al{-}Thani and
Jon Lee},
editor = {Carlos E. Ferreira and
Orlando Lee and
Fl{\'{a}}vio Keidi Miyazawa},
title = {Tridiagonal Maximum-Entropy Sampling and Tridiagonal Masks},
booktitle = {Proceedings of the {XI} Latin and American Algorithms, Graphs and
Optimization Symposium, {LAGOS} 2021, Online Event / S{\~{a}}o Paulo,
Brazil, May 2021},
series = {Procedia Computer Science},
volume = {195},
pages = {127--134},
publisher = {Elsevier},
year = {2021},
url = {https://doi.org/10.1016/j.procs.2021.11.018},
doi = {10.1016/J.PROCS.2021.11.018},
timestamp = {Tue, 18 Jan 2022 09:21:02 +0100},
biburl = {https://dblp.org/rec/conf/lagos/Al-Thani021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2111-06824,
author = {Elisabeth Gaar and
Jon Lee and
Ivana Ljubic and
Markus Sinnl and
K{\"{u}}bra Taninmis},
title = {SOCP-based disjunctive cuts for a class of integer nonlinear bilevel
programs},
journal = {CoRR},
volume = {abs/2111.06824},
year = {2021},
url = {https://arxiv.org/abs/2111.06824},
eprinttype = {arXiv},
eprint = {2111.06824},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2111-06824.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LeeS20,
author = {Jon Lee and
Daphne E. Skipper},
title = {Volume computation for sparse Boolean quadric relaxations},
journal = {Discret. Appl. Math.},
volume = {275},
pages = {79--94},
year = {2020},
url = {https://doi.org/10.1016/j.dam.2018.10.038},
doi = {10.1016/J.DAM.2018.10.038},
timestamp = {Thu, 19 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/LeeS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/KaibelLWW20,
author = {Volker Kaibel and
Jon Lee and
Matthias Walter and
Stefan Weltge},
title = {Correction to: Extended Formulations for Independence Polytopes of
Regular Matroids},
journal = {Graphs Comb.},
volume = {36},
number = {1},
pages = {177--179},
year = {2020},
url = {https://doi.org/10.1007/s00373-019-02122-2},
doi = {10.1007/S00373-019-02122-2},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/KaibelLWW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/infor/LeeL20,
author = {Jon Lee and
Joy Lind},
title = {Generalized maximum-entropy sampling},
journal = {{INFOR} Inf. Syst. Oper. Res.},
volume = {58},
number = {2},
pages = {168--181},
year = {2020},
url = {https://doi.org/10.1080/03155986.2018.1533774},
doi = {10.1080/03155986.2018.1533774},
timestamp = {Tue, 30 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/infor/LeeL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ol/DAmbrosioFLV20,
author = {Claudia D'Ambrosio and
Marcia Fampa and
Jon Lee and
Stefan Vigerske},
title = {On a nonconvex {MINLP} formulation of the Euclidean Steiner tree problem
in n-space: missing proofs},
journal = {Optim. Lett.},
volume = {14},
number = {2},
pages = {409--415},
year = {2020},
url = {https://doi.org/10.1007/s11590-018-1295-1},
doi = {10.1007/S11590-018-1295-1},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ol/DAmbrosioFLV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ol/LeeL20,
author = {Jon Lee and
Leo Liberti},
title = {On an {SDP} relaxation for kissing number},
journal = {Optim. Lett.},
volume = {14},
number = {2},
pages = {417--422},
year = {2020},
url = {https://doi.org/10.1007/s11590-018-1239-9},
doi = {10.1007/S11590-018-1239-9},
timestamp = {Fri, 03 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ol/LeeL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orf/Al-ThaniL20,
author = {Hessa Al{-}Thani and
Jon Lee},
title = {An {R} Package for Generating Covariance Matrices for Maximum-Entropy
Sampling from Precipitation Chemistry Data},
journal = {Oper. Res. Forum},
volume = {1},
number = {3},
year = {2020},
url = {https://doi.org/10.1007/s43069-020-0011-z},
doi = {10.1007/S43069-020-0011-Z},
timestamp = {Sat, 10 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orf/Al-ThaniL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iscopt/DAmbrosio0ST20,
author = {Claudia D'Ambrosio and
Jon Lee and
Daphne E. Skipper and
Dimitri Thomopulos},
editor = {Mourad Ba{\"{\i}}ou and
Bernard Gendron and
Oktay G{\"{u}}nl{\"{u}}k and
Ali Ridha Mahjoub},
title = {Handling Separable Non-convexities Using Disjunctive Cuts},
booktitle = {Combinatorial Optimization - 6th International Symposium, {ISCO} 2020,
Montreal, QC, Canada, May 4-6, 2020, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {12176},
pages = {102--114},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-53262-8\_9},
doi = {10.1007/978-3-030-53262-8\_9},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iscopt/DAmbrosio0ST20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iscopt/LeePSX20,
author = {Jon Lee and
Joseph Paat and
Ingo Stallknecht and
Luze Xu},
editor = {Mourad Ba{\"{\i}}ou and
Bernard Gendron and
Oktay G{\"{u}}nl{\"{u}}k and
Ali Ridha Mahjoub},
title = {Improving Proximity Bounds Using Sparsity},
booktitle = {Combinatorial Optimization - 6th International Symposium, {ISCO} 2020,
Montreal, QC, Canada, May 4-6, 2020, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {12176},
pages = {115--127},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-53262-8\_10},
doi = {10.1007/978-3-030-53262-8\_10},
timestamp = {Sun, 26 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iscopt/LeePSX20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2003-06316,
author = {Hessa Al{-}Thani and
Jon Lee},
title = {An {R} Package for generating covariance matrices for maximum-entropy
sampling from precipitation chemistry data},
journal = {CoRR},
volume = {abs/2003.06316},
year = {2020},
url = {https://arxiv.org/abs/2003.06316},
eprinttype = {arXiv},
eprint = {2003.06316},
timestamp = {Fri, 20 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2003-06316.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2009-07178,
author = {Jon Lee and
Daphne E. Skipper and
Emily Speakman and
Luze Xu},
title = {Gaining or Losing Perspective for Piecewise-Linear Under-Estimators
of Convex Univariate Functions},
journal = {CoRR},
volume = {abs/2009.07178},
year = {2020},
url = {https://arxiv.org/abs/2009.07178},
eprinttype = {arXiv},
eprint = {2009.07178},
timestamp = {Fri, 18 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2009-07178.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2011-02509,
author = {Marcia Fampa and
Jon Lee and
Gabriel Ponte},
title = {Trading off 1-norm and sparsity against rank for linear models using
mathematical optimization: 1-norm minimizing partially reflexive ah-symmetric
generalized inverses},
journal = {CoRR},
volume = {abs/2011.02509},
year = {2020},
url = {https://arxiv.org/abs/2011.02509},
eprinttype = {arXiv},
eprint = {2011.02509},
timestamp = {Mon, 09 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2011-02509.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamjo/XuLS19,
author = {Luze Xu and
Jon Lee and
Daphne E. Skipper},
title = {More Virtuous Smoothing},
journal = {{SIAM} J. Optim.},
volume = {29},
number = {2},
pages = {1240--1259},
year = {2019},
url = {https://doi.org/10.1137/18M1172831},
doi = {10.1137/18M1172831},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamjo/XuLS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wcgo/FuentesF019,
author = {Victor K. Fuentes and
Marcia Fampa and
Jon Lee},
editor = {Hoai An Le Thi and
Hoai Minh Le and
Tao Pham Dinh},
title = {Diving for Sparse Partially-Reflexive Generalized Inverses},
booktitle = {Optimization of Complex Systems: Theory, Models, Algorithms and Applications,
{WCGO} 2019, World Congress on Global Optimization, Metz, France,
8-10 July, 2019},
series = {Advances in Intelligent Systems and Computing},
volume = {991},
pages = {89--98},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-21803-4\_9},
doi = {10.1007/978-3-030-21803-4\_9},
timestamp = {Thu, 14 Oct 2021 10:20:21 +0200},
biburl = {https://dblp.org/rec/conf/wcgo/FuentesF019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wcgo/0001SS19,
author = {Jon Lee and
Daphne E. Skipper and
Emily Speakman},
editor = {Hoai An Le Thi and
Hoai Minh Le and
Tao Pham Dinh},
title = {Gaining or Losing Perspective},
booktitle = {Optimization of Complex Systems: Theory, Models, Algorithms and Applications,
{WCGO} 2019, World Congress on Global Optimization, Metz, France,
8-10 July, 2019},
series = {Advances in Intelligent Systems and Computing},
volume = {991},
pages = {387--397},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-21803-4\_39},
doi = {10.1007/978-3-030-21803-4\_39},
timestamp = {Fri, 13 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wcgo/0001SS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wcgo/XuL19,
author = {Luze Xu and
Jon Lee},
editor = {Hoai An Le Thi and
Hoai Minh Le and
Tao Pham Dinh},
title = {On Proximity for k-Regular Mixed-Integer Linear Optimization},
booktitle = {Optimization of Complex Systems: Theory, Models, Algorithms and Applications,
{WCGO} 2019, World Congress on Global Optimization, Metz, France,
8-10 July, 2019},
series = {Advances in Intelligent Systems and Computing},
volume = {991},
pages = {438--447},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-21803-4\_44},
doi = {10.1007/978-3-030-21803-4\_44},
timestamp = {Tue, 25 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wcgo/XuL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LeeS18,
author = {Jon Lee and
Daphne E. Skipper},
title = {Computing with an algebraic-perturbation variant of Barvinok's algorithm},
journal = {Discret. Appl. Math.},
volume = {240},
pages = {63--77},
year = {2018},
url = {https://doi.org/10.1016/j.dam.2015.12.003},
doi = {10.1016/J.DAM.2015.12.003},
timestamp = {Fri, 13 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/LeeS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgo/Speakman018,
author = {Emily Speakman and
Jon Lee},
title = {On branching-point selection for trilinear monomials in spatial branch-and-bound:
the hull relaxation},
journal = {J. Glob. Optim.},
volume = {72},
number = {2},
pages = {129--153},
year = {2018},
url = {https://doi.org/10.1007/s10898-018-0620-7},
doi = {10.1007/S10898-018-0620-7},
timestamp = {Fri, 11 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgo/Speakman018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/LeeSS18,
author = {Jon Lee and
Daphne E. Skipper and
Emily Speakman},
title = {Algorithmic and modeling insights via volumetric comparison of polyhedral
relaxations},
journal = {Math. Program.},
volume = {170},
number = {1},
pages = {121--140},
year = {2018},
url = {https://doi.org/10.1007/s10107-018-1272-6},
doi = {10.1007/S10107-018-1272-6},
timestamp = {Fri, 13 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/LeeSS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/ShenLN18,
author = {Xiangkun Shen and
Jon Lee and
Viswanath Nagarajan},
title = {Approximating graph-constrained max-cut},
journal = {Math. Program.},
volume = {172},
number = {1-2},
pages = {35--58},
year = {2018},
url = {https://doi.org/10.1007/s10107-017-1154-3},
doi = {10.1007/S10107-017-1154-3},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/ShenLN18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/KouteckyLNS18,
author = {Martin Kouteck{\'{y}} and
Jon Lee and
Viswanath Nagarajan and
Xiangkun Shen},
title = {Approximating max-cut under graph-MSO constraints},
journal = {Oper. Res. Lett.},
volume = {46},
number = {6},
pages = {592--598},
year = {2018},
url = {https://doi.org/10.1016/j.orl.2018.10.004},
doi = {10.1016/J.ORL.2018.10.004},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/KouteckyLNS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/FampaL18,
author = {Marcia Fampa and
Jon Lee},
title = {On sparse reflexive generalized inverse},
journal = {Oper. Res. Lett.},
volume = {46},
number = {6},
pages = {605--610},
year = {2018},
url = {https://doi.org/10.1016/j.orl.2018.09.005},
doi = {10.1016/J.ORL.2018.09.005},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/FampaL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/iscopt/2018,
editor = {Jon Lee and
Giovanni Rinaldi and
Ali Ridha Mahjoub},
title = {Combinatorial Optimization - 5th International Symposium, {ISCO} 2018,
Marrakesh, Morocco, April 11-13, 2018, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {10856},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-96151-4},
doi = {10.1007/978-3-319-96151-4},
isbn = {978-3-319-96150-7},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iscopt/2018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1803-05718,
author = {Martin Kouteck{\'{y}} and
Jon Lee and
Viswanath Nagarajan and
Xiangkun Shen},
title = {Approximating Max-Cut under Graph-MSO Constraints},
journal = {CoRR},
volume = {abs/1803.05718},
year = {2018},
url = {http://arxiv.org/abs/1803.05718},
eprinttype = {arXiv},
eprint = {1803.05718},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1803-05718.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-03074,
author = {Marcia Fampa and
Jon Lee},
title = {On Sparse Reflexive Generalized Inverses},
journal = {CoRR},
volume = {abs/1807.03074},
year = {2018},
url = {http://arxiv.org/abs/1807.03074},
eprinttype = {arXiv},
eprint = {1807.03074},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-03074.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejco/FampaLM17,
author = {Marcia Fampa and
Jon Lee and
Wendel Melo},
title = {On global optimization with indefinite quadratics},
journal = {{EURO} J. Comput. Optim.},
volume = {5},
number = {3},
pages = {309--337},
year = {2017},
url = {https://doi.org/10.1007/s13675-016-0079-6},
doi = {10.1007/S13675-016-0079-6},
timestamp = {Mon, 18 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ejco/FampaLM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejco/LeeW17,
author = {Jon Lee and
Angelika Wiegele},
title = {Another pedagogy for mixed-integer Gomory},
journal = {{EURO} J. Comput. Optim.},
volume = {5},
number = {4},
pages = {455--466},
year = {2017},
url = {https://doi.org/10.1007/s13675-017-0085-3},
doi = {10.1007/S13675-017-0085-3},
timestamp = {Mon, 18 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ejco/LeeW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgo/LeeS17,
author = {Jon Lee and
Daphne E. Skipper},
title = {Virtuous smoothing for global optimization},
journal = {J. Glob. Optim.},
volume = {69},
number = {3},
pages = {677--697},
year = {2017},
url = {https://doi.org/10.1007/s10898-017-0533-x},
doi = {10.1007/S10898-017-0533-X},
timestamp = {Fri, 11 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgo/LeeS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/SpeakmanL17,
author = {Emily Speakman and
Jon Lee},
title = {Quantifying Double McCormick},
journal = {Math. Oper. Res.},
volume = {42},
number = {4},
pages = {1230--1253},
year = {2017},
url = {https://doi.org/10.1287/moor.2017.0846},
doi = {10.1287/MOOR.2017.0846},
timestamp = {Tue, 28 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/SpeakmanL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rairo/HeL17,
author = {Qi He and
Jon Lee},
title = {Another pedagogy for pure-integer Gomory},
journal = {{RAIRO} Oper. Res.},
volume = {51},
number = {1},
pages = {189--197},
year = {2017},
url = {https://doi.org/10.1051/ro/2016013},
doi = {10.1051/RO/2016013},
timestamp = {Wed, 02 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rairo/HeL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpaior/SpeakmanYL17,
author = {Emily Speakman and
Han Yu and
Jon Lee},
editor = {Domenico Salvagnin and
Michele Lombardi},
title = {Experimental Validation of Volume-Based Comparison for Double-McCormick
Relaxations},
booktitle = {Integration of {AI} and {OR} Techniques in Constraint Programming
- 14th International Conference, {CPAIOR} 2017, Padua, Italy, June
5-8, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10335},
pages = {229--243},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-59776-8\_19},
doi = {10.1007/978-3-319-59776-8\_19},
timestamp = {Tue, 14 May 2019 10:00:47 +0200},
biburl = {https://dblp.org/rec/conf/cpaior/SpeakmanYL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/coap/FampaLM16,
author = {Marcia Fampa and
Jon Lee and
Wendel Melo},
title = {A specialized branch-and-bound algorithm for the Euclidean Steiner
tree problem in \emph{n}-space},
journal = {Comput. Optim. Appl.},
volume = {65},
number = {1},
pages = {47--71},
year = {2016},
url = {https://doi.org/10.1007/s10589-016-9835-z},
doi = {10.1007/S10589-016-9835-Z},
timestamp = {Tue, 14 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/coap/FampaLM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/KaibelLWW16,
author = {Volker Kaibel and
Jon Lee and
Matthias Walter and
Stefan Weltge},
title = {Extended Formulations for Independence Polytopes of Regular Matroids},
journal = {Graphs Comb.},
volume = {32},
number = {5},
pages = {1931--1944},
year = {2016},
url = {https://doi.org/10.1007/s00373-016-1709-8},
doi = {10.1007/S00373-016-1709-8},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/KaibelLWW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/itor/FampaLM16,
author = {Marcia Fampa and
Jon Lee and
Nelson Maculan},
title = {An overview of exact algorithms for the Euclidean Steiner tree problem
in \emph{n}-space},
journal = {Int. Trans. Oper. Res.},
volume = {23},
number = {5},
pages = {861--874},
year = {2016},
url = {https://doi.org/10.1111/itor.12207},
doi = {10.1111/ITOR.12207},
timestamp = {Thu, 09 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/itor/FampaLM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/LeeNS16,
author = {Jon Lee and
Viswanath Nagarajan and
Xiangkun Shen},
editor = {Quentin Louveaux and
Martin Skutella},
title = {Max-Cut Under Graph Constraints},
booktitle = {Integer Programming and Combinatorial Optimization - 18th International
Conference, {IPCO} 2016, Li{\`{e}}ge, Belgium, June 1-3, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9682},
pages = {50--62},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-33461-5\_5},
doi = {10.1007/978-3-319-33461-5\_5},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/ipco/LeeNS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/or/FuentesL16,
author = {Victor K. Fuentes and
Jon Lee},
editor = {Andreas Fink and
Armin F{\"{u}}genschuh and
Martin Josef Geiger},
title = {Low-Rank/Sparse-Inverse Decomposition via Woodbury},
booktitle = {Operations Research Proceedings 2016, Selected Papers of the Annual
International Conference of the German Operations Research Society
(GOR), Helmut Schmidt University Hamburg, Germany, August 30 - September
2, 2016},
series = {Operations Research Proceedings},
pages = {111--117},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-55702-1\_16},
doi = {10.1007/978-3-319-55702-1\_16},
timestamp = {Mon, 12 Feb 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/or/FuentesL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/LoeraLMM15,
author = {Jes{\'{u}}s A. De Loera and
Jon Lee and
Susan Margulies and
Jacob Miller},
title = {Weak orientability of matroids and polynomial equations},
journal = {Eur. J. Comb.},
volume = {50},
pages = {56--71},
year = {2015},
url = {https://doi.org/10.1016/j.ejc.2015.03.018},
doi = {10.1016/J.EJC.2015.03.018},
timestamp = {Fri, 26 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/LoeraLMM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/LeeS15,
author = {Jon Lee and
Daphne E. Skipper},
title = {An algebraic-perturbation variant of Barvinok's algorithm},
journal = {Electron. Notes Discret. Math.},
volume = {50},
pages = {15--20},
year = {2015},
url = {https://doi.org/10.1016/j.endm.2015.07.004},
doi = {10.1016/J.ENDM.2015.07.004},
timestamp = {Fri, 13 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/LeeS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/LeeV15,
author = {Jon Lee and
Jens Vygen},
title = {Preface},
journal = {Math. Program.},
volume = {154},
number = {1-2},
pages = {1--2},
year = {2015},
url = {https://doi.org/10.1007/s10107-015-0954-6},
doi = {10.1007/S10107-015-0954-6},
timestamp = {Mon, 12 Feb 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/LeeV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamjo/LoeraHL15,
author = {Jes{\'{u}}s A. De Loera and
Raymond Hemmecke and
Jon Lee},
title = {On Augmentation Algorithms for Linear and Integer-Linear Programming:
From Edmonds-Karp to Bland and Beyond},
journal = {{SIAM} J. Optim.},
volume = {25},
number = {4},
pages = {2494--2511},
year = {2015},
url = {https://doi.org/10.1137/151002915},
doi = {10.1137/151002915},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamjo/LoeraHL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wea/DAmbrosioFLV15,
author = {Claudia D'Ambrosio and
Marcia Fampa and
Jon Lee and
Stefan Vigerske},
editor = {Evripidis Bampis},
title = {On a Nonconvex {MINLP} Formulation of the Euclidean Steiner Tree Problem
in n-Space},
booktitle = {Experimental Algorithms - 14th International Symposium, {SEA} 2015,
Paris, France, June 29 - July 1, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9125},
pages = {122--133},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-20086-6\_10},
doi = {10.1007/978-3-319-20086-6\_10},
timestamp = {Thu, 23 Sep 2021 11:47:32 +0200},
biburl = {https://dblp.org/rec/conf/wea/DAmbrosioFLV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wea/OrsoLS15,
author = {Andrew Orso and
Jon Lee and
Siqian Shen},
editor = {Evripidis Bampis},
title = {Submodular Minimization in the Context of Modern {LP} and {MILP} Methods
and Solvers},
booktitle = {Experimental Algorithms - 14th International Symposium, {SEA} 2015,
Paris, France, June 29 - July 1, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9125},
pages = {193--204},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-20086-6\_15},
doi = {10.1007/978-3-319-20086-6\_15},
timestamp = {Mon, 12 Feb 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wea/OrsoLS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KaibelLWW15,
author = {Volker Kaibel and
Jon Lee and
Matthias Walter and
Stefan Weltge},
title = {Extended Formulations for Independence Polytopes of Regular Matroids},
journal = {CoRR},
volume = {abs/1504.03872},
year = {2015},
url = {http://arxiv.org/abs/1504.03872},
eprinttype = {arXiv},
eprint = {1504.03872},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KaibelLWW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LeeNS15,
author = {Jon Lee and
Viswanath Nagarajan and
Xiangkun Shen},
title = {Max-Cut under Graph Constraints},
journal = {CoRR},
volume = {abs/1511.08152},
year = {2015},
url = {http://arxiv.org/abs/1511.08152},
eprinttype = {arXiv},
eprint = {1511.08152},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/LeeNS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LibertiMLLM14,
author = {Leo Liberti and
Beno{\^{\i}}t Masson and
Jon Lee and
Carlile Lavor and
Antonio Mucherino},
title = {On the number of realizations of certain Henneberg graphs arising
in protein conformation},
journal = {Discret. Appl. Math.},
volume = {165},
pages = {213--232},
year = {2014},
url = {https://doi.org/10.1016/j.dam.2013.01.020},
doi = {10.1016/J.DAM.2013.01.020},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/LibertiMLLM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgo/LeeZ14,
author = {Jon Lee and
Bai Zou},
title = {Optimal rank-sparsity decomposition},
journal = {J. Glob. Optim.},
volume = {60},
number = {2},
pages = {307--315},
year = {2014},
url = {https://doi.org/10.1007/s10898-013-0128-0},
doi = {10.1007/S10898-013-0128-0},
timestamp = {Fri, 11 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgo/LeeZ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/ipco/2014,
editor = {Jon Lee and
Jens Vygen},
title = {Integer Programming and Combinatorial Optimization - 17th International
Conference, {IPCO} 2014, Bonn, Germany, June 23-25, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8494},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-07557-0},
doi = {10.1007/978-3-319-07557-0},
isbn = {978-3-319-07556-3},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/2014.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/LoeraLMM13,
author = {Jes{\'{u}}s A. De Loera and
Jon Lee and
Susan Margulies and
Jacob Miller},
title = {Systems of Polynomials for Detecting Orientable Matroids},
journal = {Electron. Notes Discret. Math.},
volume = {43},
pages = {343--353},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.07.052},
doi = {10.1016/J.ENDM.2013.07.052},
timestamp = {Fri, 26 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/LoeraLMM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ited/KraussLN13,
author = {Binyamin Krauss and
Jon Lee and
Daniel Newman},
title = {Optimizing the Assignment of Students to Classes in an Elementary
School},
journal = {{INFORMS} Trans. Educ.},
volume = {14},
number = {1},
pages = {39--44},
year = {2013},
url = {https://doi.org/10.1287/ited.2013.0111},
doi = {10.1287/ITED.2013.0111},
timestamp = {Thu, 08 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ited/KraussLN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/BonamiLLW13,
author = {Pierre Bonami and
Jon Lee and
Sven Leyffer and
Andreas W{\"{a}}chter},
title = {On branching rules for convex mixed-integer nonlinear optimization},
journal = {{ACM} J. Exp. Algorithmics},
volume = {18},
year = {2013},
url = {https://doi.org/10.1145/2532568},
doi = {10.1145/2532568},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/BonamiLLW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LeeSV13,
author = {Jon Lee and
Maxim Sviridenko and
Jan Vondr{\'{a}}k},
title = {Matroid Matching: The Power of Local Search},
journal = {{SIAM} J. Comput.},
volume = {42},
number = {1},
pages = {357--379},
year = {2013},
url = {https://doi.org/10.1137/11083232X},
doi = {10.1137/11083232X},
timestamp = {Mon, 12 Feb 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/LeeSV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mmor/LeeL12,
author = {Jon Lee and
Leo Liberti},
title = {A matroid view of key theorems for edge-swapping algorithms},
journal = {Math. Methods Oper. Res.},
volume = {76},
number = {2},
pages = {125--127},
year = {2012},
url = {https://doi.org/10.1007/s00186-012-0392-7},
doi = {10.1007/S00186-012-0392-7},
timestamp = {Tue, 03 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mmor/LeeL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/LeeORW12,
author = {Jon Lee and
Shmuel Onn and
Lyubov Romanchuk and
Robert Weismantel},
title = {The quadratic Graver cone, quadratic integer minimization, and extensions},
journal = {Math. Program.},
volume = {136},
number = {2},
pages = {301--323},
year = {2012},
url = {https://doi.org/10.1007/s10107-012-0605-0},
doi = {10.1007/S10107-012-0605-0},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/LeeORW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ol/LavorLJLMS12,
author = {Carlile Lavor and
Jon Lee and
Audrey Lee{-}St. John and
Leo Liberti and
Antonio Mucherino and
Maxim Sviridenko},
title = {Discretization orders for distance geometry problems},
journal = {Optim. Lett.},
volume = {6},
number = {4},
pages = {783--796},
year = {2012},
url = {https://doi.org/10.1007/s11590-011-0302-6},
doi = {10.1007/S11590-011-0302-6},
timestamp = {Fri, 03 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ol/LavorLJLMS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsc/LoeraLMM11,
author = {Jes{\'{u}}s A. De Loera and
Jon Lee and
Peter N. Malkin and
Susan Margulies},
title = {Computing infeasibility certificates for combinatorial problems through
Hilbert's Nullstellensatz},
journal = {J. Symb. Comput.},
volume = {46},
number = {11},
pages = {1260--1283},
year = {2011},
url = {https://doi.org/10.1016/j.jsc.2011.08.007},
doi = {10.1016/J.JSC.2011.08.007},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jsc/LoeraLMM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/SaxenaBL11,
author = {Anureet Saxena and
Pierre Bonami and
Jon Lee},
title = {Convex relaxations of non-convex mixed integer quadratically constrained
programs: projected formulations},
journal = {Math. Program.},
volume = {130},
number = {2},
pages = {359--413},
year = {2011},
url = {https://doi.org/10.1007/s10107-010-0340-3},
doi = {10.1007/S10107-010-0340-3},
timestamp = {Mon, 12 Feb 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/SaxenaBL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/LibertiMLLM11,
author = {Leo Liberti and
Beno{\^{\i}}t Masson and
Jon Lee and
Carlile Lavor and
Antonio Mucherino},
editor = {Weifan Wang and
Xuding Zhu and
Ding{-}Zhu Du},
title = {On the Number of Solutions of the Discretizable Molecular Distance
Geometry Problem},
booktitle = {Combinatorial Optimization and Applications - 5th International Conference,
{COCOA} 2011, Zhangjiajie, China, August 4-6, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6831},
pages = {322--342},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22616-8\_26},
doi = {10.1007/978-3-642-22616-8\_26},
timestamp = {Tue, 28 Apr 2020 17:58:14 +0200},
biburl = {https://dblp.org/rec/conf/cocoa/LibertiMLLM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpaior/NanniciniBLLMW11,
author = {Giacomo Nannicini and
Pietro Belotti and
Jon Lee and
Jeff T. Linderoth and
Fran{\c{c}}ois Margot and
Andreas W{\"{a}}chter},
editor = {Tobias Achterberg and
J. Christopher Beck},
title = {A Probing Algorithm for {MINLP} with Failure Prediction by {SVM}},
booktitle = {Integration of {AI} and {OR} Techniques in Constraint Programming
for Combinatorial Optimization Problems - 8th International Conference,
{CPAIOR} 2011, Berlin, Germany, May 23-27, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6697},
pages = {154--169},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-21311-3\_15},
doi = {10.1007/978-3-642-21311-3\_15},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpaior/NanniciniBLLMW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgo/CafieriLL10,
author = {Sonia Cafieri and
Jon Lee and
Leo Liberti},
title = {On convex relaxations of quadrilinear terms},
journal = {J. Glob. Optim.},
volume = {47},
number = {4},
pages = {661--685},
year = {2010},
url = {https://doi.org/10.1007/s10898-009-9484-1},
doi = {10.1007/S10898-009-9484-1},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgo/CafieriLL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/LeeSV10,
author = {Jon Lee and
Maxim Sviridenko and
Jan Vondr{\'{a}}k},
title = {Submodular Maximization over Multiple Matroids via Generalized Exchange
Properties},
journal = {Math. Oper. Res.},
volume = {35},
number = {4},
pages = {795--806},
year = {2010},
url = {https://doi.org/10.1287/moor.1100.0463},
doi = {10.1287/MOOR.1100.0463},
timestamp = {Mon, 12 Feb 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mor/LeeSV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/BersteinLOW10,
author = {Yael Berstein and
Jon Lee and
Shmuel Onn and
Robert Weismantel},
title = {Parametric nonlinear discrete optimization over well-described sets
and matroid intersections},
journal = {Math. Program.},
volume = {124},
number = {1-2},
pages = {233--253},
year = {2010},
url = {https://doi.org/10.1007/s10107-010-0358-6},
doi = {10.1007/S10107-010-0358-6},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/BersteinLOW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/SaxenaBL10,
author = {Anureet Saxena and
Pierre Bonami and
Jon Lee},
title = {Convex relaxations of non-convex mixed integer quadratically constrained
programs: extended formulations},
journal = {Math. Program.},
volume = {124},
number = {1-2},
pages = {383--411},
year = {2010},
url = {https://doi.org/10.1007/s10107-010-0371-9},
doi = {10.1007/S10107-010-0371-9},
timestamp = {Mon, 12 Feb 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/SaxenaBL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mpc/GunnelsLM10,
author = {John A. Gunnels and
Jon Lee and
Susan Margulies},
title = {Efficient high-precision matrix algebra on parallel architectures
for nonlinear combinatorial optimization},
journal = {Math. Program. Comput.},
volume = {2},
number = {2},
pages = {103--124},
year = {2010},
url = {https://doi.org/10.1007/s12532-010-0014-4},
doi = {10.1007/S12532-010-0014-4},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mpc/GunnelsLM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/LeeMNS10,
author = {Jon Lee and
Vahab S. Mirrokni and
Viswanath Nagarajan and
Maxim Sviridenko},
title = {Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack
Constraints},
journal = {{SIAM} J. Discret. Math.},
volume = {23},
number = {4},
pages = {2053--2078},
year = {2010},
url = {https://doi.org/10.1137/090750020},
doi = {10.1137/090750020},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/LeeMNS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/BelottiCLL10,
author = {Pietro Belotti and
Sonia Cafieri and
Jon Lee and
Leo Liberti},
editor = {Weili Wu and
Ovidiu Daescu},
title = {Feasibility-Based Bounds Tightening via Fixed Points},
booktitle = {Combinatorial Optimization and Applications - 4th International Conference,
{COCOA} 2010, Kailua-Kona, HI, USA, December 18-20, 2010, Proceedings,
Part {I}},
series = {Lecture Notes in Computer Science},
volume = {6508},
pages = {65--76},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-17458-2\_7},
doi = {10.1007/978-3-642-17458-2\_7},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cocoa/BelottiCLL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colognetwente/BelottiCLL10,
author = {Pietro Belotti and
Sonia Cafieri and
Jon Lee and
Leo Liberti},
editor = {Ulrich Faigle and
Rainer Schrader and
Daniel Herrmann},
title = {On the Convergence of Feasibility based Bounds Tightening},
booktitle = {9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization,
Cologne, Germany, May 25-27, 2010. Extended Abstracts},
pages = {21--24},
year = {2010},
timestamp = {Mon, 12 Feb 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/colognetwente/BelottiCLL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LeeSV10,
author = {Jon Lee and
Maxim Sviridenko and
Jan Vondr{\'{a}}k},
editor = {Leonard J. Schulman},
title = {Matroid matching: the power of local search},
booktitle = {Proceedings of the 42nd {ACM} Symposium on Theory of Computing, {STOC}
2010, Cambridge, Massachusetts, USA, 5-8 June 2010},
pages = {369--378},
publisher = {{ACM}},
year = {2010},
url = {https://doi.org/10.1145/1806689.1806741},
doi = {10.1145/1806689.1806741},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/LeeSV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/daglib/p/HemmeckeKLW10,
author = {Raymond Hemmecke and
Matthias K{\"{o}}ppe and
Jon Lee and
Robert Weismantel},
editor = {Michael J{\"{u}}nger and
Thomas M. Liebling and
Denis Naddef and
George L. Nemhauser and
William R. Pulleyblank and
Gerhard Reinelt and
Giovanni Rinaldi and
Laurence A. Wolsey},
title = {Nonlinear Integer Programming},
booktitle = {50 Years of Integer Programming 1958-2008 - From the Early Years to
the State-of-the-Art},
pages = {561--618},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-540-68279-0\_15},
doi = {10.1007/978-3-540-68279-0\_15},
timestamp = {Wed, 14 Nov 2018 10:12:21 +0100},
biburl = {https://dblp.org/rec/books/daglib/p/HemmeckeKLW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LeeOW10,
author = {Jon Lee and
Shmuel Onn and
Robert Weismantel},
title = {Intractability of approximate multi-dimensional nonlinear optimization
on independence systems},
journal = {CoRR},
volume = {abs/1001.5056},
year = {2010},
url = {http://arxiv.org/abs/1001.5056},
eprinttype = {arXiv},
eprint = {1001.5056},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/LeeOW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1006-0773,
author = {Jon Lee and
Shmuel Onn and
Lyubov Romanchuk and
Robert Weismantel},
title = {The Quadratic Graver Cone, Quadratic Integer Minimization, and Extensions},
journal = {CoRR},
volume = {abs/1006.0773},
year = {2010},
url = {http://arxiv.org/abs/1006.0773},
eprinttype = {arXiv},
eprint = {1006.0773},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1006-0773.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1010-1834,
author = {Leo Liberti and
Beno{\^{\i}}t Masson and
Jon Lee and
Carlile Lavor and
Antonio Mucherino},
title = {On the number of solutions of the discretizable molecular distance
geometry problem},
journal = {CoRR},
volume = {abs/1010.1834},
year = {2010},
url = {http://arxiv.org/abs/1010.1834},
eprinttype = {arXiv},
eprint = {1010.1834},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1010-1834.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/LoeraLMO09,
author = {Jes{\'{u}}s A. De Loera and
Jon Lee and
Susan Margulies and
Shmuel Onn},
title = {Expressing Combinatorial Problems by Systems of Polynomial Equations
and Hilbert's Nullstellensatz},
journal = {Comb. Probab. Comput.},
volume = {18},
number = {4},
pages = {551--582},
year = {2009},
url = {https://doi.org/10.1017/S0963548309009894},
doi = {10.1017/S0963548309009894},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cpc/LoeraLMO09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/LoeraHLO09,
author = {Jes{\'{u}}s A. De Loera and
David C. Haws and
Jon Lee and
Allison O'Hair},
title = {Computation in multicriteria matroid optimization},
journal = {{ACM} J. Exp. Algorithmics},
volume = {14},
year = {2009},
url = {https://doi.org/10.1145/1498698.1658383},
doi = {10.1145/1498698.1658383},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/LoeraHLO09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/oms/BelottiLLMW09,
author = {Pietro Belotti and
Jon Lee and
Leo Liberti and
Fran{\c{c}}ois Margot and
Andreas W{\"{a}}chter},
title = {Branching and bounds tighteningtechniques for non-convex {MINLP}},
journal = {Optim. Methods Softw.},
volume = {24},
number = {4-5},
pages = {597--634},
year = {2009},
url = {https://doi.org/10.1080/10556780903087124},
doi = {10.1080/10556780903087124},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/oms/BelottiLLMW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/LeeOW09,
author = {Jon Lee and
Shmuel Onn and
Robert Weismantel},
title = {Approximate Nonlinear Optimization over Weighted Independence Systems},
journal = {{SIAM} J. Discret. Math.},
volume = {23},
number = {4},
pages = {1667--1681},
year = {2009},
url = {https://doi.org/10.1137/080718103},
doi = {10.1137/080718103},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/LeeOW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaim/LeeOW09,
author = {Jon Lee and
Shmuel Onn and
Robert Weismantel},
editor = {Andrew V. Goldberg and
Yunhong Zhou},
title = {Nonlinear Optimization over a Weighted Independence System},
booktitle = {Algorithmic Aspects in Information and Management, 5th International
Conference, {AAIM} 2009, San Francisco, CA, USA, June 15-17, 2009.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5564},
pages = {251--264},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-02158-9\_22},
doi = {10.1007/978-3-642-02158-9\_22},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aaim/LeeOW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/LeeSV09,
author = {Jon Lee and
Maxim Sviridenko and
Jan Vondr{\'{a}}k},
editor = {Irit Dinur and
Klaus Jansen and
Joseph Naor and
Jos{\'{e}} D. P. Rolim},
title = {Submodular Maximization over Multiple Matroids via Generalized Exchange
Properties},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5687},
pages = {244--257},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-03685-9\_19},
doi = {10.1007/978-3-642-03685-9\_19},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/LeeSV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colognetwente/Lee09,
author = {Jon Lee},
editor = {Sonia Cafieri and
Antonio Mucherino and
Giacomo Nannicini and
Fabien Tarissan and
Leo Liberti},
title = {On the Boundary of Tractability for Nonlinear Discrete Optimization},
booktitle = {Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial
Optimization, {CTW} 2009, Paris, France, June 2-4 2009},
pages = {373--383},
year = {2009},
url = {http://www.lix.polytechnique.fr/ctw09/ctw09-proceedings.pdf\#page=385},
timestamp = {Thu, 12 Mar 2020 11:34:41 +0100},
biburl = {https://dblp.org/rec/conf/colognetwente/Lee09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/DAmbrosioLW09,
author = {Claudia D'Ambrosio and
Jon Lee and
Andreas W{\"{a}}chter},
editor = {Amos Fiat and
Peter Sanders},
title = {A Global-Optimization Algorithm for Mixed-Integer Nonlinear Programs
Having Separable Non-convexity},
booktitle = {Algorithms - {ESA} 2009, 17th Annual European Symposium, Copenhagen,
Denmark, September 7-9, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5757},
pages = {107--118},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-04128-0\_10},
doi = {10.1007/978-3-642-04128-0\_10},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/DAmbrosioLW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LeeMNS09,
author = {Jon Lee and
Vahab S. Mirrokni and
Viswanath Nagarajan and
Maxim Sviridenko},
editor = {Michael Mitzenmacher},
title = {Non-monotone submodular maximization under matroid and knapsack constraints},
booktitle = {Proceedings of the 41st Annual {ACM} Symposium on Theory of Computing,
{STOC} 2009, Bethesda, MD, USA, May 31 - June 2, 2009},
pages = {323--332},
publisher = {{ACM}},
year = {2009},
url = {https://doi.org/10.1145/1536414.1536459},
doi = {10.1145/1536414.1536459},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/LeeMNS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0902-0353,
author = {Jon Lee and
Vahab S. Mirrokni and
Viswanath Nagarajan and
Maxim Sviridenko},
title = {Non-monotone submodular maximization under matroid and knapsack constraints},
journal = {CoRR},
volume = {abs/0902.0353},
year = {2009},
url = {http://arxiv.org/abs/0902.0353},
eprinttype = {arXiv},
eprint = {0902.0353},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0902-0353.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/BonamiBCCGLLLMSW08,
author = {Pierre Bonami and
Lorenz T. Biegler and
Andrew R. Conn and
G{\'{e}}rard Cornu{\'{e}}jols and
Ignacio E. Grossmann and
Carl D. Laird and
Jon Lee and
Andrea Lodi and
Fran{\c{c}}ois Margot and
Nicolas W. Sawaya and
Andreas W{\"{a}}chter},
title = {An algorithmic framework for convex mixed integer nonlinear programs},
journal = {Discret. Optim.},
volume = {5},
number = {2},
pages = {186--204},
year = {2008},
url = {https://doi.org/10.1016/j.disopt.2006.10.011},
doi = {10.1016/J.DISOPT.2006.10.011},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/disopt/BonamiBCCGLLLMSW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/LeeOW08,
author = {Jon Lee and
Shmuel Onn and
Robert Weismantel},
title = {On test sets for nonlinear integer maximization},
journal = {Oper. Res. Lett.},
volume = {36},
number = {4},
pages = {439--443},
year = {2008},
url = {https://doi.org/10.1016/j.orl.2008.02.002},
doi = {10.1016/J.ORL.2008.02.002},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/LeeOW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BersteinLMORWW08,
author = {Yael Berstein and
Jon Lee and
Hugo Maruri{-}Aguilar and
Shmuel Onn and
Eva Riccomagno and
Robert Weismantel and
Henry P. Wynn},
title = {Nonlinear Matroid Optimization and Experimental Design},
journal = {{SIAM} J. Discret. Math.},
volume = {22},
number = {3},
pages = {901--919},
year = {2008},
url = {https://doi.org/10.1137/070696465},
doi = {10.1137/070696465},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BersteinLMORWW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/SaxenaBL08,
author = {Anureet Saxena and
Pierre Bonami and
Jon Lee},
editor = {Andrea Lodi and
Alessandro Panconesi and
Giovanni Rinaldi},
title = {Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained
Programs},
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 = {17--33},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-68891-4\_2},
doi = {10.1007/978-3-540-68891-4\_2},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/ipco/SaxenaBL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/issac/LoeraLMM08,
author = {Jes{\'{u}}s A. De Loera and
Jon Lee and
Peter N. Malkin and
Susan Margulies},
editor = {J. Rafael Sendra and
Laureano Gonz{\'{a}}lez{-}Vega},
title = {Hilbert's nullstellensatz and an algorithm for proving combinatorial
infeasibility},
booktitle = {Symbolic and Algebraic Computation, International Symposium, {ISSAC}
2008, Linz/Hagenberg, Austria, July 20-23, 2008, Proceedings},
pages = {197--206},
publisher = {{ACM}},
year = {2008},
url = {https://doi.org/10.1145/1390768.1390797},
doi = {10.1145/1390768.1390797},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/issac/LoeraLMM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0805-0954,
author = {Jon Lee and
Shmuel Onn and
Robert Weismantel},
title = {Nonlinear Optimization over a Weighted Independence System},
journal = {CoRR},
volume = {abs/0805.0954},
year = {2008},
url = {http://arxiv.org/abs/0805.0954},
eprinttype = {arXiv},
eprint = {0805.0954},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0805-0954.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/Lee07,
author = {Jon Lee},
title = {In situ column generation for a cutting-stock problem},
journal = {Comput. Oper. Res.},
volume = {34},
number = {8},
pages = {2345--2358},
year = {2007},
url = {https://doi.org/10.1016/j.cor.2005.09.007},
doi = {10.1016/J.COR.2005.09.007},
timestamp = {Tue, 18 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cor/Lee07.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/ibmrd/Lee07,
author = {Jon Lee},
title = {Mixed-integer nonlinear programming: Some modeling and solution issues},
journal = {{IBM} J. Res. Dev.},
volume = {51},
number = {3/4},
pages = {489--497},
year = {2007},
url = {https://doi.org/10.1147/rd.513.0489},
doi = {10.1147/RD.513.0489},
timestamp = {Fri, 13 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ibmrd/Lee07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/informs/LeeM07,
author = {Jon Lee and
Fran{\c{c}}ois Margot},
title = {On a Binary-Encoded {ILP} Coloring Formulation},
journal = {{INFORMS} J. Comput.},
volume = {19},
number = {3},
pages = {406--415},
year = {2007},
url = {https://doi.org/10.1287/ijoc.1060.0178},
doi = {10.1287/IJOC.1060.0178},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/informs/LeeM07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/BurerL07,
author = {Samuel Burer and
Jon Lee},
title = {Solving maximum-entropy sampling problems using factored masks},
journal = {Math. Program.},
volume = {109},
number = {2-3},
pages = {263--281},
year = {2007},
url = {https://doi.org/10.1007/s10107-006-0024-1},
doi = {10.1007/S10107-006-0024-1},
timestamp = {Mon, 12 Feb 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/BurerL07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BersteinLMORWW07,
author = {Yael Berstein and
Jon Lee and
Hugo Maruri{-}Aguilar and
Shmuel Onn and
Eva Riccomagno and
Robert Weismantel and
Henry P. Wynn},
title = {Nonlinear Matroid Optimization and Experimental Design},
journal = {CoRR},
volume = {abs/0707.4618},
year = {2007},
url = {http://arxiv.org/abs/0707.4618},
eprinttype = {arXiv},
eprint = {0707.4618},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BersteinLMORWW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ited/LeeR06,
author = {Jon Lee and
John F. Raffensperger},
title = {Using {AMPL} for Teaching the {TSP}},
journal = {{INFORMS} Trans. Educ.},
volume = {7},
number = {1},
pages = {37--69},
year = {2006},
url = {https://doi.org/10.1287/ited.7.1.37},
doi = {10.1287/ITED.7.1.37},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ited/LeeR06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/BragalliDLLT06,
author = {Cristiana Bragalli and
Claudia D'Ambrosio and
Jon Lee and
Andrea Lodi and
Paolo Toth},
editor = {Yossi Azar and
Thomas Erlebach},
title = {An {MINLP} Solution Method for a Water Network Problem},
booktitle = {Algorithms - {ESA} 2006, 14th Annual European Symposium, Zurich, Switzerland,
September 11-13, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4168},
pages = {696--707},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11841036\_62},
doi = {10.1007/11841036\_62},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/BragalliDLLT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/LadanyiLL05,
author = {Laszlo Lad{\'{a}}nyi and
Jon Lee and
Robin Lougee{-}Heimer},
title = {Rapid Prototyping of Optimization Algorithms Using {COIN-OR:} {A}
Case Study Involving the Cutting-Stock Problem},
journal = {Ann. Oper. Res.},
volume = {139},
number = {1},
pages = {243--265},
year = {2005},
url = {https://doi.org/10.1007/s10479-005-3450-1},
doi = {10.1007/S10479-005-3450-1},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/LadanyiLL05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/CoppersmithL05,
author = {Don Coppersmith and
Jon Lee},
title = {Parsimonious binary-encoding in integer programming},
journal = {Discret. Optim.},
volume = {2},
number = {3},
pages = {190--200},
year = {2005},
url = {https://doi.org/10.1016/j.disopt.2005.06.001},
doi = {10.1016/J.DISOPT.2005.06.001},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/CoppersmithL05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LeeLV05,
author = {Jon Lee and
Janny Leung and
Sven de Vries},
title = {Separating Type-I Odd-Cycle Inequalities for a Binary-Encoded Edge-Coloring
Formulation},
journal = {J. Comb. Optim.},
volume = {9},
number = {1},
pages = {59--67},
year = {2005},
url = {https://doi.org/10.1007/s10878-005-5484-3},
doi = {10.1007/S10878-005-5484-3},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LeeLV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/LeeLM04,
author = {Jon Lee and
Janny Leung and
Fran{\c{c}}ois Margot},
title = {Min-up/min-down polytopes},
journal = {Discret. Optim.},
volume = {1},
number = {1},
pages = {77--85},
year = {2004},
url = {https://doi.org/10.1016/j.disopt.2003.12.001},
doi = {10.1016/J.DISOPT.2003.12.001},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/disopt/LeeLM04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/LeeM04,
author = {Jon Lee and
Fran{\c{c}}ois Margot},
editor = {George L. Nemhauser and
Daniel Bienstock},
title = {More on a Binary-Encoded Coloring Formulation},
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 = {271--282},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-25960-2\_21},
doi = {10.1007/978-3-540-25960-2\_21},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/ipco/LeeM04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Lee03,
author = {Jon Lee},
title = {Cropped Cubes},
journal = {J. Comb. Optim.},
volume = {7},
number = {2},
pages = {169--178},
year = {2003},
url = {https://doi.org/10.1023/A:1024475030446},
doi = {10.1023/A:1024475030446},
timestamp = {Mon, 12 Feb 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/Lee03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/LeeW03,
author = {Jon Lee and
Joy Williams},
title = {A linear integer programming bound for maximum-entropy sampling},
journal = {Math. Program.},
volume = {94},
number = {2-3},
pages = {247--256},
year = {2003},
url = {https://doi.org/10.1007/s10107-002-0318-x},
doi = {10.1007/S10107-002-0318-X},
timestamp = {Mon, 12 Feb 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/LeeW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Lee02,
author = {Jon Lee},
title = {All-Different Polytopes},
journal = {J. Comb. Optim.},
volume = {6},
number = {3},
pages = {335--352},
year = {2002},
url = {https://doi.org/10.1023/A:1014804110661},
doi = {10.1023/A:1014804110661},
timestamp = {Mon, 12 Feb 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/Lee02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/AnstreicherFLW01,
author = {Kurt M. Anstreicher and
Marcia Fampa and
Jon Lee and
Joy Williams},
title = {Maximum-entropy remote sampling},
journal = {Discret. Appl. Math.},
volume = {108},
number = {3},
pages = {211--226},
year = {2001},
url = {https://doi.org/10.1016/S0166-218X(00)00217-1},
doi = {10.1016/S0166-218X(00)00217-1},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/AnstreicherFLW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LeeW01,
author = {Jon Lee and
Dan Wilson},
title = {Polyhedral methods for piecewise-linear functions {I:} the lambda
method},
journal = {Discret. Appl. Math.},
volume = {108},
number = {3},
pages = {269--285},
year = {2001},
url = {https://doi.org/10.1016/S0166-218X(00)00216-X},
doi = {10.1016/S0166-218X(00)00216-X},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/LeeW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigecom/IyengarLC01,
author = {Vijay S. Iyengar and
Jon Lee and
Murray Campbell},
editor = {Michael P. Wellman and
Yoav Shoham},
title = {Evaluating multiple attribute items using queries},
booktitle = {Proceedings 3rd {ACM} Conference on Electronic Commerce (EC-2001),
Tampa, Florida, USA, October 14-17, 2001},
pages = {144--153},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/501158.501174},
doi = {10.1145/501158.501174},
timestamp = {Tue, 27 Nov 2018 11:56:48 +0100},
biburl = {https://dblp.org/rec/conf/sigecom/IyengarLC01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/Lee99,
author = {Jon Lee},
title = {Orienting Matroids Representable Over Both {GF(3)} and {GF(5)}},
journal = {Eur. J. Comb.},
volume = {20},
number = {8},
pages = {833--838},
year = {1999},
url = {https://doi.org/10.1006/eujc.1999.0308},
doi = {10.1006/EUJC.1999.0308},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/Lee99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/LeeS99,
author = {Jon Lee and
Matt Scobee},
title = {A Characterization of the Orientations of Ternary Matroids},
journal = {J. Comb. Theory, Ser. {B}},
volume = {77},
number = {2},
pages = {263--291},
year = {1999},
url = {https://doi.org/10.1006/jctb.1999.1914},
doi = {10.1006/JCTB.1999.1914},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/LeeS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/AnstreicherFLW99,
author = {Kurt M. Anstreicher and
Marcia Fampa and
Jon Lee and
Joy Williams},
title = {Using continuous nonlinear relaxations to solve. constrained maximum-entropy
sampling problems},
journal = {Math. Program.},
volume = {85},
number = {2},
pages = {221--240},
year = {1999},
url = {https://doi.org/10.1007/s101070050055},
doi = {10.1007/S101070050055},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/AnstreicherFLW99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/Hardin0L98,
author = {Jill Hardin and
Jon Lee and
Janny Leung},
title = {On the boolean-quadric packinguncapacitated facility-location polytope},
journal = {Ann. Oper. Res.},
volume = {83},
pages = {77--94},
year = {1998},
url = {https://doi.org/10.1023/A\%3A1018972400378},
doi = {10.1023/A\%3A1018972400378},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/Hardin0L98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/Lee98a,
author = {Jon Lee},
title = {Constrained Maximum-Entropy Sampling},
journal = {Oper. Res.},
volume = {46},
number = {5},
pages = {655--664},
year = {1998},
url = {https://doi.org/10.1287/opre.46.5.655},
doi = {10.1287/OPRE.46.5.655},
timestamp = {Tue, 31 Mar 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/Lee98a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/KoLS97,
author = {Chun{-}Wa Ko and
Jon Lee and
Einar Steingr{\'{\i}}msson},
title = {The volume of relaxed Boolean-quadric and cut polytopes},
journal = {Discret. Math.},
volume = {163},
number = {1-3},
pages = {293--298},
year = {1997},
url = {https://doi.org/10.1016/0012-365X(95)00343-U},
doi = {10.1016/0012-365X(95)00343-U},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/KoLS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamrev/Lee97,
author = {Jon Lee},
title = {Classroom Note: Hoffman's Circle Untangled},
journal = {{SIAM} Rev.},
volume = {39},
number = {1},
pages = {98--105},
year = {1997},
url = {https://doi.org/10.1137/S0036144595292991},
doi = {10.1137/S0036144595292991},
timestamp = {Tue, 29 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamrev/Lee97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/AnstreicherFLW96,
author = {Kurt M. Anstreicher and
Marcia Fampa and
Jon Lee and
Joy Williams},
editor = {William H. Cunningham and
S. Thomas McCormick and
Maurice Queyranne},
title = {Continuous Relaxations for Constrained Maximum-Entropy Sampling},
booktitle = {Integer Programming and Combinatorial Optimization, 5th International
{IPCO} Conference, Vancouver, British Columbia, Canada, June 3-5,
1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1084},
pages = {234--248},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61310-2\_18},
doi = {10.1007/3-540-61310-2\_18},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/ipco/AnstreicherFLW96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/KoLQ95,
author = {Chun{-}Wa Ko and
Jon Lee and
Maurice Queyranne},
title = {An Exact Algorithm for Maximum Entropy Sampling},
journal = {Oper. Res.},
volume = {43},
number = {4},
pages = {684--691},
year = {1995},
url = {https://doi.org/10.1287/opre.43.4.684},
doi = {10.1287/OPRE.43.4.684},
timestamp = {Tue, 31 Mar 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/KoLQ95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LeungL94,
author = {Janny Leung and
Jon Lee},
title = {More facets from fences for linear ordering and acyclic subgraph polytopes},
journal = {Discret. Appl. Math.},
volume = {50},
number = {2},
pages = {185--200},
year = {1994},
url = {https://doi.org/10.1016/0166-218X(92)00151-B},
doi = {10.1016/0166-218X(92)00151-B},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/LeungL94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LeeM94,
author = {Jon Lee and
Walter D. Morris Jr.},
title = {Geometric Comparison of Combinatorial Polytopes},
journal = {Discret. Appl. Math.},
volume = {55},
number = {2},
pages = {163--182},
year = {1994},
url = {https://doi.org/10.1016/0166-218X(94)90006-X},
doi = {10.1016/0166-218X(94)90006-X},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/LeeM94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/LeeR94,
author = {Jon Lee and
Jennifer Ryan},
title = {Local bipartite tur{\'{a}}n graphs and graph partitioning},
journal = {Networks},
volume = {24},
number = {3},
pages = {131--145},
year = {1994},
url = {https://doi.org/10.1002/net.3230240302},
doi = {10.1002/NET.3230240302},
timestamp = {Mon, 12 Feb 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/LeeR94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/DietrichLL93,
author = {Brenda L. Dietrich and
Jon Lee and
Yew Sing Lee},
title = {Order selection on a single machine with high set-up costs},
journal = {Ann. Oper. Res.},
volume = {43},
number = {7},
pages = {379--396},
year = {1993},
url = {https://doi.org/10.1007/BF02024936},
doi = {10.1007/BF02024936},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/DietrichLL93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/0001L93,
author = {Jon Lee and
Janny Leung},
title = {A comparison of two edge-coloring formulations},
journal = {Oper. Res. Lett.},
volume = {13},
number = {4},
pages = {215--223},
year = {1993},
url = {https://doi.org/10.1016/0167-6377(93)90043-G},
doi = {10.1016/0167-6377(93)90043-G},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/0001L93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/informs/LeeR92,
author = {Jon Lee and
Jennifer Ryan},
title = {Matroid Applications and Algorithms},
journal = {{INFORMS} J. Comput.},
volume = {4},
number = {1},
pages = {70--98},
year = {1992},
url = {https://doi.org/10.1287/ijoc.4.1.70},
doi = {10.1287/IJOC.4.1.70},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/informs/LeeR92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/Lee92,
author = {Jon Lee},
title = {On Constrained Bottleneck Extrema},
journal = {Oper. Res.},
volume = {40},
number = {4},
pages = {813--814},
year = {1992},
url = {https://doi.org/10.1287/opre.40.4.813},
doi = {10.1287/OPRE.40.4.813},
timestamp = {Tue, 31 Mar 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/Lee92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/AnstreicherLR92,
author = {Kurt M. Anstreicher and
Jon Lee and
Thomas F. Rutherford},
title = {Crashing a maximum-weight complementary basis},
journal = {Math. Program.},
volume = {54},
pages = {281--294},
year = {1992},
url = {https://doi.org/10.1007/BF01586055},
doi = {10.1007/BF01586055},
timestamp = {Mon, 12 Feb 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/AnstreicherLR92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Lee90,
author = {Jon Lee},
title = {Canonical equation sets for classes of concordant polytopes},
journal = {Discret. Appl. Math.},
volume = {28},
number = {3},
pages = {207--221},
year = {1990},
url = {https://doi.org/10.1016/0166-218X(90)90003-U},
doi = {10.1016/0166-218X(90)90003-U},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Lee90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Lee90,
author = {Jon Lee},
title = {The incidence structure of subspaces with well-scaled frames},
journal = {J. Comb. Theory, Ser. {B}},
volume = {50},
number = {2},
pages = {265--287},
year = {1990},
url = {https://doi.org/10.1016/0095-8956(90)90082-B},
doi = {10.1016/0095-8956(90)90082-B},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Lee90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/Lee90,
author = {Jon Lee},
title = {Characterizations of the Dimension for Classes of Concordant Polytopes},
journal = {Math. Oper. Res.},
volume = {15},
number = {1},
pages = {139--154},
year = {1990},
url = {https://doi.org/10.1287/moor.15.1.139},
doi = {10.1287/MOOR.15.1.139},
timestamp = {Mon, 12 Feb 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mor/Lee90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Lee90,
author = {Jon Lee},
title = {A Spectral Approach to Polyhedral Dimension},
journal = {Math. Program.},
volume = {47},
pages = {441--459},
year = {1990},
url = {https://doi.org/10.1007/BF01580874},
doi = {10.1007/BF01580874},
timestamp = {Mon, 12 Feb 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/Lee90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/Lee89,
author = {Jon Lee},
title = {Tur{\'{a}}n's Triangle Theorem and Binary Matroids},
journal = {Eur. J. Comb.},
volume = {10},
number = {1},
pages = {85--90},
year = {1989},
url = {https://doi.org/10.1016/S0195-6698(89)80036-8},
doi = {10.1016/S0195-6698(89)80036-8},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/Lee89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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 2024-03-05 02:34 CET 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:
