Publications

1996

Kluwer, Dordrecht, pp. 189-252.

Implementation of interior point methods for large scale linear programs

Authors

Andersen, ED

Gondzio, J.

Mészáros, Csaba

Xu, X.

Editors

Terlaky, T

1998

MTA SZTAKI, Budapest, pp. 14.

The separable and non-separable formulations of convex quadratic problems in interior point methods. (Working paper of the Laboratory of Operations Research and Decision Systems, (LORDS) WP 98-3.)

Authors

Mészáros, Csaba

2005

MTA SZTAKI, Budapest

Detecting â��denseâ�� columns in linear programs for interior point methods. (Working paper of the Laboratory of Operations Research and Decision Systems. (LORDS)WP05-5.)

Authors

Mészáros, Csaba

1995

In: KOI '95. 5th conference on operational research. Proceedings. Rab, 1995.

Visualization in the decision support system WINGDSS 4.0

Authors

Csáki, P.

Fölsz, F.

Keller, K.

Lóránt, G.

Mészáros, Csaba

Rapcsák, Tamás

Tóth, Á.

Editors

Hunjak, T

Martic, L

Neralic, LL

1997

Imperial College, London, pp. 8.

A respository of convex quadratic programming problems. (Technical report of Imperial College of Science, Technology and Medicine. Department of Computing, DOC 97/6.)

Authors

Maros, I.

Mészáros, Csaba

1999

OPTIMIZATION METHODS & SOFTWARE, 11-12, pp. CD Suppl.

BPMPD version 2.21

Authors

Mészáros, Csaba

2007

Computational Optimization and Applications, 36 (2-3)., pp. 309-320.

Detecting "dense" columns in interior point methods for linear programs

Authors

Mészáros, Csaba

1992

MTA SZTAKI, Budapest, pp. 16.

On sensitivity analysis of decision systems (Working paper of the Laboratory of Operations Research and Decision Systems (LORDS) WP 92-12)

Authors

Mészáros, Csaba

Rapcsák, Tamás

1995

ANNALS OF OPERATIONS RESEARCH, 58, pp. 3-17.

A numerically exact implementation of the simplex method

Authors

Maros, I.

Mészáros, Csaba

1998

MTA SZTAKI, Budapest, pp. 18.

The BPMPD interior point solver for convex quadratic problems. (Working paper of the Laboratory of Operations Research and Decision Systems, (LORDS) WP 98-8.)

Authors

Mészáros, Csaba

How to find us

Press contact

Artificial Intelligence Laboratory

Computational Optical Sensing and Processing Laboratory

Department of Distributed Systems

Department of Network Security and Internet Technologies

eLearning Department

Laboratory of Parallel and Distributed Systems

Machine Perception Research Laboratory

Research Laboratory on Engineering & Management Intelligence

Systems and Control Lab

ARP opening

HUN-REN SZTAKI and MILAB to participate in AI Summit

ISTIC delegation visits HUN-REN SZTAKI

Autonomous Robotics

Autonomous Vehicles

Cloud Computing and Services

Computer Science & AI

Cyber-Physical Production Systems

Cybersecurity

Distributed Systems

Machine Perception and Interaction

Mathematical Optimization and Statistical Machine Learning

U-learning, Multimedia, Virtual Tours

National Laboratories

Research Ventures

Project and Service Highlights

Ipar 4.0 National Technology Platform Association

HUN-REN Cloud

HUN-REN Data Repository Platform

Publications

Implementation of interior point methods for large scale linear programs

The separable and non-separable formulations of convex quadratic problems in interior point methods. (Working paper of the Laboratory of Operations Research and Decision Systems, (LORDS) WP 98-3.)

Detecting â��denseâ�� columns in linear programs for interior point methods. (Working paper of the Laboratory of Operations Research and Decision Systems. (LORDS)WP05-5.)

Visualization in the decision support system WINGDSS 4.0

A respository of convex quadratic programming problems. (Technical report of Imperial College of Science, Technology and Medicine. Department of Computing, DOC 97/6.)

BPMPD version 2.21

Detecting "dense" columns in interior point methods for linear programs

On sensitivity analysis of decision systems (Working paper of the Laboratory of Operations Research and Decision Systems (LORDS) WP 92-12)

A numerically exact implementation of the simplex method

The BPMPD interior point solver for convex quadratic problems. (Working paper of the Laboratory of Operations Research and Decision Systems, (LORDS) WP 98-8.)