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 |
|
Symbolic Regression for Approximating Graph Geodetic Number |
|
On new methods to construct lower bounds in simplicial branch and bound based on interval arithmetic |
|
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 |
|
On refinement of the unit simplex using regular simplices |
|
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 |
|
Location equilibria for a continuous competitive facility location problem under delivered pricing |
|
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 |
|
Egy hatékony számítógépes eszköz matematikai problémák megoldására |
|