The following pages link to Dominique Fortin (Q269173):
Displayed 19 items.
- An optimal algorithm to recognize Robinsonian dissimilarities (Q269174) (← links)
- Generalized subdifferentials of the sign change counting function (Q276504) (← links)
- Piecewise convex maximization problems: Piece adding technique (Q535077) (← links)
- Piece adding technique for convex maximization problems (Q604949) (← links)
- Attractive force search algorithm for piecewise convex maximization problems (Q694170) (← links)
- (Q1014934) (redirect page) (← links)
- A trust branching path heuristic for zero-one programming (Q1014935) (← links)
- Global optimization and multi knapsack: a percolation algorithm. (Q1420410) (← links)
- Weak Monge arrays in higher dimensions (Q1584367) (← links)
- Piecewise-convex maximization problems: algorithm and computational experiments (Q1862175) (← links)
- (Q2816081) (← links)
- Q-subdifferential and Q-conjugate for global optimality (Q2940369) (← links)
- Survey of Piecewise Convex Maximization and PCMP over Spherical Sets (Q2958613) (← links)
- Hadamard’s Matrices, Grothendieck’s Constant, and Root Two (Q3059302) (← links)
- Piecewise convex maximization approach to multiknapsack (Q3646095) (← links)
- (Q3656067) (← links)
- (Q4524579) (← links)
- (Q4817244) (← links)
- Piecewise convex formulations of binary and permutation problems (Q5407698) (← links)