Mathematical Methods of Operations Research, ISSN 1432-2994, 10/2019, Volume 90, Issue 2, pp. 255 - 270

The aim of this work is to locate a semi-obnoxious facility, i.e. to minimize the distances to a given set of customers in order to save transportation costs...

Obnoxious facility location | Global optimization | 90B85 | 90C46 | Calculus of Variations and Optimal Control; Optimization | Operations Research/Decision Theory | Primal and dual algorithms | Mathematics | Dc problems | 90C26 | Business and Management, general | Algorithms

Obnoxious facility location | Global optimization | 90B85 | 90C46 | Calculus of Variations and Optimal Control; Optimization | Operations Research/Decision Theory | Primal and dual algorithms | Mathematics | Dc problems | 90C26 | Business and Management, general | Algorithms

Journal Article

Computational Management Science, ISSN 1619-697X, 10/2017, Volume 14, Issue 4, pp. 493 - 518

The aim of this paper is twofold: first, to extend the area of applications of tropical optimization by solving new constrained location problems, and second,...

65K05 | Rectilinear distance | Minimax location problem | 90C48 | Optimization | Constrained optimization | 90B85 | Business and Management | Idempotent semifield | Operations Research/Decision Theory | Explicit solution | Tropical optimization | 15A80 | Problems | Operations research | Minimax technique | Transformations (mathematics) | Site selection | Indoor environments | Exact solutions | Environmental monitoring

65K05 | Rectilinear distance | Minimax location problem | 90C48 | Optimization | Constrained optimization | 90B85 | Business and Management | Idempotent semifield | Operations Research/Decision Theory | Explicit solution | Tropical optimization | 15A80 | Problems | Operations research | Minimax technique | Transformations (mathematics) | Site selection | Indoor environments | Exact solutions | Environmental monitoring

Journal Article

Annals of Operations Research, ISSN 0254-5330, 8/2019, Volume 279, Issue 1, pp. 1 - 42

The Multi-commodity Capacitated Multi-facility Weber Problem is concerned with locating I capacitated facilities in the plane in order to satisfy the demands...

90B85 | Business and Management | Multi-commodity transportation | Operations Research/Decision Theory | Theory of Computation | 90C26 | 90B06 | Combinatorics | Branch-and-bound algorithm | Facility location–allocation | SINGLE | TRANSPORTATION | BLOCK | Facility location-allocation | MINISUM | LOCATION-PROBLEMS | HEURISTICS | APPROXIMATE SOLUTION METHODS | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | DOMINANCE | CONVERGENCE | Usage | Models | Mathematical models | Algorithms | Facility management | Facility management systems | Studies | Operations research | Partitioning | Location analysis | Commodities | Cost control | Branch & bound algorithms

90B85 | Business and Management | Multi-commodity transportation | Operations Research/Decision Theory | Theory of Computation | 90C26 | 90B06 | Combinatorics | Branch-and-bound algorithm | Facility location–allocation | SINGLE | TRANSPORTATION | BLOCK | Facility location-allocation | MINISUM | LOCATION-PROBLEMS | HEURISTICS | APPROXIMATE SOLUTION METHODS | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | DOMINANCE | CONVERGENCE | Usage | Models | Mathematical models | Algorithms | Facility management | Facility management systems | Studies | Operations research | Partitioning | Location analysis | Commodities | Cost control | Branch & bound algorithms

Journal Article

Mathematical Programming, ISSN 0025-5610, 6/2011, Volume 128, Issue 1, pp. 373 - 401

This paper analyzes continuous single facility location problems where the demand is randomly defined by a given probability distribution. For these types of...

Mathematical Methods in Physics | 90B85 | 90C46 | Mathematics of Computing | Calculus of Variations and Optimal Control; Optimization | Numerical Analysis | Theoretical, Mathematical and Computational Physics | 90C90 | Mathematics | Combinatorics | Mathematics Subject Classification : 90B85 | COMPUTER SCIENCE, SOFTWARE ENGINEERING | MATHEMATICS, APPLIED | DEMAND | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | WEBER PROBLEM | SERVICE UNITS | CONVEXITY | Algorithms | Industrial locations | Computer science | Studies | Polynomials | Polyhedra | Location analysis | Mathematical analysis | Discretization | Planes | Minimization | Position (location) | Optimization | Marketing

Mathematical Methods in Physics | 90B85 | 90C46 | Mathematics of Computing | Calculus of Variations and Optimal Control; Optimization | Numerical Analysis | Theoretical, Mathematical and Computational Physics | 90C90 | Mathematics | Combinatorics | Mathematics Subject Classification : 90B85 | COMPUTER SCIENCE, SOFTWARE ENGINEERING | MATHEMATICS, APPLIED | DEMAND | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | WEBER PROBLEM | SERVICE UNITS | CONVEXITY | Algorithms | Industrial locations | Computer science | Studies | Polynomials | Polyhedra | Location analysis | Mathematical analysis | Discretization | Planes | Minimization | Position (location) | Optimization | Marketing

Journal Article

Mathematical Programming, ISSN 0025-5610, 10/2017, Volume 165, Issue 2, pp. 579 - 604

In this paper, we address continuous, integer and combinatorial k-sum optimization problems. We analyze different formulations of this problem that allow to...

90C10 | Mathematical Methods in Physics | 90B85 | 90C35 | Calculus of Variations and Optimal Control; Optimization | Mathematics of Computing | Numerical Analysis | Theoretical, Mathematical and Computational Physics | 90B80 | Mathematics | 90C27 | Combinatorics | GRAPH | MATHEMATICS, APPLIED | TREE-SHAPED FACILITIES | ORDERED MEDIAN PROBLEMS | NETWORKS | ALGORITHMS | CENTERS | LEXICOGRAPHIC BOTTLENECK PROBLEMS | LOCATION-PROBLEMS | KNAPSACK-PROBLEM | COMPUTER SCIENCE, SOFTWARE ENGINEERING | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | DISCRETE OPTIMIZATION | Analysis | Algorithms | Formulations | Problems | Combinatorial analysis | Optimization

90C10 | Mathematical Methods in Physics | 90B85 | 90C35 | Calculus of Variations and Optimal Control; Optimization | Mathematics of Computing | Numerical Analysis | Theoretical, Mathematical and Computational Physics | 90B80 | Mathematics | 90C27 | Combinatorics | GRAPH | MATHEMATICS, APPLIED | TREE-SHAPED FACILITIES | ORDERED MEDIAN PROBLEMS | NETWORKS | ALGORITHMS | CENTERS | LEXICOGRAPHIC BOTTLENECK PROBLEMS | LOCATION-PROBLEMS | KNAPSACK-PROBLEM | COMPUTER SCIENCE, SOFTWARE ENGINEERING | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | DISCRETE OPTIMIZATION | Analysis | Algorithms | Formulations | Problems | Combinatorial analysis | Optimization

Journal Article

Journal of Optimization Theory and Applications, ISSN 0022-3239, 8/2019, Volume 182, Issue 2, pp. 730 - 767

This paper deals with a bilevel approach of the location-allocation problem with dimensional facilities. We present a general model that allows us to consider...

Heuristics | Mathematics | Theory of Computation | Optimal transport mass | Optimization | Bilevel optimization | 90B85 | 90C30 | Calculus of Variations and Optimal Control; Optimization | Operations Research/Decision Theory | Mixed-integer programming | 90B80 | Applications of Mathematics | Engineering, general | 49M25 | Dimensional facilities | MATHEMATICS, APPLIED | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | ALGORITHM | POWER | OPTIMAL TRANSPORT | Domains | Allocations | Approximations

Heuristics | Mathematics | Theory of Computation | Optimal transport mass | Optimization | Bilevel optimization | 90B85 | 90C30 | Calculus of Variations and Optimal Control; Optimization | Operations Research/Decision Theory | Mixed-integer programming | 90B80 | Applications of Mathematics | Engineering, general | 49M25 | Dimensional facilities | MATHEMATICS, APPLIED | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | ALGORITHM | POWER | OPTIMAL TRANSPORT | Domains | Allocations | Approximations

Journal Article

Journal of Optimization Theory and Applications, ISSN 0022-3239, 9/2018, Volume 178, Issue 3, pp. 914 - 934

This paper concerns with some variants of the inverse obnoxious median location problem on tree networks, where the aim is either to augment or to reduce the...

Inverse optimization | Mathematics | Theory of Computation | 90C27 | Combinatorial optimization | Optimization | Obnoxious median location | 90B85 | Calculus of Variations and Optimal Control; Optimization | Operations Research/Decision Theory | 90B80 | Applications of Mathematics | Engineering, general | Time complexity | MATHEMATICS, APPLIED | 1-MEDIAN PROBLEM | DISTANCE | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | VARIABLE VERTEX WEIGHTS | GRAPHS | Analysis | Algorithms | Set theory | Site selection | Combinatorial analysis

Inverse optimization | Mathematics | Theory of Computation | 90C27 | Combinatorial optimization | Optimization | Obnoxious median location | 90B85 | Calculus of Variations and Optimal Control; Optimization | Operations Research/Decision Theory | 90B80 | Applications of Mathematics | Engineering, general | Time complexity | MATHEMATICS, APPLIED | 1-MEDIAN PROBLEM | DISTANCE | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | VARIABLE VERTEX WEIGHTS | GRAPHS | Analysis | Algorithms | Set theory | Site selection | Combinatorial analysis

Journal Article

Computing, ISSN 0010-485X, 3/2019, Volume 101, Issue 3, pp. 237 - 261

Facility location allocation is key to success of urban design, mainly in designing transport systems, finding locations for warehouse, fire stations and so...

Information Systems Applications (incl.Internet) | Crowdsourcing | Artificial Intelligence | Location allocation | Computer Appl. in Administrative Data Processing | p -median | Gamification | SolveIt | 90B85 | Software Engineering | Computer Science | Planar | 90B80 | Computer Science, general | Computer Communication Networks | p-median | ALGORITHMIC APPROACH | NETWORK | SYSTEMS | COMPUTER SCIENCE, THEORY & METHODS | Algorithms | Industrial locations | Analysis | Warehouses | Fire stations | Urban planning | Transportation planning | Genetic algorithms

Information Systems Applications (incl.Internet) | Crowdsourcing | Artificial Intelligence | Location allocation | Computer Appl. in Administrative Data Processing | p -median | Gamification | SolveIt | 90B85 | Software Engineering | Computer Science | Planar | 90B80 | Computer Science, general | Computer Communication Networks | p-median | ALGORITHMIC APPROACH | NETWORK | SYSTEMS | COMPUTER SCIENCE, THEORY & METHODS | Algorithms | Industrial locations | Analysis | Warehouses | Fire stations | Urban planning | Transportation planning | Genetic algorithms

Journal Article

9.
Full Text
A minisum location problem with regional demand considering farthest Euclidean distances

Optimization Methods and Software, ISSN 1055-6788, 05/2016, Volume 31, Issue 3, pp. 446 - 470

We consider a continuous multi-facility location-allocation problem that aims to minimize the sum of weighted farthest Euclidean distances between (closed...

second-order cone programming | 90B85 | minisum problem | 90C25 | 90C11 | demand region | facility location problem | Satellites | Algorithms | Demand | Mixed integer | Circularity | Programming | Mathematical models | Optimization | Computer programs

second-order cone programming | 90B85 | minisum problem | 90C25 | 90C11 | demand region | facility location problem | Satellites | Algorithms | Demand | Mixed integer | Circularity | Programming | Mathematical models | Optimization | Computer programs

Journal Article

Mathematical Methods of Operations Research, ISSN 1432-2994, 6/2018, Volume 87, Issue 3, pp. 431 - 450

In this paper, we investigate a variant of the reverse obnoxious center location problem on a tree graph $$T=(V,E)$$ T=(V,E) in which a selective subset of the...

Obnoxious center location | 90B85 | 90C35 | Calculus of Variations and Optimal Control; Optimization | Operations Research/Decision Theory | 90B80 | Mathematics | Reverse optimization | 90C27 | Combinatorial optimization | Business and Management, general | Time complexity | MATHEMATICS, APPLIED | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | NETWORKS | Algorithms | Industrial locations | Site selection | Combinatorial analysis

Obnoxious center location | 90B85 | 90C35 | Calculus of Variations and Optimal Control; Optimization | Operations Research/Decision Theory | 90B80 | Mathematics | Reverse optimization | 90C27 | Combinatorial optimization | Business and Management, general | Time complexity | MATHEMATICS, APPLIED | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | NETWORKS | Algorithms | Industrial locations | Site selection | Combinatorial analysis

Journal Article

11.
Full Text
Linear time optimal approaches for reverse obnoxious center location problems on networks

Optimization, ISSN 0233-1934, 11/2016, Volume 65, Issue 11, pp. 2025 - 2036

This paper is concerned with a reverse obnoxious (undesirable) center location problem on networks in which the aim is to modify the edge lengths within an...

combinatorial optimization | Obnoxious center location | 90B85 | 90C35 | reverse optimization | time complexity | 90B80 | 90C27 | MATHEMATICS, APPLIED | ALGORITHM | INVERSE 1-MEDIAN PROBLEM | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | TREES | Mathematical programming | Integers | Networks | Algorithms | Site selection | Norms | Budgeting | Combinatorial analysis | Optimization

combinatorial optimization | Obnoxious center location | 90B85 | 90C35 | reverse optimization | time complexity | 90B80 | 90C27 | MATHEMATICS, APPLIED | ALGORITHM | INVERSE 1-MEDIAN PROBLEM | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | TREES | Mathematical programming | Integers | Networks | Algorithms | Site selection | Norms | Budgeting | Combinatorial analysis | Optimization

Journal Article

Mathematical Programming, ISSN 0025-5610, 1/2017, Volume 161, Issue 1, pp. 33 - 72

In this paper we address the problem of locating a new facility on a d-dimensional space when the distance measure ( $$\ell _p$$ ℓ p - or polyhedral-norms) is...

Continuous location | Theoretical, Mathematical and Computational Physics | Refraction | Norms | Mathematics | 47A30 | Mathematical Methods in Physics | 90B85 | 90C30 | Calculus of Variations and Optimal Control; Optimization | Mathematics of Computing | Numerical Analysis | 90C22 | Combinatorics | Second order cone programming | COMPUTER SCIENCE, SOFTWARE ENGINEERING | MATHEMATICS, APPLIED | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | REGIONS | ALGORITHM | CONVERGENCE | SINGLE FACILITY | Local transit | Analysis | Studies | Semidefinite programming | Urban areas | Mathematical analysis | Hyperplanes | Programming | Texts | Mathematical models | Mathematical programming

Continuous location | Theoretical, Mathematical and Computational Physics | Refraction | Norms | Mathematics | 47A30 | Mathematical Methods in Physics | 90B85 | 90C30 | Calculus of Variations and Optimal Control; Optimization | Mathematics of Computing | Numerical Analysis | 90C22 | Combinatorics | Second order cone programming | COMPUTER SCIENCE, SOFTWARE ENGINEERING | MATHEMATICS, APPLIED | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | REGIONS | ALGORITHM | CONVERGENCE | SINGLE FACILITY | Local transit | Analysis | Studies | Semidefinite programming | Urban areas | Mathematical analysis | Hyperplanes | Programming | Texts | Mathematical models | Mathematical programming

Journal Article

Journal of the Operations Research Society of China, ISSN 2194-668X, 9/2017, Volume 5, Issue 3, pp. 347 - 361

This paper deals with a general variant of the reverse undesirable (obnoxious) center location problem on cycle graphs. Given a ‘selective’ subset of the...

90B85 | 90C35 | 90B80 | Mathematics | Operations Research, Management Science | Reverse optimization | 90C27 | Undesirable center location | Combinatorial optimization | Time complexity

90B85 | 90C35 | 90B80 | Mathematics | Operations Research, Management Science | Reverse optimization | 90C27 | Undesirable center location | Combinatorial optimization | Time complexity

Journal Article

Journal of Global Optimization, ISSN 0925-5001, 9/2011, Volume 51, Issue 1, pp. 115 - 132

In our paper we approximate a set of given points by a general circle. More precisely, given two norms k 1 and k 2 and a set of points in the plane, we...

62J02 | Circle location | 90C26 | Optimization | Polyhedral norms | Economics / Management Science | 90B85 | Operations Research/Decision Theory | 65D10 | 97N50 | Minisum | Dimensional facility | Computer Science, general | Real Functions | MATHEMATICS, APPLIED | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | DISTANCES | NORM | FACILITY LOCATION | HYPERPLANES | Studies

62J02 | Circle location | 90C26 | Optimization | Polyhedral norms | Economics / Management Science | 90B85 | Operations Research/Decision Theory | 65D10 | 97N50 | Minisum | Dimensional facility | Computer Science, general | Real Functions | MATHEMATICS, APPLIED | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | DISTANCES | NORM | FACILITY LOCATION | HYPERPLANES | Studies

Journal Article

4OR, ISSN 1619-4500, 12/2018, Volume 16, Issue 4, pp. 343 - 377

In this paper, we consider a multi-source Weber problem of m new facilities with respect to n demand regions in order to minimize the sum of the transportation...

Global convergence | Secondary 90B06 | Heuristic algorithm | Industrial and Production Engineering | Distance function | 90C26 | Optimization | Primary 90B85 | Location-allocation | Business and Management | 49J52 | Operations Research/Decision Theory | 90C90 | Location | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | FACILITY LOCATION | POINT | Problem solving | Analysis | Algorithms | Demand | Substations | Iterative methods

Global convergence | Secondary 90B06 | Heuristic algorithm | Industrial and Production Engineering | Distance function | 90C26 | Optimization | Primary 90B85 | Location-allocation | Business and Management | 49J52 | Operations Research/Decision Theory | 90C90 | Location | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | FACILITY LOCATION | POINT | Problem solving | Analysis | Algorithms | Demand | Substations | Iterative methods

Journal Article

Journal of Optimization Theory and Applications, ISSN 0022-3239, 9/2015, Volume 166, Issue 3, pp. 711 - 746

One of the oldest and richest problems from continuous location science is the famous Fermat–Torricelli problem, asking for the unique point in Euclidean space...

52A20 | 52A21 | Fermat-Torricelli problem | Hahn-Banach Theorem | 52A41 | Minkowski space | 46B20 | Generalized $$d$$ d -segments | 46A22 | Mathematics | Theory of Computation | Duality | Optimization | 49K10 | 90B85 | 90C46 | Calculus of Variations and Optimal Control; Optimization | 90C25 | Operations Research/Decision Theory | Polarity | 49N15 | Applications of Mathematics | Engineering, general | Generalized d-segments | NORMED LINEAR-SPACES | MATHEMATICS, APPLIED | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | SYLVESTER | WEBER | GENERALIZED HERON PROBLEM | Studies | Set theory | Euclidean space | Banach spaces | Convex analysis | Origins | Euclidean geometry | Theorems | Norms | Collection | Texts | Convexity

52A20 | 52A21 | Fermat-Torricelli problem | Hahn-Banach Theorem | 52A41 | Minkowski space | 46B20 | Generalized $$d$$ d -segments | 46A22 | Mathematics | Theory of Computation | Duality | Optimization | 49K10 | 90B85 | 90C46 | Calculus of Variations and Optimal Control; Optimization | 90C25 | Operations Research/Decision Theory | Polarity | 49N15 | Applications of Mathematics | Engineering, general | Generalized d-segments | NORMED LINEAR-SPACES | MATHEMATICS, APPLIED | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | SYLVESTER | WEBER | GENERALIZED HERON PROBLEM | Studies | Set theory | Euclidean space | Banach spaces | Convex analysis | Origins | Euclidean geometry | Theorems | Norms | Collection | Texts | Convexity

Journal Article

TOP, ISSN 1134-5764, 4/2019, Volume 27, Issue 1, pp. 70 - 93

The objective of classic cover location models is for facilities to cover demand within a given distance. Locating a given number of facilities to cover as...

Statistics for Business, Management, Economics, Finance, Insurance | 90B85 | Business and Management | Operations Research/Decision Theory | Industrial and Production Engineering | Economic Theory/Quantitative Economics/Mathematical Methods | 90B80 | 90C27 | Optimization | Cover location models | Partial cover | Gradual cover | LOCATION PROBLEM | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | MODELS | SEARCH | FACILITY LOCATION

Statistics for Business, Management, Economics, Finance, Insurance | 90B85 | Business and Management | Operations Research/Decision Theory | Industrial and Production Engineering | Economic Theory/Quantitative Economics/Mathematical Methods | 90B80 | 90C27 | Optimization | Cover location models | Partial cover | Gradual cover | LOCATION PROBLEM | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | MODELS | SEARCH | FACILITY LOCATION

Journal Article

Mathematical Programming, ISSN 0025-5610, 2/2013, Volume 137, Issue 1, pp. 477 - 502

This paper presents a procedure to solve the classical location median problem where the distances are measured with ℓ p -norms with p > 2. In order to do that...

Mathematical Methods in Physics | Global convergence | 90B85 | Calculus of Variations and Optimal Control; Optimization | Mathematics of Computing | Numerical Analysis | Theoretical, Mathematical and Computational Physics | Weiszfeld algorithm | ℓ p -norm | Mathematics | Combinatorics | Location problem | norm

Mathematical Methods in Physics | Global convergence | 90B85 | Calculus of Variations and Optimal Control; Optimization | Mathematics of Computing | Numerical Analysis | Theoretical, Mathematical and Computational Physics | Weiszfeld algorithm | ℓ p -norm | Mathematics | Combinatorics | Location problem | norm

Journal Article