Characterizations of trajectory structure of fitness landscapes based on pairwise transition probabilities of solutions. - Márk Jelasity; Boglárka G.-Tóth; Tamás Vinkó (CEC, 1999)

On an Efficient Use of Gradient Information for Accelerating Interval Global Optimization Algorithms. - J. A. Martínez; Leocadio G. Casado; Inmaculada García; Yaroslav D. Sergeyev; Boglárka Tóth (Numer. Algorithms, 2004)

Empirical Investigation of the Convergence Speed of Inclusion Functions in a Global Optimization Context. - Boglárka Tóth; Tibor Csendes (Reliab. Comput., 2005)

Solving a Huff-like competitive location and design model for profit maximization in the plane. - José Fernández 001; Blas Pelegrín; Frank Plastria; Boglárka Tóth (Eur. J. Oper. Res., 2007)

Obtaining an outer approximation of the efficient set of nonlinear biobjective problems. - José Fernández 001; Boglárka Tóth (J. Glob. Optim., 2007)

Multi-dimensional pruning from the Baumann point in an Interval Global Optimization Algorithm. - Boglárka Tóth; Leocadio G. Casado (J. Glob. Optim., 2007)

The 1-center problem in the plane with independent random weights. - Blas Pelegrín; José Fernández 001; Boglárka Tóth (Comput. Oper. Res., 2008)

Verified Methods for Computing Pareto Sets: General Algorithmic Analysis. - Boglárka G.-Tóth; Vladik Kreinovich (Int. J. Appl. Math. Comput. Sci., 2009)

Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods. - José Fernández 001; Boglárka Tóth (Comput. Optim. Appl., 2009)

Sequential versus simultaneous approach in the location and design of two new facilities using planar Huff-like models. - Boglárka Tóth; José Fernández 001; Blas Pelegrín; Frank Plastria (Comput. Oper. Res., 2009)

On the impact of spatial pattern, aggregation, and model parameters in planar Huff-type competitive location and design problems. - Boglárka Tóth; Frank Plastria; José Fernández 001; Blas Pelegrín (OR Spectr., 2009)

An efficient descent direction method with cutting planes. - Balázs Torma; Boglárka G.-Tóth (Central Eur. J. Oper. Res., 2010)

On determining the cover of a simplex by spheres centered at its vertices. - Leocadio G. Casado; Inmaculada García; Boglárka G.-Tóth; Eligius M. T. Hendrix (J. Glob. Optim., 2011)

On Computational Aspects of a Regular n-Simplex Bisection. - Guillermo Aparicio; Leocadio G. Casado; Eligius M. T. Hendrix; Inmaculada García; Boglárka Tóth (3PGCIC, 2013)

Heuristics to Reduce the Number of Simplices in Longest Edge Bisection Refinement of a Regular n-Simplex. - Guillermo Aparicio; Leocadio G. Casado; Boglárka G.-Tóth; Eligius M. T. Hendrix; Inmaculada García (ICCSA (2), 2014)

Location equilibria for a continuous competitive facility location problem under delivered pricing. - José Fernández 001; Saïd Salhi; Boglárka G.-Tóth (Comput. Oper. Res., 2014)

On the Minimum Number of Simplex Shapes in Longest Edge Bisection Refinement of a Regular n-Simplex. - Guillermo Aparicio; Leocadio G. Casado; Eligius M. T. Hendrix; Boglárka G.-Tóth; Inmaculada García (Informatica, 2015)

p-facility Huff location problem on networks. - Rafael Blanquero; Emilio Carrizosa; Boglárka G.-Tóth; Amaya Nogales-Gómez (Eur. J. Oper. Res., 2016)

On refinement of the unit simplex using regular simplices. - Boglárka G.-Tóth; Eligius M. T. Hendrix; Leocadio G. Casado; Inmaculada García (J. Glob. Optim., 2016)

Solving a Huff-like Stackelberg location problem on networks. - Boglárka G.-Tóth; Kristóf Kovács (J. Glob. Optim., 2016)

On Grid Aware Refinement of the Unit Hypercube and Simplex: Focus on the Complete Tree Size. - Leocadio G. Casado; Eligius M. T. Hendrix; Jose M. G. Salmerón; Boglárka G.-Tóth; Inmaculada García (ICCSA (3), 2017)

A planar single-facility competitive location and design problem under the multi-deterministic choice rule. - José Fernández 001; Boglárka G.-Tóth; Juana López Redondo; Pilar M. Ortigosa; Aránzazu Gila Arrondo (Comput. Oper. Res., 2017)

Generating a smallest binary tree by proper selection of the longest edges to bisect in a unit simplex refinement. - Jose M. G. Salmerón; Guillermo Aparicio; Leocadio G. Casado; Inmaculada García; Eligius M. T. Hendrix; Boglárka G.-Tóth (J. Comb. Optim., 2017)

A Continuous Competitive Facility Location and Design Problem for Firm Expansion. - Boglárka G.-Tóth; Laura Anton-Sanchez; José Fernández 001; Juana López Redondo; Pilar M. Ortigosa (WCGO, 2019)

The probabilistic customer's choice rule with a threshold attraction value: Effect on the location of competitive facilities in the plane. - José Fernández 001; Boglárka G.-Tóth; Juana López Redondo; Pilar M. Ortigosa (Comput. Oper. Res., 2019)

Symbolic Regression for Approximating Graph Geodetic Number. - Ahmad T. Anaqreh; Boglárka G.-Tóth; Tamás Vinkó (Acta Cybern., 2021)

On new methods to construct lower bounds in simplicial branch and bound based on interval arithmetic. - Boglárka G.-Tóth; Leocadio G. Casado; Eligius M. T. Hendrix; Frédéric Messine (J. Glob. Optim., 2021)

On derivative based bounding for simplicial branch and bound. - Eligius M. T. Hendrix; Boglárka G.-Tóth; Frédéric Messine; Leocadio G. Casado (RAIRO Oper. Res., 2021)

On Monotonicity Detection in Simplicial Branch and Bound over a Simplex. - Leocadio G. Casado; Boglárka G.-Tóth; Eligius M. T. Hendrix; Frédéric Messine (ICCSA (Workshops 2), 2022)

Algorithmic upper bounds for graph geodetic number. - Ahmad T. Anaqreh; Boglárka G.-Tóth; Tamás Vinkó (Central Eur. J. Oper. Res., 2022)

On monotonicity and search strategies in face-based copositivity detection algorithms. - Boglárka G.-Tóth; Eligius M. T. Hendrix; Leocadio G. Casado (Central Eur. J. Oper. Res., 2022)

Optimized location of light sources to cover a rectangular region. - Kristóf Kovács; Boglárka Tóth (Central Eur. J. Oper. Res., 2022)

Exact Methods for the Longest Induced Cycle Problem. - Ahmad T. Anaqreh; Boglárka G.-Tóth; Tamás Vinkó (CoRR, 2023)

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 (Comput. Oper. Res., 2023)

On Polytopal Branch and Bound with Monotonicity. - Eligius M. T. Hendrix; Leocadio G. Casado; Boglárka Gazdag-Tóth; Frédéric Messine (ICCSA (Workshops 2), 2024)

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 001 (Eur. J. Oper. Res., 2024)

On Dealing with Minima at the Border of a Simplicial Feasible Area in Simplicial Branch and Bound. - Boglárka G.-Tóth; Eligius M. T. Hendrix; Leocadio G. Casado; Frédéric Messine (J. Optim. Theory Appl., 2024)

Efficient use of optimality conditions in Interval Branch and Bound methods. - Mihály Gencsi; Boglárka G.-Tóth (EURO J. Comput. Optim., 2025)

Exponential Separation Criteria for Quantum Iterative Power Algorithms. - András Czégel; Boglárka G.-Tóth (CoRR, 2025)

Local search versus linear programming to detect monotonicity in simplicial branch and bound. - Leocadio G. Casado; Boglárka Gazdag-Tóth; Eligius M. T. Hendrix; Frédéric Messine (J. Glob. Optim., 2025)

Preface. - Tibor Csendes; Boglárka G.-Tóth; Tamás Vinkó (J. Glob. Optim., 2025)

A Quantum Constraint Generation Framework for Binary Linear Programs. - András Czégel; Boglárka G.-Tóth (CoRR, 2025)

Special Issue: Global Optimization. - Tibor Csendes; Boglárka G.-Tóth; Marco Locatelli 001 (Math. Program., 2025)