Combinatorial Optimization Submissions  2006
January 2006
Solving a combinatorial problem using a local optimization in ant based system
CM. Pintea, D. Dumitrescu
Meta Heuristics
ZeroOne Knapsack Problem and Genetic Algorithms
Shalin Shah
Hyperbolic Polynomials Approach to Van der Waerden/SchrijverValiant like Conjectures :\\ Sharper Bounds, Simpler Proofs and Algorithmic Applications
Leonid Gurvits
Finding the best root node strategy for the approximation of the timeindexed bound in minsum scheduling
Yunpeng Pan, Leyuan Shi
Branch and Cut Algorithms
Dynamic Enumeration of All Mixed Cells
Tomohiko Mizutani, Akiko Takeda, Masakazu Kojima
A pricing problem under Monge property
Oktay Gunluk
March 2006
Polyhedra
On the pmedian polytope of a special class of graphs
Mourad Baiou, Francisco Barahona
Polyhedra
The pmedian polytope of restricted Ygraphs
Mourad Baiou, Francisco Barahona
On forests, stable sets and polyhedras associated with clique partitions
Denis Cornaz
Nonserial dynamic programming and local decomposition algorithms in discrete programming
Arnold Neumaier, Oleg Shcherbina
April 2006
Meta Heuristics
Approximate resolution of a resourceconstrained scheduling problem
Renaud Sirdey, Jacques Carlier, Dritan Nace
Branch and Cut Algorithms
A branchandcut algorithm for a resourceconstrained scheduling problem
Renaud Sirdey, Hervé L. M. Kerivin
May 2006
Improved bounds for the symmetric rendezvous search problem on the line
Q. Han, D. Du, J. C. Vera, L. F. Zuluaga
Graphs and Matroids
Copositive programming motivated bounds on the stability and the chromatic number
Igor Dukanovic, Franz Rendl
June 2006
Polyhedra
The extreme points of QSTAB(G) and its implications
Arie M.C.A. Koster, Annegret K. Wagler
August 2006
Approximation Algorithms
Approximating the Radii of Point Sets
Kasturi Varadarajan, S Venkatesh, Yinyu Ye, Zhang Jiawei
September 2006
Approximation Algorithms
An Approximation Algorithm for Constructing Error Detecting Prefix Codes
Artur Pessoa
Graphs and Matroids
On the Lov\'{a}sz $\vartheta$number of almost regular graphs with application to Erd\"osR\'enyi graphs
Etienne De Klerk, Michael W. Newman, Dmitrii V. Pasechnik, Renata Sotirov
October 2006
Polyhedral combinatorics of a resourceconstrained ordering problem part I: on the partial linear ordering polytope
Renaud Sirdey, Hervé Kerivin
Polyhedral combinatorics of a resourceconstrained ordering problem part II: on the process move program polytope
Hervé Kerivin, Renaud Sirdey
New descriptions of the Lovász number and a Brookstype theorem
Ujvári Miklós
Copositive and Semidefinite Relaxations of the Quadratic Assignment Problem
Janez Povh, Franz Rendl
December 2006
Approximation Algorithms
Approximation algorithms for metric tree cover and generalized tour and tree covers
Viet Hung Nguyen
