Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBoglárka G.-Tóth
Person information
- affiliation: Budapest University of Technology and Economics, Department of Differential Equations
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j28]Boglárka G.-Tóth
, Laura Anton-Sanchez, José Fernández:
A Huff-like location model with quality adjustment and/or closing of existing facilities. Eur. J. Oper. Res. 313(3): 937-953 (2024)- 2023
- [j27]Rafael Blanquero, Emilio Carrizosa, Boglárka G.-Tóth, Kristóf Kovács:
Solving the 1-median problem on a network with continuous demand and demand surplus. Comput. Oper. Res. 160: 106399 (2023) - 2022
- [j26]Boglárka G.-Tóth, Eligius M. T. Hendrix, Leocadio G. Casado:
On monotonicity and search strategies in face-based copositivity detection algorithms. Central Eur. J. Oper. Res. 30(3): 1071-1092 (2022) - [j25]Kristóf Kovács, Boglárka Tóth:
Optimized location of light sources to cover a rectangular region. Central Eur. J. Oper. Res. 30(3): 1129-1149 (2022) - [j24]Ahmad T. Anaqreh, Boglárka G.-Tóth, Tamás Vinkó:
Algorithmic upper bounds for graph geodetic number. Central Eur. J. Oper. Res. 30(4): 1221-1237 (2022) - 2021
- [j23]Ahmad T. Anaqreh, Boglárka G.-Tóth, Tamás Vinkó:
Symbolic Regression for Approximating Graph Geodetic Number. Acta Cybern. 25(2): 151-169 (2021) - [j22]Boglárka G.-Tóth, Leocadio G. Casado, Eligius M. T. Hendrix, Frédéric Messine:
On new methods to construct lower bounds in simplicial branch and bound based on interval arithmetic. J. Glob. Optim. 80(4): 779-804 (2021) - [j21]Eligius M. T. Hendrix, Boglárka G.-Tóth, Frédéric Messine, Leocadio G. Casado:
On derivative based bounding for simplicial branch and bound. RAIRO Oper. Res. 55(3): 2023-2034 (2021) - 2019
- [j20]José Fernández, Boglárka G.-Tóth, Juana López Redondo, Pilar M. Ortigosa:
The probabilistic customer's choice rule with a threshold attraction value: Effect on the location of competitive facilities in the plane. Comput. Oper. Res. 101: 234-249 (2019) - 2017
- [j19]José Fernández, Boglárka G.-Tóth, Juana López Redondo, Pilar M. Ortigosa, Aránzazu Gila Arrondo:
A planar single-facility competitive location and design problem under the multi-deterministic choice rule. Comput. Oper. Res. 78: 305-315 (2017) - [j18]Jose M. G. Salmerón, Guillermo Aparicio, Leocadio G. Casado, Inmaculada García, Eligius M. T. Hendrix, Boglárka G.-Tóth:
Generating a smallest binary tree by proper selection of the longest edges to bisect in a unit simplex refinement. J. Comb. Optim. 33(2): 389-402 (2017) - 2016
- [j17]Rafael Blanquero, Emilio Carrizosa, Boglárka G.-Tóth, Amaya Nogales-Gómez:
p-facility Huff location problem on networks. Eur. J. Oper. Res. 255(1): 34-42 (2016) - [j16]Boglárka G.-Tóth, Kristóf Kovács:
Solving a Huff-like Stackelberg location problem on networks. J. Glob. Optim. 64(2): 233-247 (2016) - [j15]Boglárka G.-Tóth, Eligius M. T. Hendrix, Leocadio G. Casado, Inmaculada García:
On refinement of the unit simplex using regular simplices. J. Glob. Optim. 64(2): 305-323 (2016) - 2015
- [j14]Guillermo Aparicio, Leocadio G. Casado, Eligius M. T. Hendrix, Boglárka G.-Tóth, Inmaculada García:
On the Minimum Number of Simplex Shapes in Longest Edge Bisection Refinement of a Regular n-Simplex. Informatica 26(1): 17-32 (2015) - 2014
- [j13]José Fernández, Saïd Salhi, Boglárka G.-Tóth:
Location equilibria for a continuous competitive facility location problem under delivered pricing. Comput. Oper. Res. 41: 185-195 (2014) - 2011
- [j12]Leocadio G. Casado, Inmaculada García, Boglárka G.-Tóth, Eligius M. T. Hendrix:
On determining the cover of a simplex by spheres centered at its vertices. J. Glob. Optim. 50(4): 645-655 (2011) - 2010
- [j11]Balázs Torma, Boglárka G.-Tóth:
An efficient descent direction method with cutting planes. Central Eur. J. Oper. Res. 18(2): 105-130 (2010) - 2009
- [j10]Boglárka G.-Tóth, Vladik Kreinovich:
Verified Methods for Computing Pareto Sets: General Algorithmic Analysis. Int. J. Appl. Math. Comput. Sci. 19(3): 369-380 (2009) - [j9]José Fernández, Boglárka Tóth:
Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods. Comput. Optim. Appl. 42(3): 393-419 (2009) - [j8]Boglárka Tóth, José Fernández, Blas Pelegrín, Frank Plastria:
Sequential versus simultaneous approach in the location and design of two new facilities using planar Huff-like models. Comput. Oper. Res. 36(5): 1393-1405 (2009) - [j7]Boglárka Tóth, Frank Plastria, José Fernández, Blas Pelegrín:
On the impact of spatial pattern, aggregation, and model parameters in planar Huff-type competitive location and design problems. OR Spectr. 31(3): 601-627 (2009) - 2008
- [j6]Blas Pelegrín, José Fernández, Boglárka Tóth:
The 1-center problem in the plane with independent random weights. Comput. Oper. Res. 35(3): 737-749 (2008) - 2007
- [j5]José Fernández, Blas Pelegrín, Frank Plastria, Boglárka Tóth:
Solving a Huff-like competitive location and design model for profit maximization in the plane. Eur. J. Oper. Res. 179(3): 1274-1287 (2007) - [j4]Boglárka Tóth, Leocadio G. Casado:
Multi-dimensional pruning from the Baumann point in an Interval Global Optimization Algorithm. J. Glob. Optim. 38(2): 215-236 (2007) - [j3]José Fernández, Boglárka Tóth:
Obtaining an outer approximation of the efficient set of nonlinear biobjective problems. J. Glob. Optim. 38(2): 315-331 (2007) - 2005
- [j2]Boglárka Tóth, Tibor Csendes:
Empirical Investigation of the Convergence Speed of Inclusion Functions in a Global Optimization Context. Reliab. Comput. 11(4): 253-273 (2005) - 2004
- [j1]J. A. Martínez, Leocadio G. Casado, Inmaculada García, Yaroslav D. Sergeyev, Boglárka Tóth:
On an Efficient Use of Gradient Information for Accelerating Interval Global Optimization Algorithms. Numer. Algorithms 37(1-4): 61-69 (2004)
Conference and Workshop Papers
- 2022
- [c6]Leocadio G. Casado, Boglárka G.-Tóth, Eligius M. T. Hendrix, Frédéric Messine:
On Monotonicity Detection in Simplicial Branch and Bound over a Simplex. ICCSA (Workshops 2) 2022: 113-126 - 2019
- [c5]Boglárka G.-Tóth, Laura Anton-Sanchez, José Fernández, Juana López Redondo, Pilar M. Ortigosa:
A Continuous Competitive Facility Location and Design Problem for Firm Expansion. WCGO 2019: 1013-1022 - 2017
- [c4]Leocadio G. Casado, Eligius M. T. Hendrix, Jose M. G. Salmerón, Boglárka G.-Tóth, Inmaculada García:
On Grid Aware Refinement of the Unit Hypercube and Simplex: Focus on the Complete Tree Size. ICCSA (3) 2017: 165-180 - 2014
- [c3]Guillermo Aparicio, Leocadio G. Casado, Boglárka G.-Tóth, Eligius M. T. Hendrix, Inmaculada García:
Heuristics to Reduce the Number of Simplices in Longest Edge Bisection Refinement of a Regular n-Simplex. ICCSA (2) 2014: 115-125 - 2013
- [c2]Guillermo Aparicio, Leocadio G. Casado, Eligius M. T. Hendrix, Inmaculada García, Boglárka Tóth:
On Computational Aspects of a Regular n-Simplex Bisection. 3PGCIC 2013: 513-518 - 1999
- [c1]Márk Jelasity, Boglárka G.-Tóth, Tamás Vinkó:
Characterizations of trajectory structure of fitness landscapes based on pairwise transition probabilities of solutions. CEC 1999: 623-630
Informal and Other Publications
- 2023
- [i2]Ahmad T. Anaqreh, Boglárka G.-Tóth, Tamás Vinkó:
Exact Methods for the Longest Induced Cycle Problem. CoRR abs/2311.15899 (2023) - 2020
- [i1]Ahmad T. Anaqreh, Boglárka G.-Tóth, Tamás Vinkó:
Algorithmic upper bounds for graph geodetic number. CoRR abs/2011.10989 (2020)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 02:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
