Optimization Online


Combinatorial Optimization Submissions - 2017

January 2017

Fooling Sets and the Spanning Tree Polytope
Kaveh Khoshkhah, Dirk Oliver Theis

The (minimum) rank of typical fooling-set matrices
Mozhgan Pourmoradnasseri, Dirk Oliver Theis

Approximation Algorithms
An approximation algorithm for the partial covering 0-1 integer program
Yotaro Takazawa, Shinji Mizuno, Tomonari Kitahara

March 2017

Dynamic programming algorithms, efficient solution of the LP-relaxation and approximation schemes for the Penalized Knapsack Problem
Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia

Graphs and Matroids
On Matroid Parity and Matching Polytopes
Konstantinos Kaparis, Adam Letchford, Ioannis Mourtos

Approximation Algorithms
A Novel Approach for Solving Convex Problems with Cardinality Constraints
Goran Banjac, Paul Goulart

May 2017

Branch and Cut Algorithms
A Branch-and-Cut Algorithm for Discrete Bilevel Linear Programs
Junlong Zhang, Osman Y. Ozaltin

June 2017

Complexity of the Min-up/min-down Unit Commitment Problem
Pascale Bendotti, Pierre Fouilhoux, Cécile Rottner

Structure and Interpretation of Dual-Feasible Functions
Matthias Köppe, Jiawei Wang

July 2017

Improved Space-State Relaxation for Constrained Two-Dimensional Guillotine Cutting Problems
André Velasco, Eduardo Uchoa

Approximation Algorithms
Toward breaking the curse of dimensionality: an FPTAS for stochastic dynamic programs with multidimensional action and scalar state
Nir Halman, Giacomo Nannicini

August 2017

The Traveling Salesperson Problem with Forbidden Neighborhoods on Regular 3D Grids
Anja Fischer, Philipp Hungerländer, Anna Jellen

Closed Almost Knight's Tours on 2D and 3D Chessboards
Michael Firstein, Anja Fischer, Philipp Hungerländer

Approximation Algorithms
An improved approximation algorithm for the covering 0-1 integer program
Yotaro Takazawa, Shinji Mizuno, Tomonari Kitahara

Graphs and Matroids
Matroid Optimization Problems with Monotone Monomials in the Objective
Anja Fischer, Frank Fischer, S. Thomas McCormick

Optimized Assignment Patterns in Mobile Edge Cloud Networks
Alberto Ceselli, Marco Fiore, Marco Premoli, Stefano Secci

September 2017

Approximation Algorithms
Two-Dimensional Maximum p-Coverage Problem with Partial Coverage
Manish Bansal

Comparative Analysis of Capacitated Arc Routing Formulations for Branch-Cut-and-Price Algorithms
Diego Pecin, Eduardo Uchoa

A General Regularized Continuous Formulation for the Maximum Clique Problem
James T. Hungerford, Francesco Rinaldi

The Vertex k-cut Problem
Denis Cornaz, Fabio Furini, Mathieu Lacroix, Enrico Malaguti, A. Ridha Mahjoub, Sébastien Martin

Graphs and Matroids
A Note on Submodular Function Minimization by Chubanov's LP Algorithm
Satoru Fujishige

October 2017

Enriching Solutions to Combinatorial Problems via Solution Engineering
Petit Thierry, Trapp Andrew

A Bucket Graph Based Labeling Algorithm with Application to Vehicle Routing
Ruslan Sadykov, Eduardo Uchoa, Artur Pessoa

  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