Alain Hertz : Cahiers : GERAD

mai 2019

Graph colouring variations

Alain Hertz et Bernard Ries

G-2019-32

fév. 2019

Resolving sets and integer programs for recommender systems

Alain Hertz

G-2019-12

sept. 2018

Minimum eccentric connectivity index for graphs with fixed order and fixed number of pending vertices

Gauvain Devillez, Alain Hertz, Hadrien Mélot et Pierre Hauweele

G-2018-69

août 2018

Maximum eccentric connectivity index for graphs with given diameter

Pierre Hauweele, Alain Hertz, Hadrien Mélot, Bernard Ries et Gauvain Devillez

G-2018-66

août 2018

On graceful difference labelings of disjoint unions of circuits

Alain Hertz et Christophe Picouleau

G-2018-65

août 2018

A tabu search for the design of capacitated rooted survivable planar networks

Alain Hertz et Thomas Ridremont

G-2018-64

oct. 2017

An exact solution approach for the precedence-constrained class sequencing problem

Reinhard Bürgy, Pierre Baptiste et Alain Hertz

G-2017-82

avr. 2017

Optimizing keyword positions for search engine marketing

Koukla Azeuli Nkamegni, Michel Gamache, Alain Hertz et Sandrine Paroz

G-2017-26

mars 2017

An IP-based swapping algorithm for the metric dimension and minimal doubly resolving set problems in hypercubes

Alain Hertz

G-2017-17

fév. 2017

Edge realizability of connected simple graphs

Pierre Hansen, Alain Hertz, Cherif Sellal, Damir Vukicevic, Mustapha Aouchiche et Gilles Caporossi

G-2017-10

jan. 2017

A stochastic online algorithm for unloading boxes from a conveyor line

Reinhard Bürgy, Pierre Baptiste, Alain Hertz, Djamal Rebaïne et André Linhares

G-2017-08

nov. 2016

Integer programming models for the partial directed weighted improper coloring problem

Alain Hertz, Romain Montagné et François Gagnon

G-2016-112

nov. 2016

Online algorithms for the maximum k-colorable subgraph problem

Alain Hertz, Romain Montagné et François Gagnon

G-2016-111

avr. 2016

On the edge capacitated Steiner tree problem

Cédric Bentz, Marie-Christine Costa et Alain Hertz

G-2016-27

mars 2016

Online heuristics for unloading boxes off a gravity conveyor

Pierre Baptiste, Reinhard Bürgy, Alain Hertz et Djamal Rebaïne

G-2016-20

fév. 2016

Symmetry breaking constraints for the minimum deficiency problem

Sivan Altinakar, Gilles Caporossi et Alain Hertz

G-2016-11

fév. 2016

Tabu search for the RNA partial degradation problem

Agnieszka Rybarczyk, Alain Hertz, Marta Kasprzak et Jacek Blazewicz

G-2016-07

déc. 2015

The progressive visualization, a new tool for analyzing the writing process

Hélène-Sarah Bécotte-Boutin, Gilles Caporossi et Alain Hertz

G-2015-141

juin 2015

Constructive algorithms for the partial directed weighted improper coloring problem

Alain Hertz, Romain Montagné et François Gagnon

G-2015-61

mai 2015

Dominating induced matchings in graphs containing no long claw

Alain Hertz, Vadim Lozin, Bernard Ries, Victor Zamaraev et Dominique De Werra

G-2015-49

avr. 2015

Bounds on differences between some graph theoretic invariants

Mustapha Aouchiche, Pierre Hansen, Alain Hertz et Cherif Sellal

G-2015-31

mars 2015

On the design of a wind farm collection network when several cable types are available

Alain Hertz, Odile Marcotte, Asma Mdimagh, Michel Carreau et François Welt

G-2015-23

jan. 2015

A sharp lower bound on the number of non-equivalent colorings of graphs of order \(n\) and maximum degree \(n-3\)

Romain Absil, Eglantine Camby, Alain Hertz et Hadrien Mélot

G-2015-04

nov. 2014

Graph coloring to maximize the number of communicating mobiles in wireless networks

Romain Montagné, Alain Hertz et François Gagnon

G-2014-79

avr. 2014

A comparison of integer and constraint programming models for the deficiency problem

Sivan Altinakar, Gilles Caporossi et Alain Hertz

G-2014-25

avr. 2014

A new efficient RLF-like algorithm for the vertex coloring problem

Mouhamed Mourchid A. Adegbindin, Alain Hertz et Martine Bellaïche

G-2014-24

nov. 2013

Chromatic Scheduling

Dominique De Werra et Alain Hertz

G-2013-84

nov. 2013

A Note on \(r\)-Equitable \(k\)-Colorings of Trees

Alain Hertz et Bernard Ries

G-2013-83

nov. 2013

Counting the Number of Non-Equivalent Vertex Colorings of a Graph

Alain Hertz et Hadrien Mélot

G-2013-82

déc. 2012

A Repeated Sequential Elimination Algorithm for Finding an Upper Bound on the Clique Number

Luigi Curzi, Alain Hertz et Isabella Lari

G-2012-80

déc. 2012

A polynomial time algorithm for unloading boxes off a gravity conveyor

Pierre Baptiste, Alain Hertz, André Linhares et Djamal Rebaïne

G-2012-78

déc. 2012

Directed Weighted Improper Coloring for Cellular Channel Allocation

Claudia Archetti, Nicola Bianchessi, Alain Hertz, A Colombet et François Gagnon

G-2012-85

déc. 2011

Optimizing the Design of a Wing Farm Collection Network

Alain Hertz, Odile Marcotte, Asma Mdimagh, Michel Carreau et François Welt

G-2011-79

déc. 2011

A Branch-and-Price Algorithm for the Robust Graph Coloring Problem

Claudia Archetti, Nicola Bianchessi et Alain Hertz

G-2011-75

sept. 2011

On the Maximum Orders of an Induced Forest, an Induced Tree, and a Stable Set

Odile Marcotte, Alain Hertz et David Schindl

G-2011-45

août 2011

On r-Equitable Colorings of Trees and Forests

Alain Hertz et Bernard Ries

G-2011-40

avr. 2011

Integer Linear Programming Models for a Cement Delivery Problem

Alain Hertz, Marc Uldry et Marino Widmer

G-2011-20

jan. 2011

Incomplete Service and Split Deliveries in a Routing Problem with Profits

Claudia Archetti, Nicola Bianchessi, Alain Hertz et Maria Grazia Speranza

G-2011-02

oct. 2010

The Split Delivery Capacitated Team Orienteering Problem

Claudia Archetti, Nicola Bianchessi, Alain Hertz et Maria Grazia Speranza

G-2010-55

jan. 2010

Confection de calendriers de matchs pour le sport universitaire et collégial au Québec

Alain Hertz et Rina Razanakoto

G-2010-04

déc. 2009

Total Domination and the Caccetta-Häggkvist Conjecture

Patrick St-Louis, Bernard Gendron et Alain Hertz

G-2009-78

sept. 2009

On Compact k-Edge-Colorings: A Polynomial Time Reduction From Linear to Cyclic

Sivan Altinakar, Gilles Caporossi et Alain Hertz

G-2009-53

jan. 2009

A Hybrid Heuristic for an Inventory-Touring Problem

Claudia Archetti, Luca Bertazzi et Alain Hertz

G-2009-04

jan. 2009

The Capacitated Arc Routing Problem with Profits

Claudia Archetti, Dominique Feillet, Alain Hertz et Maria Grazia Speranza

G-2009-01

nov. 2008

A Magnetic Procedure for the Stability Number

Alain Hertz et Dominique De Werra

G-2008-78

avr. 2008

La coloration des sommets d'un graphe par colonies de fourmis

Alain Hertz et Nicolas Zufferey

G-2008-29

fév. 2008

Using Heuristics to Speed Up Frequent Pattern Mining

Christian Desrosiers, Philippe Galinier, Pierre Hansen et Alain Hertz

G-2008-13

jan. 2008

A Flexible MILP Model for Multiple-Shift Workforce Planning Under Annualized Hours

Alain Hertz, Nadia Lahrichi et Marino Widmer

G-2008-05

jan. 2008

About Equivalent Interval Colorings of Weighted Graphs

Mathieu Bouchard, Mirjana Cangalovic et Alain Hertz

G-2008-03

jan. 2008

Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints

Philippe Galinier, Alain Hertz, Sandrine Paroz et Gilles Pesant

G-2008-02

sept. 2007

On a Reduction of the Interval Coloring Problem to a Series of Bandwidth Coloring Problems

Mathieu Bouchard, Mirjana Cangalovic et Alain Hertz

G-2007-69

juil. 2007

Automated Generation of Conjectures on Forbidden Subgraph Characterization

Christian Desrosiers, Philippe Galinier, Pierre Hansen et Alain Hertz

G-2007-48

mai 2007

The Capacitated Team Orienteering and Profitable Tour Problems

Claudia Archetti, Dominique Feillet, Alain Hertz et Maria Grazia Speranza

G-2007-31

mars 2007

On a Generalization of the Gallai-Roy-Vitaver Theorem and Mathematical Programming Models for the Bandwidth Coloring Problem

Bernard Gendron, Alain Hertz et Patrick St-Louis

G-2007-22

mars 2007

Lower Bounds and a Tabu Search Algorithm for the Minimum Deficiency Problem

Mathieu Bouchard, Alain Hertz et Guy Desaulniers

G-2007-14

fév. 2007

SyGMA: Reducing Symmetry in Graph Mining

Christian Desrosiers, Philippe Galinier, Pierre Hansen et Alain Hertz

G-2007-12

jan. 2007

Using Meta-Heuristics to Find Minimal Unsatisfiable Subformulas in Satisfiability Problems

Christian Desrosiers, Philippe Galinier, Alain Hertz et Sandrine Paroz

G-2007-08

jan. 2007

Average Distance and Maximum Induced Forest

Pierre Hansen, Alain Hertz, Rim Kilani, Odile Marcotte et David Schindl

G-2007-07

jan. 2007

A Decomposition Algorithm for Computing Bounds on the Clique Number of a Graph

Bernard Gendron, Alain Hertz et Patrick St-Louis

G-2007-01

déc. 2006

A Patient Assignment Algorithm for Home Care Services

Alain Hertz et Nadia Lahrichi

G-2006-80

déc. 2006

Variable Space Search for Graph Coloring

Alain Hertz, Matthieu Plumettaz et Nicolas Zufferey

G-2006-81

nov. 2006

Comparison of Heuristic Approaches for the Multiple Depot Vehicle Scheduling Problem

Ann-Sophie Pepin, Guy Desaulniers, Alain Hertz et Dennis Huisman

G-2006-65

oct. 2006

A Solution Method for a Car Fleet Management Problem with Maintenance Constraints

Alain Hertz, David Schindl et Nicolas Zufferey

G-2006-59

mars 2006

On Edge Orienting Methods for Graph Coloring

Bernard Gendron, Alain Hertz et Patrick St-Louis

G-2006-16

jan. 2006

The Metric Cutpoint Partition Problem

Alain Hertz et Sacha Varone

G-2006-04

nov. 2005

Analysis of a Territorial Approach to the Delivery of Nursing Home Care Services Based on Historical Data

Nadia Lahrichi, Sophie D. Lapierre, Alain Hertz, A Talib et Lorraine Bouvier

G-2005-91

sept. 2005

The Metric Bridge Partition Problem

Alain Hertz et Sacha Varone

G-2005-67

mai 2005

Metaheuristics for the Team Orienteering Problem

Claudia Archetti, Alain Hertz et Maria Grazia Speranza

G-2005-47

avr. 2005

A Graph Coloring Model for a Feasibility Problem in Crew Scheduling

Michel Gamache, Alain Hertz et Jérôme Ouellet

G-2005-34

mars 2005

A Note on Tree Realizations of Matrices

Alain Hertz et Sacha Varone

G-2005-27

jan. 2005

LES MÉTA-HEURISTIQUES : quelques conseils pour en faire bon usage

Alain Hertz

G-2005-03

mai 2004

The Maximum Independent Set Problem and Augmenting Graphs

Alain Hertz et Vadim Lozin

G-2004-39

avr. 2004

A Survey of Local Search Methods for Graph Coloring

Philippe Galinier et Alain Hertz

G-2004-37

avr. 2004

New Heuristics for the Vehicle Routing Problem

Jean-François Cordeau, Michel Gendreau, Alain Hertz, Gilbert Laporte et JS Sormany

G-2004-33

avr. 2004

Efficient Algorithms for Finding Critical Subgraphs

Christian Desrosiers, Philippe Galinier et Alain Hertz

G-2004-31

août 2003

Augmenting Chains in Graphs Without a Skew Star

Michael U. Gerber, Alain Hertz et Vadim Lozin

G-2003-47

juil. 2003

Solution Techniques for the Large Set Covering Problem

Philippe Galinier et Alain Hertz

G-2003-44

juin 2003

Lower Bounding and Tabu Search Procedures for the Frequency Assignment Problem with Polarization Constraints

Alain Hertz, David Schindl et Nicolas Zufferey

G-2003-42

mai 2003

An Adaptive Memory Algorithm for the k-Colouring Problem

Philippe Galinier, Alain Hertz et Nicolas Zufferey

G-2003-35

mars 2003

A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem

Claudia Archetti, Alain Hertz et Maria Grazia Speranza

G-2003-18

nov. 2002

Guidelines for the Use of Meta-Heuristics in Combinatorial Optimization

Alain Hertz et Marino Widmer

G-2002-60

sept. 2002

Recent Trends in Arc Routing

Alain Hertz

G-2002-51

août 2002

Finding Augmenting Chains in Extensions of Claw-Free Graphs

Alain Hertz, Vadim Lozin et David Schindl

G-2002-42

fév. 2002

P₅-Free Augmenting Graphs and the Maximum Stable Set Problem

Michael U. Gerber, Alain Hertz et David Schindl

G-2002-11

fév. 2002

Stable Sets in Two Subclasses of Banner-Free Graphs

Michael U. Gerber, Alain Hertz et Vadim Lozin

G-2002-08

sept. 2000

Recent Algorithmic Advances for Arc Routing Problems

Gianpaolo Ghiani, Alain Hertz et Gilbert Laporte

G-2000-40

déc. 1998

Extension of Turán's Theorem to the 2-Stability Number

Michael U. Gerber, Pierre Hansen et Alain Hertz

G-98-71

déc. 1998

Local Optima Topology for the 3-SAT Problem

Michael U. Gerber, Pierre Hansen et Alain Hertz

G-98-68

jan. 1998

Chopping Graphs

Michael U. Gerber, Pierre Hansen, Alain Hertz, UN Peled et Dominique De Werra

G-98-03

jan. 1997

Heuristics for Minimizing Tool Switches when Scheduling Part Types on a Flexible Machine

Alain Hertz, Gilbert Laporte, M Mittaz et KE Stecke

G-97-03

sept. 1995

Splitting Trees

Pierre Hansen, Alain Hertz et N Quinodoz

G-95-42

sept. 1993

A Generalized Insertion Algorithm for the Seriation Problem

Michel Gendreau, Alain Hertz et Gilbert Laporte

G-93-29

oct. 1991

On a Transformation which Preserves the Stability Number

PL Hammer et Alain Hertz

G-91-40

sept. 1991

A New Polynomial Time Algorithm for the Maximum Weighted ( (G) - 1)-Coloring Problem in Comparability Graphs

Alain Hertz

G-91-38

sept. 1991

New Polynomially Solvable Cases for the Maximum Stable Set Problem

Alain Hertz

G-91-36

juil. 1991

Local Optima Topology for the k-coloring Problem

Alain Hertz, Brigitte Jaumard et Marcus V.S. Poggi De Aragao

G-91-33

juin 1991

A Tabu Search Heuristic for the Vehicle Routing Problem

Michel Gendreau, Alain Hertz et Gilbert Laporte

G-91-31

fév. 1991

A Graph Theory Approach to Subcontracting, Machine Duplication and Intercell Moves in Cellular Manufacturing

Alain Hertz, Brigitte Jaumard et Celso C. Ribeiro

G-91-07

nov. 1990

On the Stability Number of AH-Free Graphs

Alain Hertz et Dominique De Werra

G-90-51

oct. 1990

Bounded Vertex Colorings of Graphs

Pierre Hansen, Alain Hertz et J. Kuplinsky

G-90-46