A. Hertz

发表

Some uses of struction

A. Hertz, 1986 .

Tabu search for large scale timetabling problems

A. Hertz, 1991 .

Tabu search: a tutorial and an application to neural networks

D. Werra, A. Hertz, 1989 .

A new heuristic method for the flow shop sequencing problem

A. Hertz, M. Widmer, 1989 .

Heuristics for minimizing tool switches when scheduling part types on a flexible machine

G. Laporte, A. Hertz, M. Mittaz, 1998 .

Graph theory and combinatorial optimization

D. Avis, A. Hertz, O. Marcotte, 2005 .

A framework for the description of evolutionary algorithms

Alain Hertz, Daniel Kobler, A. Hertz, 2000, Eur. J. Oper. Res..

A multi-criteria tabu search approach to cell formation problems in group technology with multiple objectives

B. Jaumard, C. Ribeiro, A. Hertz, 1994 .

Using Graph Theory to Derive Inequalities for the Bell Numbers

A. Hertz, A. Hertz, Hadrien M'elot, 2021, ArXiv.

ON A GRAPH TRANSFORMATION THAT PRESERVES THE STABILITY NUMBER

A. Hertz, 2000 .

Graph colouring variations

A. Hertz, B. Ries, 2019 .

New Heuristics for the Vehicle Routing Problem

G. Laporte, J. Cordeau, M. Gendreau, 2005 .

A note on r-equitable k-colorings of trees

A. Hertz, B. Ries, 2013 .

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

A. Hertz, F. Gagnon, Romain Montagné, 2014 .

some graph theoretic invariants

P. Hansen, A. Hertz, M. Aouchiche, 2015 .

Bounds on differences between some graph theoretic invariants

P. Hansen, A. Hertz, M. Aouchiche, 2015 .

A Lagrangian-based score for assessing the quality of pairwise constraints in SSC

A. Hertz, Daniel Aloise, S. Blanchard, 2019 .

A NEW EFFICIENT RLF-LIKE ALGORITHM FOR THE VERTEX COLORING PROBLEM

A. Hertz, M. Bellaiche, M. Adegbindin, 2014 .

Cabling optimization of a windfarm and capacitated K-Steiner tree

A. Hertz, Marie-Christine Costa, C. Bentz, 2014 .

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

A. Hertz, Nicolas Zufferey, N. Zufferey, 2008 .

Anniversary focused issue of Computers & Operations Research on tabu search

Alain Hertz, A. Hertz, 2006, Comput. Oper. Res..

Optimizing keyword positions for search engine marketing

Alain Hertz, Michel Gamache, Sandrine Paroz, 2017 .

Viewpoints on optimization

Brigitte Jaumard, Alain Hertz, D. de Werra, 1994 .

Metaheuristics and Scheduling

Alain Hertz, Marino Widmer, Daniel Costa, 2010 .

5. Tabu search

Alain Hertz, D. de Werra, Éric D. Taillard, 2003 .

Variable space search for graph coloring

Alain Hertz, Nicolas Zufferey, Matthieu Plumettaz, 2006, Discret. Appl. Math..

A TUTORIAL ON TABU SEARCH

Alain Hertz, D. de Werra, Éric D. Taillard, 1992 .

Local Optima Topology for the 3-SAT Problem

Pierre Hansen, Alain Hertz, Michael U. Gerber, 1998 .

A solution method for a car fleet management problem with maintenance constraints

Alain Hertz, Nicolas Zufferey, David Schindl, 2006, J. Heuristics.

Transproof : Computer assisted graph transformations

Alain Hertz, Hadrien Mélot, Gauvain Devillez, 2017 .

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

A. Hertz, B. Gendron, P. St-Louis, 2007 .

Decycling bipartite graphs

A. Hertz, 2020, J. Graph Algorithms Appl..

The average size of maximal matchings in graphs

A. Hertz, Hadrien M'elot, G. Devillez, 2022, ArXiv.

Mixed Integer Programming and Extremal Chemical Graphs

P. Hansen, A. Hertz, M. Aouchiche, 2018 .

Some experiments with simulated annealing for coloring graphs

D. Werra, A. Hertz, M. Chams, 1987 .

Mining graphs to discover new theorems in mathematics

P. Hansen, P. Galinier, A. Hertz, 2009 .

On some Properties of DNA Graphs

Alain Hertz, Jacek Blazewicz, Dominique de Werra, 1999, Discret. Appl. Math..

On the Use of Boolean Methods for the Computation of the Stability Number

Alain Hertz, A. Hertz, 1997, Discret. Appl. Math..

STABULUS: A technique for finding stable sets in large graphs with tabu search

Alain Hertz, Dominique de Werra, Charles Friden, 1989, Computing.

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

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

The Metric Cutpoint Partition Problem

Alain Hertz, Sacha Varone, A. Hertz, 2008, J. Classif..

The Metric Bridge Partition Problem: Partitioning of a Metric Space into Two Subspaces Linked by an Edge in Any Optimal Realization

Alain Hertz, Sacha Varone, A. Hertz, 2007, J. Classif..

The Metric Bridge Partition Problem

A. Hertz, Sacha C. Varone, 2005 .

On the edge capacitated Steiner tree problem

Alain Hertz, Cédric Bentz, Marie-Christine Costa, 2016, Discret. Optim..

The Maximum Independent Set Problem and Augmenting Graphs

Vadim V. Lozin, Alain Hertz, A. Hertz, 2005 .

Improving constrained pattern mining with first-fail-based heuristics

Pierre Hansen, Alain Hertz, Christian Desrosiers, 2011, Data Mining and Knowledge Discovery.

A graph coloring model for a feasibility problem in monthly crew scheduling with preferential bidding

Michel Gamache, Jérôme Olivier Ouellet, Alain Hertz, 2007, Comput. Oper. Res..

A Graph Coloring Model for a Feasibility Problem in Crew Scheduling

Alain Hertz, Michel Gamache, A. Hertz, 2005 .

Tabu Search for the RNA Partial Degradation Problem

Jacek Blazewicz, Marta Kasprzak, Agnieszka Rybarczyk, 2016, Int. J. Appl. Math. Comput. Sci..

A Lagrangian-based score for assessing the quality of pairwise constraints in semi-supervised clustering

Daniel Aloise, Alain Hertz, Simon J. Blanchard, 2021, Data Mining and Knowledge Discovery.

Resolving sets and integer programs for recommender systems

Alain Hertz, A. Hertz, T. Kuflik, 2019, Journal of Global Optimization.

A survey of local search methods for graph coloring

Alain Hertz, Philippe Galinier, P. Galinier, 2004, Comput. Oper. Res..

A Tabu Search Heuristic for the Capacitated Arc Routing Problem

Gilbert Laporte, Alain Hertz, Michel Mittaz, 2000, Oper. Res..

A Tabu Search Heuristic for the Vehicle Routing Problem

Gilbert Laporte, Michel Gendreau, Alain Hertz, 1991 .

A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows

Michel Gendreau, Gilbert Laporte, Alain Hertz, 1998, Oper. Res..

New Insertion and Postoptimization Procedures for the Traveling Salesman Problem

Gilbert Laporte, Michel Gendreau, Alain Hertz, 1992, Oper. Res..

Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs

Alain Hertz, Daniel Costa, Clivier Dubuis, 1995, J. Heuristics.

SyGMA: Reducing Symmetry in Graph Mining

Pierre Hansen, Alain Hertz, Christian Desrosiers, 2007 .

Improving Frequent Subgraph Mining in the Presence of Symmetry

Pierre Hansen, Alain Hertz, Christian Desrosiers, 2007, MLG.

An Improved Tabu Search Approach for Solving the Job Shop Scheduling Problem with Tooling Constraints

Alain Hertz, Marino Widmer, A. Hertz, 1996, Discret. Appl. Math..

Finding a feasible course schedule using Tabu search

Alain Hertz, A. Hertz, 1992, Discret. Appl. Math..

A patient assignment algorithm for home care services

Alain Hertz, Nadia Lahrichi, A. Hertz, 2006, J. Oper. Res. Soc..

Analysis of a territorial approach to the delivery of nursing home care services based on historical data

Alain Hertz, Nadia Lahrichi, S. D. Lapierre, 2005, Journal of Medical Systems.

Guidelines for the use of meta-heuristics in combinatorial optimization

Alain Hertz, Marino Widmer, A. Hertz, 2003, Eur. J. Oper. Res..

on a Scheduling Problem in a Robotized Analytical System

Alain Hertz, Yves Rochat, Yves Mottet, 1996, Discret. Appl. Math..

Automated generation of conjectures on forbidden subgraph characterization

Pierre Hansen, Alain Hertz, Christian Desrosiers, 2007, Discret. Appl. Math..

A Magnetic Procedure for the Stability Number

Alain Hertz, Dominique de Werra, D. Werra, 2008, Graphs Comb..

An adaptive memory algorithm for the k-coloring problem

Alain Hertz, Nicolas Zufferey, Philippe Galinier, 2003, Discret. Appl. Math..

A Taxonomy of Evolutionary Algorithms in Combinatorial Optimization

Alain Hertz, Pierre Kuonen, Giovanni Coray, 1999, J. Heuristics.

Efficient algorithms for finding critical subgraphs

Alain Hertz, Christian Desrosiers, Philippe Galinier, 2004, Discret. Appl. Math..

Solution techniques for the Large Set Covering Problem

Alain Hertz, Philippe Galinier, P. Galinier, 2003, Discret. Appl. Math..

The Traveling Salesman Problem with Backhauls

Michel Gendreau, Gilbert Laporte, Alain Hertz, 1996, Comput. Oper. Res..

A 5/3-approximation algorithm for the clustered traveling salesman tour and path problems

Alain Hertz, Shoshana Anily, Julien Bramel, 1999, Oper. Res. Lett..

A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem

Alain Hertz, Maria Grazia Speranza, Claudia Archetti, 2003, Transp. Sci..

A comparison of five heuristics for the multiple depot vehicle scheduling problem

Dennis Huisman, Alain Hertz, Guy Desaulniers, 2009, J. Sched..

A variable neighborhood search for graph coloring

Alain Hertz, Nicolas Zufferey, Cédric Avanthay, 2003, Eur. J. Oper. Res..

A flexible MILP model for multiple-shift workforce planning under annualized hours

Nadia Lahrichi, Alain Hertz, Marino Widmer, 2010, Eur. J. Oper. Res..

Incomplete service and split deliveries in a routing problem with profits

Alain Hertz, Maria Grazia Speranza, Claudia Archetti, 2014, Networks.

The split delivery capacitated team orienteering problem

Alain Hertz, Maria Grazia Speranza, Claudia Archetti, 2010, Networks.

Pickup and Delivery Problems with Services on Nodes or Arcs of a Network

Alain Hertz, Michel Mittaz, A. Hertz, 2010 .

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

Pierre Hansen, Alain Hertz, Michael U. Gerber, 1998, Graphs Comb..

Bounded vertex colorings of graphs

Pierre Hansen, Alain Hertz, Julio Kuplinsky, 1990, Discret. Math..

Finding the chromatic number by means of critical graphs

Alain Hertz, Francine Herrmann, A. Hertz, 2000, JEAL.

Using tabu search techniques for graph coloring

Alain Hertz, Dominique de Werra, D. Werra, 1987, Computing.

A Lower Bound for the Job Insertion Problem

Alain Hertz, Tamás Kis, A. Hertz, 2003, Discret. Appl. Math..

A note on tree realizations of matrices

Alain Hertz, Sacha Varone, A. Hertz, 2005, RAIRO Oper. Res..

About equivalent interval colorings of weighted graphs

Mirjana Cangalovic, Alain Hertz, Mathieu Bouchard, 2009, Discret. Appl. Math..

Cosine: A new graph coloring algorithm

Alain Hertz, A. Hertz, 1991, Oper. Res. Lett..

Local Optima Topology for the k-Coloring Problem

Brigitte Jaumard, Alain Hertz, Marcus Poggi de Aragão, 1991, Discret. Appl. Math..

A New Ant Algorithm for Graph Coloring

Alain Hertz, Nicolas Zufferey, A. Hertz, 2006 .

New Heuristics for the Vehicle Routing Problem

Michel Gendreau, Gilbert Laporte, Jean-François Cordeau, 2005 .

Dominating induced matchings in graphs containing no long claw pdf

Vadim V. Lozin, Alain Hertz, Dominique de Werra, 2015, J. Graph Theory.

Improvement Procedures for the Undirected Rural Postman Problem

Gilbert Laporte, Alain Hertz, Pierrette Nanchen Hugo, 1999, INFORMS J. Comput..

An Object-Oriented Methodology for Solving Assignment-Type Problems with Neighborhood Search Techniques

Alain Hertz, Jacques A. Ferland, Alain Lavoie, 1996, Oper. Res..

A Transformation Which Preserves the Clique Number

Alain Hertz, Michael U. Gerber, A. Hertz, 2001, J. Comb. Theory, Ser. B.

Lower bounding and tabu search procedures for the frequency assignment problem with polarization constraints

Alain Hertz, Nicolas Zufferey, David Schindl, 2003, 4OR.

Counting the number of non-equivalent vertex colorings of a graph

Alain Hertz, Hadrien Mélot, A. Hertz, 2013, Discret. Appl. Math..

Minimum Eccentric Connectivity Index for Graphs with Fixed Order and Fixed Number of Pending Vertices pdf

Alain Hertz, Hadrien Mélot, Gauvain Devillez, 2018, Yugoslav Journal of Operations Research.

Metaheuristics for the team orienteering problem

Alain Hertz, Maria Grazia Speranza, Claudia Archetti, 2005, J. Heuristics.

A Hybrid Heuristic for an Inventory Routing Problem

Luca Bertazzi, Alain Hertz, Maria Grazia Speranza, 2012, INFORMS J. Comput..

A machine learning framework for neighbor generation in metaheuristic search

A. Hertz, De-You Liu, Andrea Lodi, 2022, Frontiers in Applied Mathematics and Statistics.

Average distance and maximum induced forest

Pierre Hansen, Alain Hertz, Odile Marcotte, 2009, J. Graph Theory.

Directed weighted improper coloring for cellular channel allocation

François Gagnon, Alain Hertz, Claudia Archetti, 2012, Discret. Appl. Math..

A Tabu Search Heuristic for the Vehicle Routing Problem

G. Laporte, M. Gendreau, A. Hertz, 1991 .

The undirected capacitated arc routing problem with profits

Alain Hertz, Maria Grazia Speranza, Claudia Archetti, 2010, Comput. Oper. Res..

Using local search to speed up filtering algorithms for some NP-hard constraints

Alain Hertz, Gilles Pesant, Philippe Galinier, 2010, Ann. Oper. Res..

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

Alain Hertz, Gilles Pesant, Philippe Galinier, 2008, CPAIOR.

The capacitated team orienteering and profitable tour problems

Alain Hertz, Maria Grazia Speranza, Claudia Archetti, 2007, J. Oper. Res. Soc..

The Capacitated Arc Routing Problem with Profits

Alain Hertz, Maria Grazia Speranza, Claudia Archetti, 2009 .

Recent Trends in Arc Routing

Alain Hertz, A. Hertz, 2005 .

A generalized insertion algorithm for the seriation problem

Gilbert Laporte, Alain Hertz, Michel Gendreau, 1993 .

On a reduction of the interval coloring problem to a series of bandwidth coloring problems

Mirjana Cangalovic, Alain Hertz, Mathieu Bouchard, 2007, J. Sched..

Ants can colour graphs

Alain Hertz, D Costa, A. Hertz, 1997 .

A multi-cell graph based dynamic resource allocation scheme for multi-user wireless networks

Alain Hertz, Francois Gagnon, Romain Montagné, 2017 .

P5-free augmenting graphs and the maximum stable set problem

Alain Hertz, David Schindl, Michael U. Gerber, 2002, Discret. Appl. Math..

Consecutive colorings of graphs

Alain Hertz, Dominique de Werra, D. Werra, 1988, ZOR Methods Model. Oper. Res..

Polynomially Solvable Cases for the Maximum Stable Set Problem

Alain Hertz, A. Hertz, 1991, Discret. Appl. Math..

The tabu search metaheuristic: How we used it

Alain Hertz, Dominique de Werra, D. Werra, 1990, Annals of Mathematics and Artificial Intelligence.

Tabaris: An exact algorithm based on tabu search for finding a maximum independent set in a graph

Alain Hertz, Dominique de Werra, Charles Friden, 1990, Comput. Oper. Res..

Tabu search techniques

Alain Hertz, D. de Werra, D. Werra, 1989 .

Constructing a course schedule by solving a series of assignment type problems

Alain Hertz, Vincent Robert, A. Hertz, 1998, Eur. J. Oper. Res..

Slim graphs

A. Hertz, A. Hertz, 1989, Graphs Comb..

A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem

Alain Hertz, Michel Mittaz, A. Hertz, 2001, Transp. Sci..

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

Alain Hertz, Thomas Ridremont, A. Hertz, 2018, Journal of Heuristics.

A fast algorithm for coloring Meyniel graphs

Alain Hertz, A. Hertz, 1990, J. Comb. Theory, Ser. B.

Exploring dual information in distance metric learning for clustering pdf

Daniel Aloise, Alain Hertz, Rodrigo Randel, 2021, ArXiv.

Design of a wind farm collection network when several cable types are available

Alain Hertz, Odile Marcotte, Asma Mdimagh, 2015, J. Oper. Res. Soc..

Optimizing the Design of a Wind Farm Collection Network

Alain Hertz, Odile Marcotte, Asma Mdimagh, 2011, INFOR Inf. Syst. Oper. Res..