Optimization Online


Combinatorial Optimization Submissions - 2018

December 2018

Approximation Algorithms
An LP-based approximation algorithm for the covering-type k-violation linear program
Yotaro Takazawa, Shinji Mizuno, Tomonari Kitahara

Approximation Algorithms
Approximate Positive Correlated Distributions and Approximation Algorithms for D-optimal Design
Mohit Singh, Weijun Xie

Approximation Algorithms
A class of spectral bounds for Max k-cut
Miguel F. Anjos, José Neto

January 2018

Facets from Gadgets
Adam N. Letchford, Anh N. Vu

Iterative weighted thresholding method for sparse solution of underdetermined linear equations
Wenxing Zhu, Zilin Huang, Jianli Chen, Zheng Peng

Staircase Compatibility and its Applications in Scheduling and Piecewise Linearization
Andreas Bärmann, Thorsten Gellermann, Maximilian Merkert, Oskar Schneider

Graphs and Matroids
The Clique Problem with Multiple-Choice Constraints under a Cycle-Free Dependency Graph
Andreas Bärmann, Patrick Gemander, Maximilian Merkert

A polynomial time algorithm for the linearization problem of the QSPP and its applications
Renata Sotirov, Hu Hao

A Notion of Total Dual Integrality for Convex, Semidefinite, and Extended Formulations
Marcel de Carli Silva, Levent Tunçel

March 2018

Branch and Cut Algorithms
A new formulation for the Hamiltonian p-median problem
Tolga Bektaş, Luís Gouveia, Daniel Santos

Branch and Cut Algorithms
Exploring the Numerics of Branch-and-Cut for Mixed Integer Linear Optimization
Matthias Miltenberger, Ted Ralphs, Dan Steffy

Approximation Algorithms for D-optimal Design
Mohit Singh, Weijun Xie

Branch and Cut Algorithms
Computing the Spark: Mixed-Integer Programming for the (Vector) Matroid Girth Problem
Andreas M. Tillmann

On the Consistent Path Problem
Leonardo Lozano, David Bergman, Cole Smith

April 2018

Parity Polytopes and Binarization
Dominik Ermel, Matthias Walter

Improving the linear relaxation of maximum $k$-cut with semidefinite-based constraints
Vilmar Jefté Rodrigues de Sousa, Miguel F. Anjos, Sébastien Le Digabel

Approximation Algorithms
A linear bound on the integrality gap for Sum-Up Rounding in the presence of vanishing constraints
Paul Manns, Christian Kirches, Felix Lenders

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society