Combinatorial Optimization Submissions  2016
January 2016
Branch and Cut Algorithms
Online Learning for Strong Branching Approximation in BranchandBound
Alejandro Marcos Alvarez, Louis Wehenkel, Quentin Louveaux
February 2016
Approximation Algorithms
Exploiting Optimization for Local Graph Clustering
Fountoulakis Kimon, Cheng Xiang, Shun Julian, RoostaKhorasani Farbod, Mahoney Michael
Approximation Algorithms
Robust scheduling with budgeted uncertainty
Marinb Bougeret, Artur Pessoa, Michael Poss
A decomposition approach for single allocation hub location problems with multiple capacity levels
Borzou Rostami, Christopher Strothmann, Christoph Buchheim
The Quadratic Shortest Path Problem: Complexity, Approximability, and Solution Methods
Borzou Rostami, André Chassein, Michael Hopf, Davide Frey, Christoph Buchheim, Federico Malucelli, Marc Goerigk
March 2016
Exact Solution Methods for the $k$item Quadratic Knapsack Problem
Lucas Letocart, Angelika Wiegele
A doubly nonnegative relaxation for modularity density maximization
Yoichi Izunaga, Tomomi Matsui, Yoshitsugu Yamamoto
Polyhedra
Projection results for the kpartition problem
Jamie Fairbrother, Adam N. Letchford
Polyhedra
A polyhedral study of the cardinality constrained multicycle and multichain problem on directed graphs for kidney exchange optimization
V MakHau
Computational Study of Valid Inequalities for the Maximum kCut Problem
Vilmar Jefté Rodrigues de Sousa, Miguel F. Anjos, Sébastien Le Digabel
Minimization and Maximization Versions of the Quadratic Traveling Salesman Problem
Oswin Aichholzer, Anja Fischer, Frank Fischer, J. Fabian Meier, Ulrich Pferschy, Alexander Pilz, Rostislav Stanek
Graphs and Matroids
Matroid Optimisation Problems with Nested Nonlinear Monomials in the Objective Function
Anja Fischer, Frank Fischer, S. Thomas McCormick
Other
On the NPCompleteness of the MultiPeriod Minimum Spanning Tree Problem
Rosklin Chagas, Alexandre Cunha
April 2016
Combinatorial Benders Cuts for Assembly Line Balancing
Sener Akpinar, Atabak Elmi, Tolga Bektas
Polyhedra
A Polyhedral Approach to Online Bipartite Matching
Alfredo Torrico, Shabbir Ahmed, Alejandro Toriello
Approximation Algorithms
Approximation Properties and Tight Bounds for Constrained MixedInteger Optimal Control
Christian Kirches, Felix Lenders
The Traveling Salesman Problem on Grids with Forbidden Neighborhoods
Anja Fischer, Philipp Hungerländer
May 2016
Introducing capacities in the location of unreliable facilities
José L. SainzPardo, María AlbarradaSambola, Mercedes Landete, Juan F. Monge
A Parametric Approach to the Pooling Problem
Radu BalteanLugojan, Ruth Misener
June 2016
Branch and Cut Algorithms
BranchandCut approaches for pCluster Editing
Teobaldo Bulhões, Gilberto Sousa, Anand Subramanian, Lucídio Cabral
On the strength of the cycle relaxation for the boolean quadric polytope
Carla Michini
Meta Heuristics
Devolutionary Genetic Algorithms with Application to the Minimum Labeling Steiner Tree Problem
Nassim Dehouche
A dualascentbased branchandbound framework for the prizecollecting Steiner tree and related problems
Markus Leitner, Ivana Ljubic, Martin Luipersbeck, Markus Sinnl
Approximation Algorithms
A 2approximation algorithm for the minimum knapsack problem with a forcing graph
Yotaro Takazawa, Shinji Mizuno
July 2016
Polyhedra
Complete Description of Matching Polytopes with One Linearized Quadratic Term for Bipartite Graphs
Matthias Walter
Improved dynamic programming and approximation results for the knapsack problem with setups
Ulrich Pferschy, Rosario Scatamacchia
Polyhedra
Facets for NodeCapacitated Multicut Polytopes from PathBlock Cycles with Two Common Nodes
Michael M. Sørensen
August 2016
Branch and Cut Algorithms
Extended Formulations and BranchandCut Algorithms for the BlackandWhite Traveling Salesman Problem
Luis Gouveia, Markus Leitner, Mario Ruthmair
September 2016
An Effective Dynamic Programming Algorithm for the MinimumCost Maximal Knapsack Packing
Fabio Furini, Ivana Ljubic, Markus Sinnl
Branch and Cut Algorithms
An Exact Solution Framework for the Minimum Cost Dominating Tree Problem
Eduardo AlvarezMiranda, Martin Luipersbeck, Markus Sinnl
October 2016
Novel formulations for general and security Stackelberg games
Carlos Casorrán, Bernard Fortz, Martine Labbé, Fernando Ordóñez
An exact approach for the 0–1 Knapsack Problem with Setups
Federico Della Croce, Fabio Salassa, Rosario Scatamacchia
November 2016
Approximation Algorithms
Lineartime approximation algorithms for minimum subset sum and subset sum
Liliana Grigoriu
December 2016
Special cases of the quadratic shortest path problem
Hao Hu, Renata Sotirov
Polyhedra
The Minup/Mindown Unit Commitment polytope
Pascale Bendotti, Pierre Fouilhoux, Cécile Rottner
Branch and Cut Algorithms
Polyhedral Results, Branchandcut and Lagrangian Relaxation Algorithms for the Adjacent Only Quadratic Minimum Spanning Tree Problem
Dilson Pereira, Alexandre Cunha
Polyhedra
On Dantzig figures from lexicographic orders
Akshay Gupte, Svetlana Poznanovic
Exact and Heuristic Algorithms for the Partition Coloring Problem
Fabio Furini, Enrico Malaguti, Alberto Santini
