Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Integer Programming and Combinatorial Optimization: 20th International Conference, IPCO 2019, Ann Arbor, MI, USA, May 22-24, 2019, Proceedings > Intersection Cuts for Polynomial Optimization
Integer Programming and Combinatorial Optimization: 20th International Conference, IPCO 2019, Ann Arbor, MI, USA, May 22-24, 2019, Proceedings |
Andrea Lodi; Viswanath Nagarajan
Springer International Publishing
Integer Programming and Combinatorial Optimization: 20th International Conference, IPCO 2019, Ann Arbor, MI, USA, May 22-24, 2019, Proceedings
Intersection Cuts for Polynomial Optimization
Authors

Daniel Bienstock; Chen Chen; Gonzalo Muñoz

ARI Id

1665181509960_5190981

Access

Not Available Free

Pages

72-87

DOI

10.1007/978-3-030-17953-3_6

Chapter URL

https://rd.springer.com/chapter/10.1007/978-3-030-17953-3_6

Table of Contents of Book
Showing 1 to 20 of 35 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
i-xi
Identically Self-blocking Clutters
Ahmad Abdi; Gérard Cornuéjols; Dabeen Lee
1-12
Min-Max Correlation Clustering via MultiCut
Saba Ahmadi; Samir Khuller; Barna Saha
13-26
Strong Mixed-Integer Programming Formulations for Trained Neural Networks
Ross Anderson; Joey Huchette; Christian Tjandraatmadja; Juan Pablo Vielma
27-42
Extended Formulations from Communication Protocols in Output-Efficient Time
Manuel Aprile; Yuri Faenza
43-56
Sub-Symmetry-Breaking Inequalities for ILP with Structured Symmetry
Pascale Bendotti; Pierre Fouilhoux; Cécile Rottner
57-71
Intersection Cuts for Polynomial Optimization
Daniel Bienstock; Chen Chen; Gonzalo Muñoz
72-87
Fixed-Order Scheduling on Parallel Machines
Thomas Bosman; Dario Frascaria; Neil Olver; René Sitters; Leen Stougie
88-100
Online Submodular Maximization: Beating 1/2 Made Simple
Niv Buchbinder; Moran Feldman; Yuval Filmus; Mohit Garg
101-114
Improving the Integrality Gap for Multiway Cut
Kristóf Bérczi; Karthekeyan Chandrasekaran; Tamás Király; Vivek Madan
115-127
\(\ell _1\) -sparsity Approximation Bounds for Packing Integer Programs
Chandra Chekuri; Kent Quanrud; Manuel R. Torres
128-140
A General Framework for Handling Commitment in Online Throughput Maximization
Lin Chen; Franziska Eberle; Nicole Megow; Kevin Schewior; Cliff Stein
141-154
Lower Bounds and a New Exact Approach for the Bilevel Knapsack with Interdiction Constraints
Federico Della Croce; Rosario Scatamacchia
155-167
On Friedmann’s Subexponential Lower Bound for Zadeh’s Pivot Rule
Yann Disser; Alexander V. Hopp
168-180
Tight Approximation Ratio for Minimum Maximal Matching
Szymon Dudycz; Mateusz Lewandowski; Jan Marcinkowski
181-193
Integer Programming and Incidence Treedepth
Eduard Eiben; Robert Ganian; Dušan Knop; Sebastian Ordyniak; Michał Pilipczuk; Marcin Wrochna
194-204
A Bundle Approach for SDPs with Exact Subgraph Constraints
Elisabeth Gaar; Franz Rendl
205-218
Dynamic Flows with Adaptive Route Choice
Lukas Graf; Tobias Harks
219-232
The Markovian Price of Information
Anupam Gupta; Haotian Jiang; Ziv Scully; Sahil Singla
233-246
On Perturbation Spaces of Minimal Valid Functions: Inverse Semigroup Theory and Equivariant Decomposition Theorem
Robert Hildebrand; Matthias Köppe; Yuan Zhou
247-260
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 35 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings