Boglárka G.-Tóth
Orcid: 0000-0002-0927-111XAffiliations:
- Budapest University of Technology and Economics, Department of Differential Equations
According to our database1,
Boglárka G.-Tóth
authored at least 35 papers
between 1999 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
-
on math.bme.hu
On csauthors.net:
Bibliography
2024
A Huff-like location model with quality adjustment and/or closing of existing facilities.
Eur. J. Oper. Res., March, 2024
2023
Comput. Oper. Res., December, 2023
2022
Central Eur. J. Oper. Res., 2022
On monotonicity and search strategies in face-based copositivity detection algorithms.
Central Eur. J. Oper. Res., 2022
Proceedings of the Computational Science and Its Applications - ICCSA 2022 Workshops, 2022
2021
On new methods to construct lower bounds in simplicial branch and bound based on interval arithmetic.
J. Glob. Optim., 2021
2019
The probabilistic customer's choice rule with a threshold attraction value: Effect on the location of competitive facilities in the plane.
Comput. Oper. Res., 2019
Proceedings of the Optimization of Complex Systems: Theory, 2019
2017
Generating a smallest binary tree by proper selection of the longest edges to bisect in a unit simplex refinement.
J. Comb. Optim., 2017
A planar single-facility competitive location and design problem under the multi-deterministic choice rule.
Comput. Oper. Res., 2017
On Grid Aware Refinement of the Unit Hypercube and Simplex: Focus on the Complete Tree Size.
Proceedings of the Computational Science and Its Applications - ICCSA 2017, 2017
2016
2015
On the Minimum Number of Simplex Shapes in Longest Edge Bisection Refinement of a Regular n-Simplex.
Informatica, 2015
2014
Location equilibria for a continuous competitive facility location problem under delivered pricing.
Comput. Oper. Res., 2014
Heuristics to Reduce the Number of Simplices in Longest Edge Bisection Refinement of a Regular n-Simplex.
Proceedings of the Computational Science and Its Applications - ICCSA 2014 - 14th International Conference, Guimarães, Portugal, June 30, 2014
2013
Proceedings of the Eighth International Conference on P2P, 2013
2011
J. Glob. Optim., 2011
2010
Central Eur. J. Oper. Res., 2010
2009
On the impact of spatial pattern, aggregation, and model parameters in planar Huff-type competitive location and design problems.
OR Spectr., 2009
Sequential versus simultaneous approach in the location and design of two new facilities using planar Huff-like models.
Comput. Oper. Res., 2009
Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods.
Comput. Optim. Appl., 2009
Int. J. Appl. Math. Comput. Sci., 2009
2008
Comput. Oper. Res., 2008
2007
Multi-dimensional pruning from the Baumann point in an Interval Global Optimization Algorithm.
J. Glob. Optim., 2007
Obtaining an outer approximation of the efficient set of nonlinear biobjective problems.
J. Glob. Optim., 2007
Solving a Huff-like competitive location and design model for profit maximization in the plane.
Eur. J. Oper. Res., 2007
2005
Empirical Investigation of the Convergence Speed of Inclusion Functions in a Global Optimization Context.
Reliab. Comput., 2005
2004
On an Efficient Use of Gradient Information for Accelerating Interval Global Optimization Algorithms.
Numer. Algorithms, 2004
1999
Characterizations of trajectory structure of fitness landscapes based on pairwise transition probabilities of solutions.
Proceedings of the 1999 Congress on Evolutionary Computation, 1999