Combinatorial Optimization Submissions  2009
January 2009
Meta Heuristics
GRASP with pathrelinking for the generalized quadratic assignment problem
G.R. Mateus, M.G.C. Resende, R.M.A. Silva
Meta Heuristics
A multipopulation genetic algorithm for a constrained twodimensional orthogonal packing problem
José F. Gonçalves, Mauricio G. C. Resende
Graphs and Matroids
Minimal Spanning Trees with Conflict Graphs
Andreas Darmann, Ulrich Pferschy, Joachim Schauer
February 2009
Approximation Algorithms
Relating maxcut problems and binary linear feasibility problems
Florian Jarre
May 2009
Graphs and Matroids
Graph Realizations Associated with Minimizing the Maximum Eigenvalue of the Laplacian
Frank Göring, Christoph Helmberg, Susanna Reiss
June 2009
Approximation Algorithms
Solving large pmedian problems using a Lagrangean heuristic
Andréa Cynthia Santos
Branch and Cut Algorithms
A BranchandCutandPrice Algorithm for VertexBiconnectivity Augmentation
Ivana Ljubic
August 2009
Meta Heuristics
GRASP with path relinking heuristics for the antibandwidth problem
Abraham Duarte, Rafael Martí, Mauricio G. C. Resende, Ricardo M. A. Silva
Trioid: A generalization of matroid and the associated polytope
Santosh Kabadi, Abraham Punnen
September 2009
A Comparison of Lower Bounds for the Symmetric Circulant Traveling Salesman Problem
Etienne De Klerk, Cristian Dobre
Resource Allocation with Time Intervals
Andreas Darmann, Ulrich Pferschy, Joachim Schauer
October 2009
Graphs and Matroids
Paths, Trees and Matchings under Disjunctive Constraints
Andreas Darmann, Ulrich Pferschy, Joachim Schauer, Gerhard J. Woeginger
Meta Heuristics
Biased randomkey genetic algorithms for combinatorial optimization
José F. Gonçalves, Mauricio G.C. Resende
November 2009
Reformulation of the Hadamard conjecture via HurwitzRadon word systems
Miklos Ujvari
Graphs and Matroids
A simple branching scheme for Vertex Coloring Problems
Stefano Gualandi, Federico Malucelli
Approximation Algorithms
Improved Algorithm for Degree Bounded Survivable Network Design Problem
Anand Louis, Nisheeth Vishnoi
December 2009
Approximation Algorithms
A Spectral Algorithm for Improving Graph Partitions
Michael W. Mahoney, Lorenzo Orecchia, Nisheeth K. Vishnoi
Graphs and Matroids
A new lower bound on the independence number of a graph
O. Kettani
Approximation Algorithms
Approximating the asymmetric profitable tour
Viet Hung Nguyen, Thi Thu Thuy Nguyen
The minimum spanning tree problem with conflict constraints and its
R. Zhang, S. N. Kabadi, A.P. Punnen
