Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/mpc/mpc10.bht:"
@article{DBLP:journals/mpc/AvisJ18, author = {David Avis and Charles Jordan}, title = {mplrs: {A} scalable parallel vertex/facet enumeration code}, journal = {Math. Program. Comput.}, volume = {10}, number = {2}, pages = {267--302}, year = {2018}, url = {https://doi.org/10.1007/s12532-017-0129-y}, doi = {10.1007/S12532-017-0129-Y}, timestamp = {Fri, 08 Jun 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mpc/AvisJ18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mpc/BensonS18, author = {Hande Y. Benson and David F. Shanno}, title = {Cubic regularization in symmetric rank-1 quasi-Newton methods}, journal = {Math. Program. Comput.}, volume = {10}, number = {4}, pages = {457--486}, year = {2018}, url = {https://doi.org/10.1007/s12532-018-0136-7}, doi = {10.1007/S12532-018-0136-7}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mpc/BensonS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mpc/BonamiGL18, author = {Pierre Bonami and Oktay G{\"{u}}nl{\"{u}}k and Jeff T. Linderoth}, title = {Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods}, journal = {Math. Program. Comput.}, volume = {10}, number = {3}, pages = {333--382}, year = {2018}, url = {https://doi.org/10.1007/s12532-018-0133-x}, doi = {10.1007/S12532-018-0133-X}, timestamp = {Tue, 29 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mpc/BonamiGL18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mpc/CostaN18, author = {Alberto Costa and Giacomo Nannicini}, title = {RBFOpt: an open-source library for black-box optimization with costly function evaluations}, journal = {Math. Program. Comput.}, volume = {10}, number = {4}, pages = {597--629}, year = {2018}, url = {https://doi.org/10.1007/s12532-018-0144-7}, doi = {10.1007/S12532-018-0144-7}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mpc/CostaN18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mpc/FischerP18, author = {Tobias Fischer and Marc E. Pfetsch}, title = {Branch-and-cut for linear programs with overlapping {SOS1} constraints}, journal = {Math. Program. Comput.}, volume = {10}, number = {1}, pages = {33--68}, year = {2018}, url = {https://doi.org/10.1007/s12532-017-0122-5}, doi = {10.1007/S12532-017-0122-5}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mpc/FischerP18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mpc/FukasawaPX18, author = {Ricardo Fukasawa and Laurent Poirrier and {\'{A}}linson S. Xavier}, title = {Intersection cuts for single row corner relaxations}, journal = {Math. Program. Comput.}, volume = {10}, number = {3}, pages = {423--455}, year = {2018}, url = {https://doi.org/10.1007/s12532-018-0132-y}, doi = {10.1007/S12532-018-0132-Y}, timestamp = {Sat, 28 Oct 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mpc/FukasawaPX18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mpc/HuangfuH18, author = {Qi Huangfu and J. A. J. Hall}, title = {Parallelizing the dual revised simplex method}, journal = {Math. Program. Comput.}, volume = {10}, number = {1}, pages = {119--142}, year = {2018}, url = {https://doi.org/10.1007/s12532-017-0130-5}, doi = {10.1007/S12532-017-0130-5}, timestamp = {Fri, 31 Jan 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mpc/HuangfuH18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mpc/JuhlWWZ18, author = {Daniel Juhl and David M. Warme and Pawel Winter and Martin Zachariasen}, title = {The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study}, journal = {Math. Program. Comput.}, volume = {10}, number = {4}, pages = {487--532}, year = {2018}, url = {https://doi.org/10.1007/s12532-018-0135-8}, doi = {10.1007/S12532-018-0135-8}, timestamp = {Wed, 07 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mpc/JuhlWWZ18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mpc/KhajaviradS18, author = {Aida Khajavirad and Nikolaos V. Sahinidis}, title = {A hybrid {LP/NLP} paradigm for global optimization relaxations}, journal = {Math. Program. Comput.}, volume = {10}, number = {3}, pages = {383--421}, year = {2018}, url = {https://doi.org/10.1007/s12532-018-0138-5}, doi = {10.1007/S12532-018-0138-5}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mpc/KhajaviradS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mpc/KimZ18, author = {Kibaek Kim and Victor M. Zavala}, title = {Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs}, journal = {Math. Program. Comput.}, volume = {10}, number = {2}, pages = {225--266}, year = {2018}, url = {https://doi.org/10.1007/s12532-017-0128-z}, doi = {10.1007/S12532-017-0128-Z}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mpc/KimZ18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mpc/KnuevenOP18, author = {Ben Knueven and Jim Ostrowski and Sebastian Pokutta}, title = {Detecting almost symmetries of graphs}, journal = {Math. Program. Comput.}, volume = {10}, number = {2}, pages = {143--185}, year = {2018}, url = {https://doi.org/10.1007/s12532-017-0124-3}, doi = {10.1007/S12532-017-0124-3}, timestamp = {Fri, 04 Jan 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mpc/KnuevenOP18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mpc/KocukDS18, author = {Burak Kocuk and Santanu S. Dey and Xu Andy Sun}, title = {Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the {AC} optimal power flow problem}, journal = {Math. Program. Comput.}, volume = {10}, number = {4}, pages = {557--596}, year = {2018}, url = {https://doi.org/10.1007/s12532-018-0150-9}, doi = {10.1007/S12532-018-0150-9}, timestamp = {Mon, 15 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mpc/KocukDS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mpc/LarsonW18, author = {Jeffrey Larson and Stefan M. Wild}, title = {Asynchronously parallel optimization solver for finding multiple minima}, journal = {Math. Program. Comput.}, volume = {10}, number = {3}, pages = {303--332}, year = {2018}, url = {https://doi.org/10.1007/s12532-017-0131-4}, doi = {10.1007/S12532-017-0131-4}, timestamp = {Wed, 20 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mpc/LarsonW18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mpc/LiST18, author = {Xudong Li and Defeng Sun and Kim{-}Chuan Toh}, title = {{QSDPNAL:} a two-phase augmented Lagrangian method for convex quadratic semidefinite programming}, journal = {Math. Program. Comput.}, volume = {10}, number = {4}, pages = {703--743}, year = {2018}, url = {https://doi.org/10.1007/s12532-018-0137-6}, doi = {10.1007/S12532-018-0137-6}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mpc/LiST18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mpc/NicholsonSWZB18, author = {Bethany Nicholson and John D. Siirola and Jean{-}Paul Watson and Victor M. Zavala and Lorenz T. Biegler}, title = {pyomo.dae: a modeling and automatic discretization framework for optimization with differential and algebraic equations}, journal = {Math. Program. Comput.}, volume = {10}, number = {2}, pages = {187--223}, year = {2018}, url = {https://doi.org/10.1007/s12532-017-0127-0}, doi = {10.1007/S12532-017-0127-0}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mpc/NicholsonSWZB18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mpc/OliveiraWX18, author = {Danilo Elias Oliveira and Henry Wolkowicz and Yangyang Xu}, title = {{ADMM} for the {SDP} relaxation of the {QAP}}, journal = {Math. Program. Comput.}, volume = {10}, number = {4}, pages = {631--658}, year = {2018}, url = {https://doi.org/10.1007/s12532-018-0148-3}, doi = {10.1007/S12532-018-0148-3}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mpc/OliveiraWX18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mpc/PajorUW18, author = {Thomas Pajor and Eduardo Uchoa and Renato F. Werneck}, title = {A robust and scalable algorithm for the Steiner problem in graphs}, journal = {Math. Program. Comput.}, volume = {10}, number = {1}, pages = {69--118}, year = {2018}, url = {https://doi.org/10.1007/s12532-017-0123-4}, doi = {10.1007/S12532-017-0123-4}, timestamp = {Wed, 25 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mpc/PajorUW18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mpc/RudinE18, author = {Cynthia Rudin and Seyda Ertekin}, title = {Learning customized and optimized lists of rules with mathematical programming}, journal = {Math. Program. Comput.}, volume = {10}, number = {4}, pages = {659--702}, year = {2018}, url = {https://doi.org/10.1007/s12532-018-0143-8}, doi = {10.1007/S12532-018-0143-8}, timestamp = {Thu, 15 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mpc/RudinE18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mpc/WeisserLT18, author = {Tillmann Wei{\ss}er and Jean B. Lasserre and Kim{-}Chuan Toh}, title = {Sparse-BSOS: a bounded degree {SOS} hierarchy for large scale polynomial optimization with sparsity}, journal = {Math. Program. Comput.}, volume = {10}, number = {1}, pages = {1--32}, year = {2018}, url = {https://doi.org/10.1007/s12532-017-0121-6}, doi = {10.1007/S12532-017-0121-6}, timestamp = {Fri, 06 Apr 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mpc/WeisserLT18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mpc/XiaoCL18, author = {Yunhai Xiao and Liang Chen and Donghui Li}, title = {A generalized alternating direction method of multipliers with semi-proximal terms for convex composite conic programming}, journal = {Math. Program. Comput.}, volume = {10}, number = {4}, pages = {533--555}, year = {2018}, url = {https://doi.org/10.1007/s12532-018-0134-9}, doi = {10.1007/S12532-018-0134-9}, timestamp = {Fri, 27 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mpc/XiaoCL18.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.