![](https://dblp.uni-trier.de./img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de./img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de./img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
default search action
Search dblp for Publications
export results for "toc:db/journals/mpc/mpc12.bht:"
@article{DBLP:journals/mpc/BastubbeL20, author = {Michael Bastubbe and Marco E. L{\"{u}}bbecke}, title = {A branch-and-price algorithm for capacitated hypergraph vertex separation}, journal = {Math. Program. Comput.}, volume = {12}, number = {1}, pages = {39--68}, year = {2020}, url = {https://doi.org/10.1007/s12532-019-00171-5}, doi = {10.1007/S12532-019-00171-5}, timestamp = {Thu, 19 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mpc/BastubbeL20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mpc/Berg20, author = {Ewout van den Berg}, title = {A hybrid quasi-Newton projected-gradient method with application to Lasso and basis-pursuit denoising}, journal = {Math. Program. Comput.}, volume = {12}, number = {1}, pages = {1--38}, year = {2020}, url = {https://doi.org/10.1007/s12532-019-00163-5}, doi = {10.1007/S12532-019-00163-5}, timestamp = {Fri, 14 May 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mpc/Berg20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mpc/BiPS20, author = {Shujun Bi and Shaohua Pan and Defeng Sun}, title = {A multi-stage convex relaxation approach to noisy structured low-rank matrix recovery}, journal = {Math. Program. Comput.}, volume = {12}, number = {4}, pages = {569--602}, year = {2020}, url = {https://doi.org/10.1007/s12532-020-00177-4}, doi = {10.1007/S12532-020-00177-4}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mpc/BiPS20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mpc/BienstockN20, author = {Daniel Bienstock and Giacomo Nannicini}, title = {Special issue forward: the 2018 Mixed Integer Programming workshop}, journal = {Math. Program. Comput.}, volume = {12}, number = {2}, pages = {131}, year = {2020}, url = {https://doi.org/10.1007/s12532-020-00187-2}, doi = {10.1007/S12532-020-00187-2}, timestamp = {Thu, 16 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mpc/BienstockN20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mpc/BowlySBM20, author = {Simon Bowly and Kate Smith{-}Miles and Davaatseren Baatar and Hans D. Mittelmann}, title = {Generation techniques for linear programming instances with controllable properties}, journal = {Math. Program. Comput.}, volume = {12}, number = {3}, pages = {389--415}, year = {2020}, url = {https://doi.org/10.1007/s12532-019-00170-6}, doi = {10.1007/S12532-019-00170-6}, timestamp = {Sat, 05 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mpc/BowlySBM20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mpc/CoeyLV20, author = {Chris Coey and Miles Lubin and Juan Pablo Vielma}, title = {Outer approximation with conic certificates for mixed-integer convex problems}, journal = {Math. Program. Comput.}, volume = {12}, number = {2}, pages = {249--293}, year = {2020}, url = {https://doi.org/10.1007/s12532-020-00178-3}, doi = {10.1007/S12532-020-00178-3}, timestamp = {Thu, 16 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mpc/CoeyLV20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mpc/FukasawaPY20, author = {Ricardo Fukasawa and Laurent Poirrier and Shenghao Yang}, title = {Split cuts from sparse disjunctions}, journal = {Math. Program. Comput.}, volume = {12}, number = {2}, pages = {295--335}, year = {2020}, url = {https://doi.org/10.1007/s12532-020-00180-9}, doi = {10.1007/S12532-020-00180-9}, timestamp = {Fri, 22 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mpc/FukasawaPY20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mpc/FuriniLMP20, author = {Fabio Furini and Ivana Ljubic and Enrico Malaguti and Paolo Paronuzzi}, title = {On integer and bilevel formulations for the \emph{k}-vertex cut problem}, journal = {Math. Program. Comput.}, volume = {12}, number = {2}, pages = {133--164}, year = {2020}, url = {https://doi.org/10.1007/s12532-019-00167-1}, doi = {10.1007/S12532-019-00167-1}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mpc/FuriniLMP20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mpc/KazachkovNBM20, author = {Aleksandr M. Kazachkov and Selvaprabu Nadarajah and Egon Balas and Fran{\c{c}}ois Margot}, title = {Partial hyperplane activation for generalized intersection cuts}, journal = {Math. Program. Comput.}, volume = {12}, number = {1}, pages = {69--107}, year = {2020}, url = {https://doi.org/10.1007/s12532-019-00166-2}, doi = {10.1007/S12532-019-00166-2}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mpc/KazachkovNBM20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mpc/KnuevenOW20, author = {Bernard Knueven and James Ostrowski and Jean{-}Paul Watson}, title = {A novel matching formulation for startup costs in unit commitment}, journal = {Math. Program. Comput.}, volume = {12}, number = {2}, pages = {225--248}, year = {2020}, url = {https://doi.org/10.1007/s12532-020-00176-5}, doi = {10.1007/S12532-020-00176-5}, timestamp = {Tue, 29 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mpc/KnuevenOW20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mpc/LegrainOR20, author = {Antoine Legrain and J{\'{e}}r{\'{e}}my Omer and Samuel Rosat}, title = {A rotation-based branch-and-price approach for the nurse scheduling problem}, journal = {Math. Program. Comput.}, volume = {12}, number = {3}, pages = {417--450}, year = {2020}, url = {https://doi.org/10.1007/s12532-019-00172-4}, doi = {10.1007/S12532-019-00172-4}, timestamp = {Fri, 07 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mpc/LegrainOR20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mpc/LiuzziLR20, author = {Giampaolo Liuzzi and Stefano Lucidi and Francesco Rinaldi}, title = {An algorithmic framework based on primitive directions and nonmonotone line searches for black-box optimization problems with integer variables}, journal = {Math. Program. Comput.}, volume = {12}, number = {4}, pages = {673--702}, year = {2020}, url = {https://doi.org/10.1007/s12532-020-00182-7}, doi = {10.1007/S12532-020-00182-7}, timestamp = {Fri, 23 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mpc/LiuzziLR20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mpc/PiaKS20, author = {Alberto Del Pia and Aida Khajavirad and Nikolaos V. Sahinidis}, title = {On the impact of running intersection inequalities for globally solving polynomial optimization problems}, journal = {Math. Program. Comput.}, volume = {12}, number = {2}, pages = {165--191}, year = {2020}, url = {https://doi.org/10.1007/s12532-019-00169-z}, doi = {10.1007/S12532-019-00169-Z}, timestamp = {Thu, 16 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mpc/PiaKS20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mpc/SalemiB20, author = {Hosseinali Salemi and Austin Buchanan}, title = {Parsimonious formulations for low-diameter clusters}, journal = {Math. Program. Comput.}, volume = {12}, number = {3}, pages = {493--528}, year = {2020}, url = {https://doi.org/10.1007/s12532-020-00175-6}, doi = {10.1007/S12532-020-00175-6}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mpc/SalemiB20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mpc/SchorkG20, author = {Lukas Schork and Jacek Gondzio}, title = {Implementation of an interior point method with basis preconditioning}, journal = {Math. Program. Comput.}, volume = {12}, number = {4}, pages = {603--635}, year = {2020}, url = {https://doi.org/10.1007/s12532-020-00181-8}, doi = {10.1007/S12532-020-00181-8}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mpc/SchorkG20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mpc/StellatoBGBB20, author = {Bartolomeo Stellato and Goran Banjac and Paul Goulart and Alberto Bemporad and Stephen P. Boyd}, title = {{OSQP:} an operator splitting solver for quadratic programs}, journal = {Math. Program. Comput.}, volume = {12}, number = {4}, pages = {637--672}, year = {2020}, url = {https://doi.org/10.1007/s12532-020-00179-2}, doi = {10.1007/S12532-020-00179-2}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mpc/StellatoBGBB20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mpc/SubramanyamGW20, author = {Anirudh Subramanyam and Chrysanthos E. Gounaris and Wolfram Wiesemann}, title = {\emph{K}-adaptability in two-stage mixed-integer robust optimization}, journal = {Math. Program. Comput.}, volume = {12}, number = {2}, pages = {193--224}, year = {2020}, url = {https://doi.org/10.1007/s12532-019-00174-2}, doi = {10.1007/S12532-019-00174-2}, timestamp = {Fri, 14 May 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mpc/SubramanyamGW20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mpc/TahernejadRD20, author = {Sahar Tahernejad and Ted K. Ralphs and Scott DeNegre}, title = {A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation}, journal = {Math. Program. Comput.}, volume = {12}, number = {4}, pages = {529--568}, year = {2020}, url = {https://doi.org/10.1007/s12532-020-00183-6}, doi = {10.1007/S12532-020-00183-6}, timestamp = {Fri, 23 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mpc/TahernejadRD20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mpc/Tran-DinhAFC20, author = {Quoc Tran{-}Dinh and Ahmet Alacaoglu and Olivier Fercoq and Volkan Cevher}, title = {An adaptive primal-dual framework for nonsmooth convex minimization}, journal = {Math. Program. Comput.}, volume = {12}, number = {3}, pages = {451--491}, year = {2020}, url = {https://doi.org/10.1007/s12532-019-00173-3}, doi = {10.1007/S12532-019-00173-3}, timestamp = {Fri, 07 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mpc/Tran-DinhAFC20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mpc/WangH20, author = {Guanglei Wang and Hassan L. Hijazi}, title = {Exploiting sparsity for the min \emph{k}-partition problem}, journal = {Math. Program. Comput.}, volume = {12}, number = {1}, pages = {109--130}, year = {2020}, url = {https://doi.org/10.1007/s12532-019-00165-3}, doi = {10.1007/S12532-019-00165-3}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mpc/WangH20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mpc/ZhouXQ20, author = {Shenglong Zhou and Naihua Xiu and Hou{-}Duo Qi}, title = {Robust Euclidean embedding via {EDM} optimization}, journal = {Math. Program. Comput.}, volume = {12}, number = {3}, pages = {337--387}, year = {2020}, url = {https://doi.org/10.1007/s12532-019-00168-0}, doi = {10.1007/S12532-019-00168-0}, timestamp = {Fri, 14 May 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mpc/ZhouXQ20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
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.