![](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
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 21 matches
- 2020
- Michael Bastubbe
, Marco E. Lübbecke
:
A branch-and-price algorithm for capacitated hypergraph vertex separation. Math. Program. Comput. 12(1): 39-68 (2020) - Ewout van den Berg:
A hybrid quasi-Newton projected-gradient method with application to Lasso and basis-pursuit denoising. Math. Program. Comput. 12(1): 1-38 (2020) - Shujun Bi, Shaohua Pan, Defeng Sun
:
A multi-stage convex relaxation approach to noisy structured low-rank matrix recovery. Math. Program. Comput. 12(4): 569-602 (2020) - Daniel Bienstock, Giacomo Nannicini:
Special issue forward: the 2018 Mixed Integer Programming workshop. Math. Program. Comput. 12(2): 131 (2020) - Simon Bowly
, Kate Smith-Miles, Davaatseren Baatar, Hans D. Mittelmann:
Generation techniques for linear programming instances with controllable properties. Math. Program. Comput. 12(3): 389-415 (2020) - Chris Coey, Miles Lubin, Juan Pablo Vielma:
Outer approximation with conic certificates for mixed-integer convex problems. Math. Program. Comput. 12(2): 249-293 (2020) - Ricardo Fukasawa, Laurent Poirrier, Shenghao Yang
:
Split cuts from sparse disjunctions. Math. Program. Comput. 12(2): 295-335 (2020) - Fabio Furini
, Ivana Ljubic
, Enrico Malaguti, Paolo Paronuzzi
:
On integer and bilevel formulations for the k-vertex cut problem. Math. Program. Comput. 12(2): 133-164 (2020) - Aleksandr M. Kazachkov
, Selvaprabu Nadarajah, Egon Balas, François Margot:
Partial hyperplane activation for generalized intersection cuts. Math. Program. Comput. 12(1): 69-107 (2020) - Bernard Knueven, James Ostrowski
, Jean-Paul Watson:
A novel matching formulation for startup costs in unit commitment. Math. Program. Comput. 12(2): 225-248 (2020) - Antoine Legrain, Jérémy Omer, Samuel Rosat:
A rotation-based branch-and-price approach for the nurse scheduling problem. Math. Program. Comput. 12(3): 417-450 (2020) - Giampaolo Liuzzi, Stefano Lucidi, Francesco Rinaldi:
An algorithmic framework based on primitive directions and nonmonotone line searches for black-box optimization problems with integer variables. Math. Program. Comput. 12(4): 673-702 (2020) - Alberto Del Pia, Aida Khajavirad, Nikolaos V. Sahinidis:
On the impact of running intersection inequalities for globally solving polynomial optimization problems. Math. Program. Comput. 12(2): 165-191 (2020) - Hosseinali Salemi
, Austin Buchanan
:
Parsimonious formulations for low-diameter clusters. Math. Program. Comput. 12(3): 493-528 (2020) - Lukas Schork, Jacek Gondzio
:
Implementation of an interior point method with basis preconditioning. Math. Program. Comput. 12(4): 603-635 (2020) - Bartolomeo Stellato
, Goran Banjac
, Paul Goulart, Alberto Bemporad, Stephen P. Boyd:
OSQP: an operator splitting solver for quadratic programs. Math. Program. Comput. 12(4): 637-672 (2020) - Anirudh Subramanyam, Chrysanthos E. Gounaris, Wolfram Wiesemann:
K-adaptability in two-stage mixed-integer robust optimization. Math. Program. Comput. 12(2): 193-224 (2020) - Sahar Tahernejad, Ted K. Ralphs, Scott DeNegre:
A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation. Math. Program. Comput. 12(4): 529-568 (2020) - Quoc Tran-Dinh, Ahmet Alacaoglu, Olivier Fercoq, Volkan Cevher:
An adaptive primal-dual framework for nonsmooth convex minimization. Math. Program. Comput. 12(3): 451-491 (2020) - Guanglei Wang, Hassan L. Hijazi
:
Exploiting sparsity for the min k-partition problem. Math. Program. Comput. 12(1): 109-130 (2020) - Shenglong Zhou
, Naihua Xiu, Hou-Duo Qi
:
Robust Euclidean embedding via EDM optimization. Math. Program. Comput. 12(3): 337-387 (2020)
loading more results
failed to load more results, please try again later
![](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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-07-13 06:40 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint