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