Volume 183, Issue 1-2

Search all Mathematical Programming articles

September 2020

Special Issue: Integer Programming and Combinatorial Optimization (IPCO) 2019

Issue Editors:

Andrea Lodi,
Viswanath Nagarajan

23 articles in this issue

Preface

Preface 24 July 2020 Pages: 1 - 1
Strong mixed-integer programming formulations for trained neural networks
Ross Anderson
Joey Huchette
Juan Pablo Vielma
Full Length Paper 13 February 2020 Pages: 3 - 39
Extended formulations from communication protocols in output-efficient time
Manuel Aprile
Yuri Faenza
Full Length Paper 03 July 2020 Pages: 41 - 59
Symmetry-breaking inequalities for ILP with structured sub-symmetry
Pascale Bendotti
Pierre Fouilhoux
Cécile Rottner
Full Length Paper 30 March 2020 Pages: 61 - 103
Outer-product-free sets for polynomial optimization and oracle-based cuts
Daniel Bienstock
Chen Chen
Gonzalo Muñoz
Full Length Paper 28 February 2020 Pages: 105 - 148
Online submodular maximization: beating 1/2 made simple
Niv Buchbinder
Moran Feldman
Mohit Garg
Full Length Paper 03 January 2020 Pages: 149 - 169
Improving the integrality gap for multiway cut
Kristóf Bérczi
Karthekeyan Chandrasekaran
Vivek Madan
Full Length Paper 06 March 2020 Pages: 171 - 193
\(\ell _1\)-Sparsity approximation bounds for packing integer programs
Chandra Chekuri
Kent Quanrud
Manuel R. Torres
Full Length Paper 13 February 2020 Pages: 195 - 214
A general framework for handling commitment in online throughput maximization
Lin Chen
Franziska Eberle
Cliff Stein
Full Length Paper Open access 03 February 2020 Pages: 215 - 247
An exact approach for the bilevel knapsack problem with interdiction constraints and extensions
Federico Della Croce
Rosario Scatamacchia
Full Length Paper 26 February 2020 Pages: 249 - 281
A computational study of exact subgraph based SDP bounds for Max-Cut, stable set and coloring
Elisabeth Gaar
Franz Rendl
Full Length Paper Open access 25 May 2020 Pages: 283 - 308
Dynamic flows with adaptive route choice
Lukas Graf
Tobias Harks
Leon Sering
Full Length Paper Open access 04 May 2020 Pages: 309 - 335
On compact representations of Voronoi cells of lattices
Christoph Hunkenschröder
Gina Reuland
Matthias Schymura
Full Length Paper 02 January 2020 Pages: 337 - 358
An efficient characterization of submodular spanning tree games
Zhuan Khye Koh
Laura Sanità
Full Length Paper Open access 25 April 2020 Pages: 359 - 377
The asymmetric traveling salesman path LP has constant integrality ratio
Anna Köhne
Vera Traub
Jens Vygen
Full Length Paper 26 November 2019 Pages: 379 - 395
Approximate multi-matroid intersection via iterative refinement
André Linhares
Neil Olver
Rico Zenklusen
Full Length Paper 15 June 2020 Pages: 397 - 418
An exact algorithm for robust influence maximization
Giacomo Nannicini
Giorgio Sartor
Roberto Wolfler Calvo
Full Length Paper 19 May 2020 Pages: 419 - 453
A new contraction technique with applications to congruency-constrained cuts
Martin Nägele
Rico Zenklusen
Full Length Paper 15 April 2020 Pages: 455 - 481
A generic exact solver for vehicle routing and related problems
Artur Pessoa
Ruslan Sadykov
François Vanderbeck
Full Length Paper 25 June 2020 Pages: 483 - 523
Linear programming using limited-precision oracles
Ambros Gleixner
Daniel E. Steffy
Full Length Paper 19 November 2019 Pages: 525 - 554
Computing the nucleolus of weighted cooperative matching games in polynomial time
Jochen Könemann
Kanstantsin Pashkovich
Justin Toth
Full Length Paper 28 February 2020 Pages: 555 - 581
Breaking symmetries to rescue sum of squares in the case of makespan scheduling
Victor Verdugo
José Verschae
Andreas Wiese
Full Length Paper 14 May 2020 Pages: 583 - 618
Random projections for quadratic programs
Claudia D’Ambrosio
Leo Liberti
Ky Vu
Full Length Paper 06 June 2020 Pages: 619 - 647

Volume 183, Issue 1-2

Search

Navigation