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

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

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

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

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

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

A Huff-like location model with quality adjustment and/or closing of existing facilities. - G.-Tóth, Boglárka; Anton-Sanchez, Laura; Fernández, José (Eur. J. Oper. Res., 2024)

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

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

Solving the 1-median problem on a network with continuous demand and demand surplus. - Blanquero, Rafael; Carrizosa, Emilio; G.-Tóth, Boglárka; Kovács, Kristóf (Comput. Oper. Res., 2023)

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

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

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

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

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

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

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

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

Algorithmic upper bounds for graph geodetic number. - Anaqreh, Ahmad T.; G.-Tóth, Boglárka; Vinkó, Tamás (CoRR, 2020)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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