Farid Alizadeh

25 papers A* 3B 1Misc 1Journal 20
YearRankTypeTitle / Venue / Authors
2025 J jnl
A faster dual algorithm for the Euclidean minimum covering ball problem.
Ann. Oper. Res.
Marta Cavaleiro, Farid Alizadeh
2022 J jnl
A branch-and-bound method for the minimum
Oper. Res. Lett.
Marta Cavaleiro, Farid Alizadeh
2021 J jnl
A dual simplex-type algorithm for the smallest enclosing ball of balls.
Comput. Optim. Appl.
Marta Cavaleiro, Farid Alizadeh
2019 J jnl
Preface.
Discret. Appl. Math.
Farid Alizadeh, Douglas Soares Gonçalves, Nathan Krislock, Leo Liberti
2018 J jnl
Preface: Special issue dedicated to Distance Geometry.
J. Glob. Optim.
Farid Alizadeh, Douglas Soares Gonçalves, Nathan Krislock, Leo Liberti
2017 J jnl
A branch-and-bound algorithm for the minimum radius $k$-enclosing ball problem.
CoRR
Marta Cavaleiro, Farid Alizadeh
2013 J jnl
Estimating arrival rate of nonhomogeneous Poisson processes with semidefinite programming.
Ann. Oper. Res.
Farid Alizadeh, Dávid Papp
2013 J jnl
Semidefinite Characterization of Sum-of-Squares Cones in Algebras.
SIAM J. Optim.
Dávid Papp, Farid Alizadeh
2011 J jnl
Bilinear optimality constraints for the cone of positive polynomials.
Math. Program.
Gábor Rudolf, Nilay Noyan, Dávid Papp, Farid Alizadeh
2011 Misc conf
Multivariate arrival rate estimation using semidefinite programming.
WSC
Dávid Papp, Farid Alizadeh
2011 J jnl
The
J. Optim. Theory Appl.
Farid Alizadeh, Yu Xia
2008 J jnl
Arrival Rate Approximation by Nonnegative Cubic Splines.
Oper. Res.
Farid Alizadeh, Jonathan Eckstein, Nilay Noyan, Gábor Rudolf
2008 J jnl
The Q method for second order cone programming.
Comput. Oper. Res.
Yu Xia, Farid Alizadeh
2003 J jnl
Extension of primal-dual interior point algorithms to symmetric cones.
Math. Program.
S. H. Schmieta, Farid Alizadeh
2003 J jnl
Second-order cone programming.
Math. Program.
Farid Alizadeh, Donald Goldfarb
2001 J jnl
Associative and Jordan Algebras, and Polynomial Time Interior-Point Algorithms for Symmetric Cones.
Math. Oper. Res.
S. H. Schmieta, Farid Alizadeh
1998 J jnl
Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results.
SIAM J. Optim.
Farid Alizadeh, Jean-Pierre A. Haeberly, Michael L. Overton
1997 J jnl
Complementarity and nondegeneracy in semidefinite programming.
Math. Program.
Farid Alizadeh, Jean-Pierre A. Haeberly, Michael L. Overton
1995 J jnl
Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization.
SIAM J. Optim.
Farid Alizadeh
1995 J jnl
Physical Mapping of Chromosomes Using Unique Probes.
J. Comput. Biol.
Farid Alizadeh, Richard M. Karp, Deborah K. Weisser, Geoffrey Zweig
1995 J jnl
Physical Mapping of Chromosomes: A Combinatorial Problem in Molecular Biology.
Algorithmica
Farid Alizadeh, Richard M. Karp, Lee Aaron Newberg, Deborah K. Weisser
1994 A* conf
Physical Mapping of Chromosomes Using Unique Probes.
SODA
Farid Alizadeh, Richard M. Karp, Deborah K. Weisser, Geoffrey Zweig
1993 A* conf
Physical Mapping of Chromosomes: A Combinatorial Problem in Molecular Biology.
SODA
Farid Alizadeh, Richard M. Karp, Lee Aaron Newberg, Deborah K. Weisser
1992 B conf
Combinatorial Optimization with Semi-Definite Matrices.
IPCO
Farid Alizadeh
1991 A* conf
A Sublinear-Time Randomized Parallel Algorithm for the Maximum Clique Problem in Perfect Graphs.
SODA
Farid Alizadeh