Weak Monge arrays in higher dimensions. - Dominique Fortin; Rüdiger Rudolf (Discret. Math., 1998)

Simultaneous Disjoint Routing in Regular Graphs. - Damanpal Singh Dogra; Dominique Fortin (Electron. Notes Discret. Math., 2000)

Piecewise-Convex Maximization Problems: Algorithm and Computational Experiments. - Dominique Fortin; Ider Tseveendorj (J. Glob. Optim., 2002)

Global optimization and multi knapsack: A percolation algorithm. - Dominique Fortin; Ider Theodoridis (Eur. J. Oper. Res., 2004)

A trust branching path heuristic for zero-one programming. - Dominique Fortin; Ider Tseveendorj (Eur. J. Oper. Res., 2009)

Piece adding technique for convex maximization problems. - Dominique Fortin; Ider Tseveendorj (J. Glob. Optim., 2010)

Piecewise Convex Maximization Problems: Piece Adding Technique. - Dominique Fortin; Ider Tseveendorj (J. Optim. Theory Appl., 2011)

Attractive force search algorithm for piecewise convex maximization problems. - Dominique Fortin; Ider Tseveendorj (Optim. Lett., 2012)

An Optimal Algorithm To Recognize Robinsonian Dissimilarities. - Pascal Préa; Dominique Fortin (J. Classif., 2014)

Survey of Piecewise Convex Maximization and PCMP over Spherical Sets. - Ider Tseveendorj; Dominique Fortin (Advances in Stochastic and Deterministic Global Optimization, 2016)

Generalized subdifferentials of the sign change counting function. - Dominique Fortin; Ider Tseveendorj (J. Glob. Optim., 2016)

Robinsonian Matrices: Recognition Challenges. - Dominique Fortin (J. Classif., 2017)

Clustering Analysis of a Dissimilarity: a Review of Algebraic and Geometric Representation. - Dominique Fortin (J. Classif., 2020)