Toth, Boglarka Autor

Open Access

Verified methods for computing pareto sets: General algorithmic analysis

  • G.-Tóth B.
  • Kreinovich V.

International Journal of Applied Mathematics and Computer Science - 1/9/2009

10.2478/v10006-009-0031-5

Número de citas: 5 (Web of Science) 8 (Scopus)

On the impact of spatial pattern, aggregation, and model parameters in planar Huff-type competitive location and design problems

  • Tóth B.
  • Plastria F.
  • Fernández J.
  • Pelegrín B.

OR SPECTRUM - 1/6/2009

10.1007/s00291-008-0163-2

Número de citas: 8 (Web of Science) 8 (Scopus)

Sequential versus simultaneous approach in the location and design of two new facilities using planar Huff-like models

  • Tóth B.
  • Fernández J.
  • Pelegrín B.
  • Plastria F.

COMPUTERS and OPERATIONS RESEARCH - 1/5/2009

10.1016/j.cor.2008.02.006

Número de citas: 31 (Web of Science) 32 (Scopus)

Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods

  • Fernández J.
  • Tóth B.

COMPUTATIONAL OPTIMIZATION AND APPLICATIONS - 1/1/2009

10.1007/s10589-007-9135-8

Número de citas: 41 (Web of Science) 32 (Scopus)

New trends in locational analysis

  • Arifusalem S.
  • Benati S.
  • Boffey B.
  • Cáceres T.
  • Cieslik D.
  • Drezner Z.
  • Eiselt H.
  • Giannikos I.
  • Hamacher H.
  • Hodgson J.
  • Kalcsics J.
  • Klamroth K.
  • Klopfensein O.
  • Landete-Ruiz M.
  • Cruz López de los Mozos Martin M.
  • Marín A.
  • Antonio Mesa J.
  • Ndiaye M.
  • Nickel S.
  • Pelegrin B.
  • Plastria F.
  • Puerto J.
  • Rodriguez-Chía A.
  • Saldanha-da-Gama F.
  • Schöbel A.
  • Schröder M.
  • Tóth B.
  • van Ommeren J.
  • Velten S.
... Ver más Contraer

Computers and Operations Research - 1/3/2008

10.1016/j.cor.2006.05.008

Número de citas: 1 (Scopus)

The 1-center problem in the plane with independent random weights

  • Pelegrín B.
  • Fernández J.
  • Tóth B.

Computers and Operations Research - 1/3/2008

10.1016/j.cor.2006.05.003

Número de citas: 4 (Web of Science) 3 (Scopus)

A practical algorithm for decomposing polygonal domains into convex polygons by diagonals

  • Fernández J.
  • Tóth B.
  • Cánovas L.
  • Pelegrín B.

TOP - 1/1/2008

10.1007/s11750-008-0055-2

Número de citas: 6 (Web of Science) 6 (Scopus)

Solving a Huff-like competitive location and design model for profit maximization in the plane

  • Fernández J.
  • Pelegrín B.
  • Plastria F.
  • Tóth B.

European Journal of Operational Research - 16/6/2007

10.1016/j.ejor.2006.02.005

Número de citas: 96 (Web of Science) 95 (Scopus)

Multi-dimensional pruning from the Baumann point in an Interval Global Optimization Algorithm

  • Tóth B.
  • Casado L.

Journal of Global Optimization - 1/6/2007

10.1007/s10898-006-9072-6

Número de citas: 5 (Web of Science) 6 (Scopus)

Obtaining an outer approximation of the efficient set of nonlinear biobjective problems

  • Fernández J.
  • Tóth B.

Journal of Global Optimization - 1/6/2007

10.1007/s10898-006-9132-y

Número de citas: 25 (Web of Science) 25 (Scopus)

Interval Tools in Branch-and-Bound Methods for Global Optimization

  • José Fernández
  • Boglárka G.-Tóth

2022

10.1007/978-3-030-96935-6_8

  • ORCID
Open Access

On Monotonicity Detection in Simplicial Branch and Bound over a Simplex

  • L. G. Casado
  • B. G.-Tóth
  • E. M. T. Hendrix
  • F. Messine

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) - 1/1/2022

10.1007/978-3-031-10562-3_9

Número de citas:
Open Access

A Continuous Competitive Facility Location and Design Problem for Firm Expansion

  • G.-Tóth B.
  • Anton-Sanchez L.
  • Fernández J.
  • Redondo J.
  • Ortigosa P.

Advances in Intelligent Systems and Computing - 1/1/2020

10.1007/978-3-030-21803-4_100

Número de citas:
Open Access

Huff-like stackelberg location problems on the plane

  • Fernández J.
  • Redondo J.
  • Ortigosa P.
  • Tóth B.

Springer Optimization and Its Applications - 1/1/2017

10.1007/978-3-319-52654-6_7

Número de citas: 1 (Web of Science)
Open Access

On grid aware refinement of the unit hypercube and simplex: Focus on the complete tree size

  • Casado L.
  • Hendrix E.
  • Salmerón J.
  • G.-Tóth B.
  • García I.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) - 1/1/2017

10.1007/978-3-319-62398-6_12

Número de citas: 2 (Web of Science) 1 (Scopus)
Open Access

Heuristics to reduce the number of simplices in longest edge bisection refinement of a regular n-simplex

  • Aparicio G.
  • Casado L.
  • G-Tóth B.
  • Hendrix E.
  • García I.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) - 1/1/2014

10.1007/978-3-319-09129-7_9

Número de citas: 5 (Web of Science) 5 (Scopus)

Introduction to Nonlinear and Global Optimization

  • Eligius, M. T. Hendrix
  • Boglárka, G. Tóth

2010

  • ORCID

Interval Methods for Single and Bi-objective Optimization Problems: applied to Competitive Facility Location Models

  • G. Tóth B
  • Fernández Hernández, J.

2010

  • ORCID
Open Access

Stochastic GO algorithms

  • Hendrix E.
  • Tóth B.

Springer Optimization and Its Applications - 1/1/2010

10.1007/978-0-387-88670-1_7

Número de citas: 3 (Web of Science)
Open Access

Preface

  • Hendrix E.
  • Tóth B.

Springer Optimization and Its Applications - 1/1/2010

Número de citas:

Rectangle covering

  • Kovács K.
  • Tóth B.

AIP Conference Proceedings - 12/2/2019

10.1063/1.5090003

Número de citas: 1 (Web of Science) 1 (Scopus)

On computational aspects of a regular n-simplex bisection

  • Aparicio G.
  • Casado L.
  • Hendrix E.
  • García I.
  • G.- Tóth B.

Proceedings - 2013 8th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing, 3PGCIC 2013 - 1/1/2013

10.1109/3pgcic.2013.88

Número de citas: 5 (Web of Science) 5 (Scopus)

Sensitivity analysis of the optimal solutions to Huff-type competitive location and design problems

  • Tóth, B.
  • Plastria, F.
  • Pelegrín, B.
  • Fernández, J.

2007

  • ORCID

Constraint-like methods for obtaining an outer approximation of the efficient set of nonlinear biobjective problems

  • Fernández, J.
  • Tóth, B.

2005

  • ORCID

Pruning a box from Baumann point in an Interval Global Optimization Algorithm

  • Tóth, B.
  • Casado, L. G.

2005

  • ORCID

A comprehensive study on the convergence speed and efficiency of inclusion functions for facility location problems

  • Tóth, B.
  • Fernández, J.
  • Csendes, T.

2004

  • ORCID

On an efficient use of gradient information for accelerating interval global optimization algorithms

  • Martínez J.
  • Casado L.
  • García I.
  • Sergeyev Y.
  • Tóth B.

Numerical Algorithms - 1/12/2004

10.1023/b:numa.0000049456.81410.fc

Número de citas: 11 (Web of Science) 10 (Scopus)

Characterizations of trajectory structure of fitness landscapes based on pairwise transition probabilities of solutions

  • Jelasity M.
  • Toth B.
  • Vinko T.

Proceedings of the 1999 Congress on Evolutionary Computation, CEC 1999 - 1/1/1999

10.1109/cec.1999.781990

Número de citas: 1 (Scopus)

Este autor no tiene patentes.

Este autor no tiene informes ni otros tipos de publicaciones.

Scopus: 11

Web of Science: 11

Scopus: 13

Web of Science: 12

Última actualización de los datos: 13/04/24 9:27
Próxima recolección programada: 20/04/24 3:00