Gilles Caporossi

Pattern Recognit., December, 2023

Topically diversified summarization of customer reviews.

[BibT_eX]

[DOI]

Florian Carichon

Proceedings of the 6th International Conference on Natural Language and Speech Processing (ICNLSP 2023), 2023

2021

Preface to the special issue of JOGO on the occasion of the 40th anniversary of the Group for Research in Decision Analysis (GERAD).

[BibT_eX]

[DOI]

Daniel Aloise

Sébastien Le Digabel

J. Glob. Optim., 2021

2020

Evolving optical interconnection topology: from survivable rings to resilient meshes.

[BibT_eX]

[DOI]

Moisés R. N. Ribeiro

Marcelo E. V. Segatto

Photonic Netw. Commun., 2020

Binary, unrelaxable and hidden constraints in blackbox optimization.

[BibT_eX]

[DOI]

Charles Audet

Elizandra Pereira Roque Coelho

Stéphane Jacquet

Oper. Res. Lett., 2020

2019

A New Approach for Contingency Analysis Based on Centrality Measures.

[BibT_eX]

[DOI]

Marcelo Eduardo Vieira Segatto

IEEE Syst. J., 2019

Intrinsically Resilient Optical Backbones: An Efficient Ring-Based Interconnection Paradigm.

[BibT_eX]

[DOI]

Evandro Ottoni Teatini Salles

Moisés R. N. Ribeiro

Marcelo E. V. Segatto

Proceedings of the Optical Network Design and Modeling, 2019

2018

DGR-ELM-Distributed Generalized Regularized ELM for classification.

[BibT_eX]

[DOI]

Fernando Kentaro Inaba

Sylvain Perron

Neurocomputing, 2018

2017

Symmetry Breaking Constraints for the Minimum Deficiency Problem.

[BibT_eX]

[DOI]

Sivan Altinakar

Alain Hertz

J. Graph Algorithms Appl., 2017

Variable Neighborhood Search for extremal vertices : The AutoGraphiX-III system.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2017

Ecriture Et Visualisations Numériques.

[BibT_eX]

[DOI]

Christophe Leblay

Proceedings of the 12th Annual International Conference of the Alliance of Digital Humanities Organizations, 2017

Parallel Community Detection Methods for Sparse Complex Networks.

[BibT_eX]

[DOI]

Philippe Gagnon

Sylvain Perron

Proceedings of the Complex Networks & Their Applications VI, 2017

2016

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

[BibT_eX]

[DOI]

Sivan Altinakar

Alain Hertz

Comput. Oper. Res., 2016

2015

RWA problem with geodesics in realistic OTN topologies.

[BibT_eX]

[DOI]

Martin Cousineau

Sylvain Perron

Marcelo E. V. Segatto

Opt. Switch. Netw., 2015

Bounds and Relations Involving Adjusted Centrality of the Vertices of a Tree.

[BibT_eX]

[DOI]

Snjezana Majstorovic

Graphs Comb., 2015

2014

Globally Optimal Clusterwise Regression By Column Generation Enhanced with Heuristics, Sequencing and Ending Subset Optimization.

[BibT_eX]

[DOI]

Réal André Carbonneau

J. Classif., 2014

2013

Open problems on graph eigenvalues studied with AutoGraphiX.

[BibT_eX]

[DOI]

Mustapha Aouchiche

EURO J. Comput. Optim., 2013

Network descriptors based on betweenness centrality and transmission and their extremal values.

[BibT_eX]

[DOI]

Damir Vukicevic

Discret. Appl. Math., 2013

2012

Extensions to the repetitive branch and bound algorithm for globally optimal clusterwise regression.

[BibT_eX]

[DOI]

Réal André Carbonneau

Comput. Oper. Res., 2012

A Learning Optimization Algorithm in Graph Theory - Versatile Search for Extremal Graphs Using a Learning Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Learning and Intelligent Optimization - 6th International Conference, 2012

Modularity maximization in networks by variable neighborhood search.

[BibT_eX]

[DOI]

Proceedings of the Graph Partitioning and Graph Clustering, 2012

2011

Globally optimal clusterwise regression by mixed logical-quadratic programming.

[BibT_eX]

[DOI]

Réal André Carbonneau

Eur. J. Oper. Res., 2011

On compact k-edge-colorings: A polynomial time reduction from linear to cyclic.

[BibT_eX]

[DOI]

Sivan Altinakar

Alain Hertz

Discret. Optim., 2011

Online Writing Data Representation: A Graph Theory Approach.

[BibT_eX]

[DOI]

Christophe Leblay

Proceedings of the Advances in Intelligent Data Analysis X - 10th International Symposium, 2011

2010

Design of highly synchronizable and robust networks.

[BibT_eX]

[DOI]

Ernesto Estrada

Silvia Gago

Autom., 2010

2005

AutoGraphiX: a survey.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

2004

Variable neighborhood search for extremal graphs. 5. Three ways to automate finding conjectures.

[BibT_eX]

[DOI]

Discret. Math., 2004

Using the Computer to Study the Dynamics of the Handwriting Processes.

[BibT_eX]

[DOI]

Denis Alamargot

David Chesnet

Proceedings of the Discovery Science, 7th International Conference, 2004

2003

A Survey and New Results on Computer Enumeration of Polyhex and Fusene Hydrocarbons.

[BibT_eX]

[DOI]

Gunnar Brinkmann

J. Chem. Inf. Comput. Sci., 2003

Graphs with maximum connectivity index.

[BibT_eX]

[DOI]

Comput. Biol. Chem., 2003

2002

A constructive enumeration of fusenes and benzenoids.

[BibT_eX]

[DOI]

Gunnar Brinkmann

J. Algorithms, 2002

2001

On the (1, 2)-Spectral Spread of Fullerenes.

[BibT_eX]

[DOI]

Dragan Stevanovic

Proceedings of the Graphs and Discovery, 2001

What Forms Do Interesting Conjectures Have in Graph Theory?

[BibT_eX]

[DOI]

Proceedings of the Graphs and Discovery, 2001

2000

AutoGraphiX: An Automated System for Finding Conjectures in Graph Theory.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2000

Variable neighborhood search for extremal graphs: 1 The AutoGraphiX system.

[BibT_eX]

[DOI]

Discret. Math., 2000

1999

Variable Neighborhood Search for Extremal Graphs. 2. Finding Graphs with Extremal Energy.

[BibT_eX]

[DOI]

J. Chem. Inf. Comput. Sci., 1999

Variable Neighborhood Search for Extremal Graphs: IV: Chemical Trees with Extremal Connectivity Index.

[BibT_eX]

[DOI]

Ivan Gutman

Comput. Chem., 1999

Finding Relations in Polynomial Time.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, 1999

1998

Enumeration of Polyhex Hydrocarbons to h = 21.

[BibT_eX]

[DOI]

J. Chem. Inf. Comput. Sci., 1998

Enumeration of fusenes to <i>h</i> = 20.

[BibT_eX]

[DOI]