![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.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 23 matches
- 2020
- Ross Anderson, Joey Huchette
, Will Ma
, Christian Tjandraatmadja, Juan Pablo Vielma:
Strong mixed-integer programming formulations for trained neural networks. Math. Program. 183(1): 3-39 (2020) - Manuel Aprile
, Yuri Faenza:
Extended formulations from communication protocols in output-efficient time. Math. Program. 183(1): 41-59 (2020) - Pascale Bendotti
, Pierre Fouilhoux, Cécile Rottner:
Symmetry-breaking inequalities for ILP with structured sub-symmetry. Math. Program. 183(1): 61-103 (2020) - Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Vivek Madan:
Improving the integrality gap for multiway cut. Math. Program. 183(1): 171-193 (2020) - Daniel Bienstock, Chen Chen
, Gonzalo Muñoz
:
Outer-product-free sets for polynomial optimization and oracle-based cuts. Math. Program. 183(1): 105-148 (2020) - Niv Buchbinder
, Moran Feldman
, Yuval Filmus
, Mohit Garg
:
Online submodular maximization: beating 1/2 made simple. Math. Program. 183(1): 149-169 (2020) - Chandra Chekuri, Kent Quanrud, Manuel R. Torres
:
ℓ 1-Sparsity approximation bounds for packing integer programs. Math. Program. 183(1): 195-214 (2020) - Lin Chen
, Franziska Eberle
, Nicole Megow
, Kevin Schewior
, Clifford Stein
:
A general framework for handling commitment in online throughput maximization. Math. Program. 183(1): 215-247 (2020) - Federico Della Croce
, Rosario Scatamacchia:
An exact approach for the bilevel knapsack problem with interdiction constraints and extensions. Math. Program. 183(1): 249-281 (2020) - Claudia D'Ambrosio, Leo Liberti
, Pierre-Louis Poirion, Ky Khac Vu:
Random projections for quadratic programs. Math. Program. 183(1): 619-647 (2020) - Elisabeth Gaar
, Franz Rendl
:
A computational study of exact subgraph based SDP bounds for Max-Cut, stable set and coloring. Math. Program. 183(1): 283-308 (2020) - Ambros M. Gleixner
, Daniel E. Steffy
:
Linear programming using limited-precision oracles. Math. Program. 183(1): 525-554 (2020) - Lukas Graf
, Tobias Harks, Leon Sering
:
Dynamic flows with adaptive route choice. Math. Program. 183(1): 309-335 (2020) - Christoph Hunkenschröder
, Gina Reuland, Matthias Schymura
:
On compact representations of Voronoi cells of lattices. Math. Program. 183(1): 337-358 (2020) - Zhuan Khye Koh, Laura Sanità:
An efficient characterization of submodular spanning tree games. Math. Program. 183(1): 359-377 (2020) - Anna Köhne, Vera Traub
, Jens Vygen:
The asymmetric traveling salesman path LP has constant integrality ratio. Math. Program. 183(1): 379-395 (2020) - Jochen Könemann, Kanstantsin Pashkovich, Justin Toth
:
Computing the nucleolus of weighted cooperative matching games in polynomial time. Math. Program. 183(1): 555-581 (2020) - André Linhares, Neil Olver, Chaitanya Swamy
, Rico Zenklusen:
Approximate multi-matroid intersection via iterative refinement. Math. Program. 183(1): 397-418 (2020) - Martin Nägele
, Rico Zenklusen:
A new contraction technique with applications to congruency-constrained cuts. Math. Program. 183(1): 455-481 (2020) - Giacomo Nannicini, Giorgio Sartor, Emiliano Traversi
, Roberto Wolfler Calvo:
An exact algorithm for robust influence maximization. Math. Program. 183(1): 419-453 (2020) - Artur Alves Pessoa, Ruslan Sadykov
, Eduardo Uchoa
, François Vanderbeck:
A generic exact solver for vehicle routing and related problems. Math. Program. 183(1): 483-523 (2020) - Victor Verdugo
, José Verschae, Andreas Wiese
:
Breaking symmetries to rescue sum of squares in the case of makespan scheduling. Math. Program. 183(1): 583-618 (2020) - Preface. Math. Program. 183(1): 1 (2020)
loading more results
failed to load more results, please try again later
![](https://dblp1.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-05 09:28 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