Mihály Csaba Markót

Orcid: 0000-0002-0747-6242

According to our database1, Mihály Csaba Markót authored at least 19 papers between 2000 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Enabling technology models with nonlinearities in the synthesis of wastewater treatment networks based on the P-graph framework.
Comput. Chem. Eng., 2022

2021
Improved interval methods for solving circle packing problems in the unit square.
J. Glob. Optim., 2021

2019
Rigorous packing of unit squares into a circle.
J. Glob. Optim., 2019

2014
Exclusion regions for optimization problems.
J. Glob. Optim., 2014

Bound constrained interval global optimization in the COCONUT Environment.
J. Glob. Optim., 2014

2013
On Solving Mixed-Integer Constraint Satisfaction Problems with Unbounded Variables.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2013

2012
Algorithmic differentiation techniques for global optimization in the COCONUT environment.
Optim. Methods Softw., 2012

Black Box Optimization Benchmarking of the GLOBAL Method.
Evol. Comput., 2012

2011
Comparison and Automated Selection of Local Optimization Solvers for Interval Global Optimization Methods.
SIAM J. Optim., 2011

2009
Geometrical Optimization of Parallel Mechanisms Based on Natural Frequency Evaluation: Application to a Spherical Mechanism for Future Space Applications.
IEEE Trans. Robotics, 2009

Improved lower bounds for semi-online bin packing problems.
Computing, 2009

2007
Use of an interval global optimization tool for exploring feasibility of batch extractive distillation.
J. Glob. Optim., 2007

New Approaches to Circle Packing in a Square - With Program Codes.
Optimization and its applications 6, Springer, ISBN: 978-0-387-45673-7, 2007

2006
New interval methods for constrained global optimization.
Math. Program., 2006

A Reliable Area Reduction Technique for Solving Circle Packing Problems.
Computing, 2006

2005
A New Verified Optimization Technique for the "Packing Circles in a Unit Square" Problems.
SIAM J. Optim., 2005

2004
Optimal Packing of 28 Equal Circles in a Unit Square - The First Reliable Solution.
Numer. Algorithms, 2004

2000
Multisection in Interval Branch-and-Bound Methods for Global Optimization II. Numerical Tests.
J. Glob. Optim., 2000

Multisection in Interval Branch-and-Bound Methods for Global Optimization - I. Theoretical Results.
J. Glob. Optim., 2000


  Loading...