Marianna Nagy

Orcid: 0000-0003-3688-412X

Affiliations:
  • Budapest University of Technology and Economics, Institute of Mathematics, Hungary


According to our database1, Marianna Nagy authored at least 15 papers between 2007 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Overview of Hungarian operations research based on the VOCAL 2022 conference.
Central Eur. J. Oper. Res., December, 2024

A New Ai-Zhang Type Interior Point Algorithm for Sufficient Linear Complementarity Problems.
J. Optim. Theory Appl., July, 2024

Sufficient Matrices: Properties, Generating and Testing.
J. Optim. Theory Appl., July, 2024

Mixed integer linear programming formulation for K-means clustering problem.
Central Eur. J. Oper. Res., March, 2024

Computing a common prior.
Oper. Res. Lett., 2024

2023
A new long-step interior point algorithm for linear programming based on the algebraic equivalent transformation.
Central Eur. J. Oper. Res., September, 2023

2019
Market exchange models and geometric programming.
Central Eur. J. Oper. Res., 2019

2014
Forbidden minor characterizations for low-rank optimal solutions to semidefinite programs over the elliptope.
J. Comb. Theory B, 2014

Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems.
Eur. J. Oper. Res., 2014

2013
On semidefinite programming bounds for graph bandwidth.
Optim. Methods Softw., 2013

2012
On bounded rank positive semidefinite matrix completions of extreme partial correlation matrices
CoRR, 2012

2011
On the complexity of computing the handicap of a sufficient matrix.
Math. Program., 2011

2010
A polynomial path-following interior point algorithm for general linear complementarity problems.
J. Glob. Optim., 2010

Polynomial Interior Point Algorithms for General Linear Complementarity Problems.
Algorithmic Oper. Res., 2010

2007
A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems.
Eur. J. Oper. Res., 2007


  Loading...