Exact solution of multicommodity network optimization problems with general step cost functions. - Virginie Gabrel; Arnaud Knippel; Michel Minoux (Oper. Res. Lett., 1999)

A Comparison of Heuristics for the Discrete Cost Multicommodity Network Optimization Problem. - Virginie Gabrel; Arnaud Knippel; Michel Minoux (J. Heuristics, 2003)

The multi-layered network design problem. - Arnaud Knippel; Benoit Lardeux (Eur. J. Oper. Res., 2007)

Symbol Detection Using Region Adjacency Graphs and Integer Linear Programming. - Pierre Le Bodic; Hervé Locteau; Sébastien Adam; Pierre Héroux; Yves Lecourtier; Arnaud Knippel (ICDAR, 2009)

Oscillations of simple networks - Jean-Guy Caputo; Arnaud Knippel; Elie Simo (CoRR, 2011)

Extraction de motifs dialogiques bidimensionnels. - Zacharie Alès; Alexandre Pauchet; Arnaud Knippel; Laurent Vercouter; Christian Gout (Rev. d'Intelligence Artif., 2015)

Polyhedral combinatorics of the K-partitioning problem with representative variables. - Zacharie Alès; Arnaud Knippel; Alexandre Pauchet (Discret. Appl. Math., 2016)

An extended edge-representative formulation for the K-partitioning problem. - Zacharie Alès; Arnaud Knippel (Electron. Notes Discret. Math., 2016)

Extraction and Clustering of Two-Dimensional Dialogue Patterns. - Zacharie Alès; Alexandre Pauchet; Arnaud Knippel (Int. J. Artif. Intell. Tools, 2018)

On graph Laplacian eigenvectors with components in {-1, 0, 1}. - Jean-Guy Caputo; I. Khames; Arnaud Knippel (Discret. Appl. Math., 2019)

The K-partitioning problem: Formulations and branch-and-cut. - Zacharie Alès; Arnaud Knippel (Networks, 2020)

Routine mining on location sequences. - Yujin Yan; Alexandre Pauchet; Arnaud Knippel (KES, 2022)

Formulations for the maximum common edge subgraph problem. - Etienne de Gastines; Arnaud Knippel (Discret. Appl. Math., 2024)