The following pages link to Boglárka G.-Tóth (Q249512):
Displaying 39 items.
- \(p\)-facility Huff location problem on networks (Q323476) (← links)
- Location equilibria for a continuous competitive facility location problem under delivered pricing (Q336785) (← links)
- (Q511685) (redirect page) (← links)
- Generating a smallest binary tree by proper selection of the longest edges to bisect in a unit simplex refinement (Q511686) (← links)
- An efficient descent direction method with cutting planes (Q623787) (← links)
- (Q632388) (redirect page) (← links)
- Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods (Q632389) (← links)
- On determining the cover of a simplex by spheres centered at its vertices (Q645552) (← links)
- (Q861907) (redirect page) (← links)
- Empirical convergence speed of inclusion functions for facility location problems (Q861908) (← links)
- Solving a huff-like competitive location and design model for profit maximization in the plane (Q864047) (← links)
- Planar location and design of a new facility with inner and outer competition: an interval lexicographical-like solution procedure (Q883194) (← links)
- Sequential versus simultaneous approach in the location and design of two new facilities using planar Huff-like models (Q960385) (← links)
- A practical algorithm for decomposing polygonal domains into convex polygons by diagonals (Q1001364) (← links)
- On the impact of spatial pattern, aggregation, and model parameters in planar Huff-type competitive location and design problems (Q1027999) (← links)
- (Q2045621) (redirect page) (← links)
- The effect of attacks on the railway network of Hungary (Q2045622) (← links)
- On new methods to construct lower bounds in simplicial branch and bound based on interval arithmetic (Q2046307) (← links)
- Algorithmic upper bounds for graph geodetic number (Q2103929) (← links)
- On monotonicity and search strategies in face-based copositivity detection algorithms (Q2155140) (← links)
- Optimized location of light sources to cover a rectangular region (Q2155145) (← links)
- The 1-center problem in the plane with independent random weights (Q2456633) (← links)
- Multi-dimensional pruning from the Baumann point in an interval global optimization algorithm (Q2460123) (← links)
- Obtaining an outer approximation of the efficient set of nonlinear biobjective problems (Q2460136) (← links)
- Global optimization on Stiefel manifolds: a computational approach (Q2493237) (← links)
- Empirical investigation of the convergence speed of inclusion functions in a global otimization context (Q2572918) (← links)
- Introduction to nonlinear and global optimization (Q2654810) (← links)
- Verified Methods for Computing Pareto Sets: General Algorithmic Analysis (Q2930551) (← links)
- (Q4639655) (← links)
- On derivative based bounding for simplicial branch and bound (Q5001436) (← links)
- Symbolic Regression for Approximating Graph Geodetic Number (Q5016607) (← links)
- (Q5395227) (← links)
- Solving a Huff-like Stackelberg location problem on networks (Q5964240) (← links)
- On refinement of the unit simplex using regular simplices (Q5964244) (← links)
- Solving the 1-median problem on a network with continuous demand and demand surplus (Q6068730) (← links)
- The Fritz-John Condition System in Interval Branch and Bound method (Q6119572) (← links)
- A Huff-like location model with quality adjustment and/or closing of existing facilities (Q6555174) (← links)
- Exact methods for the longest induced cycle problem (Q6617731) (← links)
- On dealing with minima at the border of a simplicial feasible area in simplicial branch and bound (Q6644263) (← links)
