Toth, Boglarka Author

On derivative based bounding for simplicial branch and bound

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

RAIRO - Operations Research - 1/5/2021

10.1051/ro/2021081

Cite count:

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 - 1/1/2021

10.1007/s10898-021-01053-8

Cite count:

Optimized location of light sources to cover a rectangular region

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

Central European Journal of Operations Research - 1/1/2021

10.1007/s10100-021-00753-6

Cite count: 1 (Web of Science)

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

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/07/2021

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/03/2021

10.1007/s10100-021-00737-6

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

Cite count: 18 (Web of Science) 9 (Scopus)

Generating a smallest binary tree by proper selection of the longest edges to bisect in a unit simplex refinement

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

Journal of Combinatorial Optimization - 1/2/2017

10.1007/s10878-015-9970-y

Cite count: 6 (Web of Science) 5 (Scopus)

A planar single-facility competitive location and design problem under the multi-deterministic choice rule

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

Computers and Operations Research - 1/2/2017

10.1016/j.cor.2016.09.019

Cite count: 17 (Web of Science) 13 (Scopus)

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

Cite count: 7 (Web of Science) 7 (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

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)

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

Introduction to Nonlinear and Global Optimization

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

2010

  • ORCID
Open Access

Deterministic GO algorithms

  • Hendrix E.
  • Tóth B.

Springer Optimization and Its Applications - 1/1/2010

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

Cite count: 1 (Web of Science) 1 (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

Cite count: 3 (Web of Science)
Open Access

Goodness of optimization algorithms

  • Hendrix E.
  • Tóth B.

Springer Optimization and Its Applications - 1/1/2010

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

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

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

Cite count: 1 (Web of Science)
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:

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

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

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

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

Cite count: 24 (Web of Science) 25 (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

Cite count: 12 (Scopus)

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

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

2005

  • ORCID

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/27/23 3:58 PM
Next scheduled update: 6/3/23 3:00 AM