Boglárka G.-Tóth

From MaRDI portal
Person:249512

Available identifiers

zbMath Open gazdag-toth.boglarkaMaRDI QIDQ249512

List of research outcomes





PublicationDate of PublicationType
On dealing with minima at the border of a simplicial feasible area in simplicial branch and bound2024-11-27Paper
Exact methods for the longest induced cycle problem2024-10-11Paper
A Huff-like location model with quality adjustment and/or closing of existing facilities2024-06-14Paper
The Fritz-John Condition System in Interval Branch and Bound method2024-03-22Paper
Solving the 1-median problem on a network with continuous demand and demand surplus2023-11-13Paper
Algorithmic upper bounds for graph geodetic number2022-12-09Paper
On monotonicity and search strategies in face-based copositivity detection algorithms2022-07-15Paper
Optimized location of light sources to cover a rectangular region2022-07-15Paper
Symbolic Regression for Approximating Graph Geodetic Number2021-12-13Paper
On new methods to construct lower bounds in simplicial branch and bound based on interval arithmetic2021-08-17Paper
The effect of attacks on the railway network of Hungary2021-08-13Paper
On derivative based bounding for simplicial branch and bound2021-07-19Paper
https://portal.mardi4nfdi.de/entity/Q46396552018-05-11Paper
Generating a smallest binary tree by proper selection of the longest edges to bisect in a unit simplex refinement2017-02-22Paper
Location equilibria for a continuous competitive facility location problem under delivered pricing2016-11-10Paper
\(p\)-facility Huff location problem on networks2016-10-07Paper
Solving a Huff-like Stackelberg location problem on networks2016-02-29Paper
On refinement of the unit simplex using regular simplices2016-02-29Paper
Verified Methods for Computing Pareto Sets: General Algorithmic Analysis2014-11-19Paper
Verified methods for computing Pareto sets: general algorithmic analysis2014-11-19Paper
On determining the cover of a simplex by spheres centered at its vertices2011-11-08Paper
Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods2011-03-24Paper
An efficient descent direction method with cutting planes2011-02-08Paper
Introduction to nonlinear and global optimization2010-01-21Paper
On the impact of spatial pattern, aggregation, and model parameters in planar Huff-type competitive location and design problems2009-06-30Paper
A practical algorithm for decomposing polygonal domains into convex polygons by diagonals2009-02-17Paper
Sequential versus simultaneous approach in the location and design of two new facilities using planar Huff-like models2008-12-17Paper
Obtaining an outer approximation of the efficient set of nonlinear biobjective problems2007-11-14Paper
Multi-dimensional pruning from the Baumann point in an interval global optimization algorithm2007-11-14Paper
The 1-center problem in the plane with independent random weights2007-10-19Paper
Planar location and design of a new facility with inner and outer competition: an interval lexicographical-like solution procedure2007-05-31Paper
Solving a huff-like competitive location and design model for profit maximization in the plane2007-02-12Paper
Empirical convergence speed of inclusion functions for facility location problems2007-02-02Paper
Reconciling franchisor and franchisee: a planar biobjective competitive location and design model2006-11-02Paper
Global optimization on Stiefel manifolds: a computational approach2006-06-12Paper
Empirical investigation of the convergence speed of inclusion functions in a global otimization context2005-11-07Paper

Research outcomes over time

This page was built for person: Boglárka G.-Tóth