Boglárka G.-Tóth

31 papers B 1Journal 26Unranked 4
YearRankTypeTitle / Venue / Authors
2025 J jnl
A Quantum Constraint Generation Framework for Binary Linear Programs.
CoRR
András Czégel, Boglárka G.-Tóth
2025 J jnl
Efficient use of optimality conditions in Interval Branch and Bound methods.
EURO J. Comput. Optim.
Mihály Gencsi, Boglárka G.-Tóth
2025 J jnl
Exponential Separation Criteria for Quantum Iterative Power Algorithms.
CoRR
András Czégel, Boglárka G.-Tóth
2025 J jnl
Preface.
J. Glob. Optim.
Tibor Csendes, Boglárka G.-Tóth, Tamás Vinkó
2025 J jnl
Special Issue: Global Optimization.
Math. Program.
Tibor Csendes, Boglárka G.-Tóth, Marco Locatelli
2024 J jnl
A Huff-like location model with quality adjustment and/or closing of existing facilities.
Eur. J. Oper. Res.
Boglárka G.-Tóth, Laura Anton-Sanchez, José Fernández
2024 J jnl
On Dealing with Minima at the Border of a Simplicial Feasible Area in Simplicial Branch and Bound.
J. Optim. Theory Appl.
Boglárka G.-Tóth, Eligius M. T. Hendrix, Leocadio G. Casado, Frédéric Messine
2023 J jnl
Exact Methods for the Longest Induced Cycle Problem.
CoRR
Ahmad T. Anaqreh, Boglárka G.-Tóth, Tamás Vinkó
2023 J jnl
Solving the 1-median problem on a network with continuous demand and demand surplus.
Comput. Oper. Res.
Rafael Blanquero, Emilio Carrizosa, Boglárka G.-Tóth, Kristóf Kovács
2022 J jnl
Algorithmic upper bounds for graph geodetic number.
Central Eur. J. Oper. Res.
Ahmad T. Anaqreh, Boglárka G.-Tóth, Tamás Vinkó
2022 — conf
On Monotonicity Detection in Simplicial Branch and Bound over a Simplex.
ICCSA (Workshops 2)
Leocadio G. Casado, Boglárka G.-Tóth, Eligius M. T. Hendrix, Frédéric Messine
2022 J jnl
On monotonicity and search strategies in face-based copositivity detection algorithms.
Central Eur. J. Oper. Res.
Boglárka G.-Tóth, Eligius M. T. Hendrix, Leocadio G. Casado
2021 J jnl
On derivative based bounding for simplicial branch and bound.
RAIRO Oper. Res.
Eligius M. T. Hendrix, Boglárka G.-Tóth, Frédéric Messine, Leocadio G. Casado
2021 J jnl
On new methods to construct lower bounds in simplicial branch and bound based on interval arithmetic.
J. Glob. Optim.
Boglárka G.-Tóth, Leocadio G. Casado, Eligius M. T. Hendrix, Frédéric Messine
2021 J jnl
Symbolic Regression for Approximating Graph Geodetic Number.
Acta Cybern.
Ahmad T. Anaqreh, Boglárka G.-Tóth, Tamás Vinkó
2020 J jnl
Algorithmic upper bounds for graph geodetic number.
CoRR
Ahmad T. Anaqreh, Boglárka G.-Tóth, Tamás Vinkó
2019 — conf
A Continuous Competitive Facility Location and Design Problem for Firm Expansion.
WCGO
Boglárka G.-Tóth, Laura Anton-Sanchez, José Fernández, Juana López Redondo, Pilar M. Ortigosa
2019 J jnl
The probabilistic customer's choice rule with a threshold attraction value: Effect on the location of competitive facilities in the plane.
Comput. Oper. Res.
José Fernández, Boglárka G.-Tóth, Juana López Redondo, Pilar M. Ortigosa
2017 J jnl
A planar single-facility competitive location and design problem under the multi-deterministic choice rule.
Comput. Oper. Res.
José Fernández, Boglárka G.-Tóth, Juana López Redondo, Pilar M. Ortigosa, Aránzazu Gila Arrondo
2017 J jnl
Generating a smallest binary tree by proper selection of the longest edges to bisect in a unit simplex refinement.
J. Comb. Optim.
Jose M. G. Salmerón, Guillermo Aparicio, Leocadio G. Casado, Inmaculada García, Eligius M. T. Hendrix, Boglárka G.-Tóth
2017 — conf
On Grid Aware Refinement of the Unit Hypercube and Simplex: Focus on the Complete Tree Size.
ICCSA (3)
Leocadio G. Casado, Eligius M. T. Hendrix, Jose M. G. Salmerón, Boglárka G.-Tóth, Inmaculada García
2016 J jnl
On refinement of the unit simplex using regular simplices.
J. Glob. Optim.
Boglárka G.-Tóth, Eligius M. T. Hendrix, Leocadio G. Casado, Inmaculada García
2016 J jnl
Solving a Huff-like Stackelberg location problem on networks.
J. Glob. Optim.
Boglárka G.-Tóth, Kristóf Kovács
2016 J jnl
p-facility Huff location problem on networks.
Eur. J. Oper. Res.
Rafael Blanquero, Emilio Carrizosa, Boglárka G.-Tóth, Amaya Nogales-Gómez
2015 J jnl
On the Minimum Number of Simplex Shapes in Longest Edge Bisection Refinement of a Regular n-Simplex.
Informatica
Guillermo Aparicio, Leocadio G. Casado, Eligius M. T. Hendrix, Boglárka G.-Tóth, Inmaculada García
2014 — conf
Heuristics to Reduce the Number of Simplices in Longest Edge Bisection Refinement of a Regular n-Simplex.
ICCSA (2)
Guillermo Aparicio, Leocadio G. Casado, Boglárka G.-Tóth, Eligius M. T. Hendrix, Inmaculada García
2014 J jnl
Location equilibria for a continuous competitive facility location problem under delivered pricing.
Comput. Oper. Res.
José Fernández, Saïd Salhi, Boglárka G.-Tóth
2011 J jnl
On determining the cover of a simplex by spheres centered at its vertices.
J. Glob. Optim.
Leocadio G. Casado, Inmaculada García, Boglárka G.-Tóth, Eligius M. T. Hendrix
2010 J jnl
An efficient descent direction method with cutting planes.
Central Eur. J. Oper. Res.
Balázs Torma, Boglárka G.-Tóth
2009 J jnl
Verified Methods for Computing Pareto Sets: General Algorithmic Analysis.
Int. J. Appl. Math. Comput. Sci.
Boglárka G.-Tóth, Vladik Kreinovich
1999 B conf
Characterizations of trajectory structure of fitness landscapes based on pairwise transition probabilities of solutions.
CEC
Márk Jelasity, Boglárka G.-Tóth, Tamás Vinkó