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)

The probabilistic customer's choice rule with a threshold attraction value: Effect on the location of competitive facilities in the plane

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

COMPUTERS and OPERATIONS RESEARCH - 1/1/2019

10.1016/j.cor.2018.08.001

Número de citas: 20 (Web of Science) 9 (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)

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

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

Número de citas:

Solving a Huff-like Stackelberg location problem on networks

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

JOURNAL OF GLOBAL OPTIMIZATION - 1/2/2016

10.1007/s10898-015-0368-2

Número de citas: 7 (Web of Science) 7 (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)

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)
Open Access

Preface

  • Hendrix E.
  • Tóth B.

Springer Optimization and Its Applications - 1/1/2010

Número de citas:

Planar location and design of a new facility with inner and outer competition: An interval lexicographical-like solution procedure

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

Networks and Spatial Economics - 1/3/2007

10.1007/s11067-006-9005-4

Número de citas: 29 (Web of Science) 33 (Scopus)
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

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

Nonlinear programming algorithms

  • Hendrix E.
  • Tóth B.

Springer Optimization and Its Applications - 1/1/2010

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

Número de citas: 1 (Scopus)
Open Access

NLP optimality conditions

  • Hendrix E.
  • Tóth B.

Springer Optimization and Its Applications - 1/1/2010

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

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

Mathematical modeling, cases

  • Hendrix E.
  • Tóth B.

Springer Optimization and Its Applications - 1/1/2010

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

Número de citas:

Localización competitiva en el plano con decisiones en diseño

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

Avances en localización de servicios y sus aplicaciones - 2004

  • ORCID

Introduction to Nonlinear and Global Optimization

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

2010

  • ORCID

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

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

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)

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

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)

Reconciling franchisor and franchisee: A planar biobjective competitive location and design model

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

Lecture Notes in Economics and Mathematical Systems - 1/12/2006

10.1007/3-540-28258-0_22

Número de citas: 12 (Scopus)

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

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

2005

  • ORCID
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)

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)

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)

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)

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)
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)

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: 23/03/24 6:17
Próxima recolección programada: 30/03/24 3:00