Combinatorial Optimization Submissions  2010
January 2010
Experimental analysis of heuristics for the bottleneck traveling salesman problem
John LaRusic, Abraham Punnen, Eric Aubanel
Graphs and Matroids
The Maximum Flow Problem with Disjunctive Constraints
Ulrich Pferschy, Joachim Schauer
Branch and Cut Algorithms
An exact approach to the problem of extracting an embedded network matrix
R. M. V. Figueiredo, M. Labbé, C. C. de Souza
February 2010
Graphs and Matroids
Complexity of the Critical Node Problem over trees
Marco Di Summa, Andrea Grosso, Marco Locatelli
Meta Heuristics
Automatic tuning of GRASP with pathrelinking heuristics with a biased randomkey genetic algorithm
P. Festa, J.F. Gonçalves, M.G.C. Resende, R.M.A. Silva
Strengthening weak sandwich theorems in the presence of inconnectivity
Miklos Ujvari
March 2010
Branch and Cut Algorithms
Benders decomposition for the hopconstrainted survivable network design problem
Q. Botton, B. Fortz, L. Gouveia, M. Poss
Meta Heuristics
Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms
Celso Ribeiro, Isabel Rosseti, Reinaldo Vallejos
Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation
Stefano Gualandi, Federico Malucelli
Graphs and Matroids
Isomorphism testing for circulant graphs Cn(a,b)
Sara Nicoloso, Ugo Pietropaoli
April 2010
Meta Heuristics
Pathrelinking intensification algorithms for stochastic local search heuristics
Celso C. Ribeiro, Mauricio G. C. Resende
Polyhedra
A Polyhedral Study of Triplet Formulation for Single Row Facility Layout Problem
Sujeevraja Sanjeevi, Kiavash Kianfar
Approximation Algorithms
Approximating the minimum directed tree cover
Viet Hung Nguyen
Polyhedra
Small bipartite subgraph polytopes
Laura Galli, Adam N. Letchford
May 2010
Other
Semidefinite code bounds based on quadruple distances
Dion C. Gijswijt, Hans D. Mittelmann, Alexander Schrijver
June 2010
Graphs and Matroids
Coverings and matchings in rpartite hypergraphs
D.S. Altner, J.P. Brooks
July 2010
Approximation Algorithms
Local Search Approximation Algorithms for the Complement of the Min$k$Cut Problems
Wenxing Zhu, Chuanyin Guo
August 2010
Semidefinite Relaxations of Ordering Problems
Philipp Hungerländer, Franz Rendl
October 2010
Polyhedra
Facets of the minimumadjacency vertex coloring polytope
Diego Delle Donne, Javier Marenco
On the Complexity of NonOverlapping Multivariate Marginal Bounds for Probabilistic Combinatorial Optimization Problems
Karthik Natarajan, Xuan Vinh Doan
MinMax Theorems Related to Geometric Representations of Graphs and their SDPs
Marcel K. Carli Silva, Levent Tuncel
November 2010
Minimum cost subset selection with two competing agents
Claudia Marini, Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy
A biased randomkey genetic algorithm for the Steiner triple covering problem
M.G.C. Resende, R.F. Toso, J.F. Gonçalves, R.M.A. Silva
Polyhedra
The Maximum kColorable Subgraph Problem and Orbitopes
Tim Januschowski, Marc Pfetsch
December 2010
Meta Heuristics
A hybrid Lagrangean heuristic with GRASP and pathrelinking for set Kcovering
Luciana S. Pessoa, Mauricio G.C. Resende, Celso C. Ribeiro
Polyhedra
The Time Dependent Traveling Salesman Problem: Polyhedra and Algorithm
Hernan Abeledo, Ricardo Fukasawa, Artur Pessoa, Eduardo Uchoa
