Elegir campos a generar del autor Boglarka

Datos personales Todos / Ninguno
Correo Electrónico
Artículos Todos / Ninguno
A Huff-like location model with quality adjustment and/or closing of existing facilities
Solving the 1-median problem on a network with continuous demand and demand surplus
Local search versus linear programming to detect monotonicity in simplicial branch and bound
Algorithmic upper bounds for graph geodetic number
On monotonicity and search strategies in face-based copositivity detection algorithms
On new methods to construct lower bounds in simplicial branch and bound based on interval arithmetic
Symbolic Regression for Approximating Graph Geodetic Number
Optimized location of light sources to cover a rectangular region
On derivative based bounding for simplicial branch and bound
The probabilistic customer's choice rule with a threshold attraction value: Effect on the location of competitive facilities in the plane
Generating a smallest binary tree by proper selection of the longest edges to bisect in a unit simplex refinement
A planar single-facility competitive location and design problem under the multi-deterministic choice rule
Solving a Huff-like Stackelberg location problem on networks
P-facility Huff location problem on networks
Maximal Covering Location Problems on networks with regional demand
On the Minimum Number of Simplex Shapes in Longest Edge Bisection Refinement of a Regular n-Simplex
On refinement of the unit simplex using regular simplices
Location equilibria for a continuous competitive facility location problem under delivered pricing
Heuristics to Reduce the Number of Simplices in Longest Edge Bisection Refinement of a Regular n-Simplex
On Computational Aspects of a Regular n-Simplex Bisection
On determining the cover of a simplex by spheres centered at its vertices
An efficient descent direction method with cutting planes
Verified methods for computing pareto sets: General algorithmic analysis
On the impact of spatial pattern, aggregation, and model parameters in planar Huff-type competitive location and design problems
Sequential versus simultaneous approach in the location and design of two new facilities using planar Huff-like models
Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods
The 1-center problem in the plane with independent random weights
New trends in locational analysis
A practical algorithm for decomposing polygonal domains into convex polygons by diagonals
Solving a Huff-like competitive location and design model for profit maximization in the plane
Multi-dimensional pruning from the Baumann point in an Interval Global Optimization Algorithm
Obtaining an outer approximation of the efficient set of nonlinear biobjective problems
Planar location and design of a new facility with inner and outer competition: An interval lexicographical-like solution procedure
Empirical convergence speed of inclusion functions for facility location problems
Global optimization on Stiefel manifolds: a computational approach
Empirical investigation of the convergence speed of inclusion functions in a global optimization context
On an efficient use of gradient information for accelerating interval global optimization algorithms
Egy hatékony számítógépes eszköz matematikai problémák megoldására
Libros, capítulos, tesis Todos / Ninguno
Interval Tools in Branch-and-Bound Methods for Global Optimization
On Monotonicity Detection in Simplicial Branch and Bound over a Simplex
A Continuous Competitive Facility Location and Design Problem for Firm Expansion
Huff-like stackelberg location problems on the plane
On grid aware refinement of the unit hypercube and simplex: Focus on the complete tree size
Interval Methods for Single and Bi-objective Optimization Problems: applied to Competitive Facility Location Models
Introduction to Nonlinear and Global Optimization
NLP optimality conditions
Deterministic GO algorithms
Goodness of optimization algorithms
Mathematical modeling, cases
Introduction
Nonlinear programming algorithms
Stochastic GO algorithms
Preface
Reconciling franchisor and franchisee: A planar biobjective competitive location and design model
Localización competitiva en el plano con decisiones en diseño
AMIGO: Advanced Multidimensional Interval Analysis Global Optimization algorithm
Conferencias Todos / Ninguno
Rectangle covering
Sensitivity analysis of the optimal solutions to Huff-type competitive location and design problems
Pruning a box from Baumann point in an Interval Global Optimization Algorithm
Constraint-like methods for obtaining an outer approximation of the efficient set of nonlinear biobjective problems
A comprehensive study on the convergence speed and efficiency of inclusion functions for facility location problems
Characterizations of trajectory structure of fitness landscapes based on pairwise transition probabilities of solutions
Métricas del autor Todos / Ninguno
Indice H