Audet C.

C. Audet

Information about the author C. Audet will soon be added to the site.
Found 4 papers in total
Enumeration of all the extreme equilibria in game theory: Bimatrix and polymatrix games
Enumeration of all the extreme equilibria in game theory: Bimatrix and polymatrix games
2006
Bimatrix and polymatrix games are expressed as parametric linear 0–1 programs....
Concavity cuts for disjoint bilinear programming
Concavity cuts for disjoint bilinear programming
2001
We pursue the study of concavity cuts for the disjoint bilinear programming problem....
A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
2000
We present a branch and cut algorithm that yields in finite time, a globally...
A symmetrical linear maxmin approach to disjoint bilinear programming
A symmetrical linear maxmin approach to disjoint bilinear programming
1999
The disjoint bilinear programming problem can be reformulated using two distinct...
Papers per page: