- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| j7 |      | Dominique Fortin, Ider Tseveendorj: Attractive force search algorithm for piecewise convex maximization problems. Optimization Letters 6(7): 1317-1333 (2012) |
| 2011 | ||
| j6 | | Dominique Fortin, Ider Tseveendorj: Piecewise Convex Maximization Problems: Piece Adding Technique. J. Optimization Theory and Applications 148(3): 471-487 (2011) |
| 2010 | ||
| j5 | | Dominique Fortin, Ider Tseveendorj: Piece adding technique for convex maximization problems. J. Global Optimization 48(4): 583-593 (2010) |
| 2009 | ||
| j4 | | Dominique Fortin, Ider Tseveendorj: A trust branching path heuristic for zero-one programming. European Journal of Operational Research 197(2): 439-445 (2009) |
| 2004 | ||
| j3 | | Dominique Fortin, Ider Theodoridis: Global optimization and multi knapsack: A percolation algorithm. European Journal of Operational Research 154(1): 46-56 (2004) |
| 2000 | ||
| j2 | | Damanpal Singh Dogra, Dominique Fortin: Simultaneous Disjoint Routing in Regular Graphs. Electronic Notes in Discrete Mathematics 5: 104-107 (2000) |
| 1998 | ||
| j1 | | Dominique Fortin, Rüdiger Rudolf: Weak Monge arrays in higher dimensions. Discrete Mathematics 189(1-3): 105-115 (1998) |
| 1 | Damanpal Singh Dogra | |
| 2 | Rüdiger Rudolf | |
| 3 | Ider Theodoridis | |
| 4 | Ider Tseveendorj |
Data released under the ODC-BY 1.0 license — See also our legal information page