To model flexible objectives for discrete location problems, ordered median functions can be applied. These functions multiply a weight to the cost of fulfilling the demand of a customer which depends on the position of that cost relative to the costs of fulfilling the demand of the other customers. In this paper a reformulated and more compact version of a covering model for the discrete ordered median problem (DOMP) is considered. It is shown that by using this reformulation better solution times can be obtained. This is especially true for some objectives that are often employed in location theory. In addition, the covering model is extended so that ordered median functions with negative weights are feasible as well. This type of modelin...
We present two heuristic methods for solving the Discrete Ordered Median Problem (DOMP), for which n...
One of the main challenges in the area of discrete optimization is to find efficient and effective w...
In this paper we introduce flexible models for capacitated discrete location problems. We describe t...
Flexible discrete location problems are a generalization of most classical discrete locations proble...
AbstractFlexible discrete location problems are a generalization of most classical discrete location...
Flexible discrete location problems are a generalization of most classical discrete locations proble...
AbstractFlexible discrete location problems are a generalization of most classical discrete location...
This is the first book about the discrete ordered median problem (DOMP), which unifies many classica...
Ordered median functions have been developed to model flexible discrete location problems. A weight ...
In this paper we develop a network location model that combines the characteristics of ordered media...
Classical location models fix an objective function and then attempt to find optimal points to this ...
The Discrete Ordered Median Problem (DOMP) generalizes classical discrete location problems, such as...
In this paper we develop a network location model that combines the characteristics of ordered media...
We present two heuristic methods for solving the Discrete Ordered Median Problem (DOMP), for which n...
Abstract. Classical approaches to location problems are based on the minimization of the average dis...
We present two heuristic methods for solving the Discrete Ordered Median Problem (DOMP), for which n...
One of the main challenges in the area of discrete optimization is to find efficient and effective w...
In this paper we introduce flexible models for capacitated discrete location problems. We describe t...
Flexible discrete location problems are a generalization of most classical discrete locations proble...
AbstractFlexible discrete location problems are a generalization of most classical discrete location...
Flexible discrete location problems are a generalization of most classical discrete locations proble...
AbstractFlexible discrete location problems are a generalization of most classical discrete location...
This is the first book about the discrete ordered median problem (DOMP), which unifies many classica...
Ordered median functions have been developed to model flexible discrete location problems. A weight ...
In this paper we develop a network location model that combines the characteristics of ordered media...
Classical location models fix an objective function and then attempt to find optimal points to this ...
The Discrete Ordered Median Problem (DOMP) generalizes classical discrete location problems, such as...
In this paper we develop a network location model that combines the characteristics of ordered media...
We present two heuristic methods for solving the Discrete Ordered Median Problem (DOMP), for which n...
Abstract. Classical approaches to location problems are based on the minimization of the average dis...
We present two heuristic methods for solving the Discrete Ordered Median Problem (DOMP), for which n...
One of the main challenges in the area of discrete optimization is to find efficient and effective w...
In this paper we introduce flexible models for capacitated discrete location problems. We describe t...