default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 218
Volume 218, Number 1, July 2026
Special Issue: The MINLP Hatchery
- Leo Liberti, Sebastian Sager, Angelika Wiegele:
Preface. 1-3 - Mohit Tawarmalani
:
New finite relaxation hierarchies for concavo-convex, disjoint bilinear programs, and facial disjunctions. 5-55 - Jan Kronqvist, Ruth Misener, Calvin Tsay:
P-split formulations: a class of intermediate formulations between big-M and convex hull for disjunctive constraints. 57-94 - Markus Gabl, Kurt M. Anstreicher:
Solving nonconvex optimization problems using outer approximations of the set-copositive cone. 95-118 - Lennart Sinjorgo, Renata Sotirov, Miguel F. Anjos:
Cuts and semidefinite liftings for the complex cut polytope. 119-168 - Antonio De Rosa, Aida Khajavirad:
Explicit convex hull description of bivariate quadratic sets with indicator variables. 169-211 - Christoph Buchheim, Maximilian Merkert:
Extended formulations for control languages defined by finite-state automata. 213-243 - Sven Leyffer, Paul Manns:
McCormick envelopes in mixed-integer PDE-constrained optimization. 245-290 - Aaresh Bhathena, Salar Fattahi, Andrés Gómez, Simge Küçükyavuz:
A parametric approach for solving convex quadratic optimization with indicators over trees. 291-336 - Gabriel Ponte, Marcia Fampa, Jon Lee:
Branch-and-bound for integer D-optimality with fast local search and variable-bound tightening. 337-374 - Peijing Liu, Alper Atamtürk, Andrés Gómez, Simge Küçükyavuz:
Polyhedral analysis of quadratic optimization problems with Stieltjes matrices and indicators. 375-401 - Johannes Thürauf, Julia Grübel, Martin Schmidt:
Adjustable robust nonlinear network design without controllable elements under load scenario uncertainties. 403-437 - Henri Lefebvre, Enrico Malaguti, Michele Monaci:
Exact approaches for convex adjustable robust optimization. 439-476 - Arne Heimendahl, Moritz Lücke, Frank Vallentin, Marc Christian Zimmermann:
A semidefinite program for least distortion embeddings of flat tori into Hilbert spaces. 477-504 - Daniel Brosch, Diane Puges:
Getting to the root of the problem: sums of squares for limits of trees. 505-561 - Bernd Mulansky, Andreas Potschka:
A zonogon approach for computing small convex polygons of maximum perimeter. 563-589 - Sven Leyffer, Paul Manns:
Correction: McCormick envelopes in mixed-integer PDE-constrained optimization. 591-592 - Bernd Mulansky, Andreas Potschka:
Correction: A zonogon approach for computing small convex polygons of maximum perimeter. 593-596
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 2026-09-02 23:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
