Click
here
to see the reviews of most of my publications in MathSciNet (the AMS Review system).
(The hyperlink will work only if you or your institution have an active subscription to MathSciNet.)
Click
here
to see a list of my publications according to
BibFinder.
A Hybrid Interior-Point Cutting-Plane Method for Semidefinite Programming Relaxations in Discrete Optimization
(with A. Engau and A. Vannelli).
Submitted for publication.
New Relaxations for Binary Quadratic Problems Using Second-Order Cone Programming
(with B. Ghaddar and J. Vera).
Submitted for publication.
Until it appears in print, this paper will be available via
Optimization Online
and you may access it directly by clicking
here.
Numerical Study of Affine Supply Function Equilibrium in AC Network-Constrained Markets
(with G.Bautista and A. Vannelli).
IEEE Transactions on Power Systems, Vol. 22 (3), 2007, 1174-1184.
Formulation of Oligopolistic Competition in AC Power Networks: An NLP Approach
(with G.Bautista and A. Vannelli).
IEEE Transactions on Power Systems, Vol. 22 (1), 2007, 105-115.
On the Computational Performance of a Semidefinite Programming Approach to Single Row Layout Problems
(with A. Vannelli).
In:
Proceedings of Operations Research 2005,
Hans-Dietrich Haasis, Herbert Kopfer, Jörn Schönberger, Eds.
Springer-Verlag, 2006, 277-282.
Maximising Revenue in the Airline Industry Under One-Way Pricing
(with R.C.H. Cheng and C.S.M. Currie).
Journal of the Operational Research Society, Vol. 55 (5), 2004, 535-541.
2003
Proofs of Unsatisfiability via Semidefinite Programming.
In:
Proceedings of Operations Research 2003,
Dino Ahr, Roland Fahrion, Marcus Oswald, Gerhard Reinelt, Eds.
Springer-Verlag, 2004, 308-315.
Revenue Management for Perishable Products Using Simulation
(with R.C.H. Cheng and C.S.M. Currie).
In: Proceedings of UKSim 03, D. Al-Dabass Ed., 2003, 114-120.
Semidefinite Programming for Discrete Optimization and
Matrix Completion Problems (with H. Wolkowicz).
Discrete Applied Mathematics, Vol. 123/124, 2002, 507-571.
Strengthened Semidefinite Relaxations via a Second Lifting
for the Max-Cut Problem (with H. Wolkowicz).
Discrete Applied Mathematics, Vol. 119 (1-2), 2002, 79-106.
2001
New Convex Relaxations for the Maximum Cut and VLSI Layout Problems
Doctoral Dissertation,
Combinatorics and Optimization,
University of Waterloo, Canada,
June 2001.
The complete text (in PDF format) of the
dissertation is available
on the University's collection of
Electronic Theses and Dissertations.
Click
here
to access my thesis directly.
Solving the Generalized Symmetric Eigenvalue Problem.
School of Computer Science, McGill University, December 1991.
(My Honours B.Sc. project, consisting of research work
in collaboration with C.C. Paige and S. Hammarling).