|
(Operations Research, Algorithmics, Networks and Graphs Entity) |
Reports, papers, etc.
1.
M. Gerber, A.
Hertz and D. Schindl, 2004, "P5-free
augmenting graphs and the maximum stable set problem",
Discrete Applied Mathematics 132, 109-119.
2.
M. Gerber, A.
Hertz and V. Lozin, 2004, "Stable sets in two subclasses
of banner-free graphs", Discrete Applied Mathematics 132, 121-136.
3.
N. Zufferey, A.
Hertz and C. Avanthay, 2003, "A variable neighborhood search
for graph coloring", European Journal of Operational Research 151,
379-388.
4.
Hertz, V. Lozin
and D. Schindl, 2003, "Finding augmenting chains
in extensions of claw-free graphs", Information Processing Letters
86/6, 311-316.
1.
F. Herrmann and
A. Hertz, 2002, "Finding the chromatic number by means of
critical graphs", ACM Journal of Experimental Algorithmics 7/10, 1-9.
2.
M. Gerber, P.
Hansen and A. Hertz, 2002, "Extension
of Turan's Theorem to the 2- Stability Number", Graphs and
Combinatorics 18/3. 479-489.
3.
Hertz, D.
Schindl and N. Zufferey, 2003, "Lower Bounding and Tabu
Search Procedures for the Frequency Assignment Problem with Polarization
Constraints", submitted
4.
Archetti, A.
Hertz and M.G. Speranza, 2003, "A Tabu Search Algorithm for the
Split Delivery Vehicle Routing Problem", submitted
5.
P. Galinier, A.
Hertz and N. Zufferey, 2003, "An adaptive Memory Algorithm
for the k-Colouring Problem", submitted
6.
P. Galinier, M.
Gendreau, P. Soriano and S. Bisaillon, 2003, "Solving the Frequency
Assignment Problem with Polarization by Local Search and Tabu",
submitted
7.
P. Galinier and
A. Hertz, 2003, “Solution
Techniques for the Large Set Covering Problem”, submitted
8.
M.U. Gerber, A.
Hertz and V.V. Lozin, 2003, “Finding Augmenting Chains in Graphs
without a Skew Star”, submitted