Toth, Boglarka Author

New methods for maximizing the smallest eigenvalue of the grounded Laplacian matrix

  • Ahmad T. Anaqreh
  • Boglárka G.-Tóth
  • Tamás Vinkó

Annales Mathematicae et Informaticae - 2024

10.33039/ami.2024.02.001

  • ORCID

Customer selection rules in competitive facility location

  • Boglárka G.-Tóth

Annales Mathematicae et Informaticae - 2024

10.33039/ami.2024.02.003

  • ORCID

A Huff-like location model with quality adjustment and/or closing of existing facilities

  • Boglárka G. -Táth
  • Laura Anton-Sanchez
  • José Fernández

European Journal of Operational Research - 03/2024

10.1016/j.ejor.2023.08.054

  • ORCID

The Fritz-John Condition System in Interval Branch and Bound method

  • Mihály Gencsi
  • Boglárka G.-Tóth

Annales Mathematicae et Informaticae - 2023

10.33039/ami.2023.08.005

  • ORCID

Solving the 1-median problem on a network with continuous demand and demand surplus

  • Rafael Blanquero
  • Emilio Carrizosa
  • Boglárka G.-Tóth
  • Kristóf Kovács

Computers & Operations Research - 1/08/2023

10.1016/j.cor.2023.106399

Cite count:

Local search versus linear programming to detect monotonicity in simplicial branch and bound

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

Journal of Global Optimization - 11/07/2023

10.1007/s10898-023-01310-y

Cite count:

Algorithmic upper bounds for graph geodetic number

  • Ahmad T. Anaqreh
  • Boglárka G.-Tóth
  • Tamás Vinkó

Central European Journal of Operations Research - 10/12/2022

10.1007/s10100-021-00760-7

Cite count: 1 (Web of Science) 1 (Scopus)

On monotonicity and search strategies in face-based copositivity detection algorithms

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

Central European Journal of Operations Research - 6/09/2022

10.1007/s10100-021-00737-6

Cite count: 1 (Scopus)

Symbolic Regression for Approximating Graph Geodetic Number

  • Ahmad T. Anaqreh
  • Boglárka G.-Tóth
  • Tamás Vinkó

Acta Cybernetica - 4/08/2021

10.14232/actacyb.289041

On new methods to construct lower bounds in simplicial branch and bound based on interval arithmetic

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

Journal of Global Optimization - 10/07/2021

10.1007/s10898-021-01053-8

Cite count: 2 (Web of Science)

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

Cite count:
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

Cite count:
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

Cite count: 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

Cite count: 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

Cite count: 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

Cite count: 3 (Web of Science)
Open Access

Preface

  • Hendrix E.
  • Tóth B.

Springer Optimization and Its Applications - 1/1/2010

Cite count:

Rectangle covering

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

AIP Conference Proceedings - 12/2/2019

10.1063/1.5090003

Cite count: 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

Cite count: 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

Cite count: 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

Cite count: 1 (Scopus)

This author has no patents.

This author has no reports or other types of publications.

Scopus: 11

Web of Science: 11

Scopus: 13

Web of Science: 12

Last data update: 5/25/24 9:27 AM
Next scheduled update: 6/1/24 3:00 AM