Add to ORKGRecently Beltran-Royo et.al presented a Semi-Lagrangean relaxation for the classical p-median location problem. The results obtained using the Semi-Lagrangean relaxation approach were quite impressive. In this paper we use a reformulation of the p-median problem in order to start from a formulation more suitable for Semi-Lagrangean relaxation and analyse the new approach on examples from the OR library
Given a directed graph G(V,A), the p-Median problem consists of determining p nodes (the median node...
The P-median problem is a classical location model “par excellence”. In this paper we, first examine...
1986-09The k-median problem has been widely studied both from the theoretical point of view and for...
Recently Beltran-Royo et.al presented a Semi-Lagrangean relaxation for the classical p-median locati...
Lagrangian relaxation is commonly used in combinatorial optimization to generate lower bounds for a ...
Lagrangian relaxation is commonly used in combinatorial optimization to generate lower bounds for a ...
Recently Beltrán-Royo, Vial & Alonso-Ayuso (2012) presented a semi-Lagrangean relaxation for the cl...
This paper describes a branch-and-price algorithm for the p-median location problem. The objective i...
The lagrangean/surrogate relaxation has been explored as a faster computational alternative to tradi...
AbstractWe study a well-known linear programming relaxation of the p-median problem. We give a chara...
The p-median problem is a classic discrete location problem with several applications. It aims to op...
The Capacitated p-median Problem (CPMP) is a facility location problem and as such, it can be used f...
The p-median problem has been widely studied in combinatorial optimisation, but its generalisation ...
This chapter reviews the p-median problem in continuous space with an emphasis on some recent heuris...
In this paper we present approximation algorithms for median problems in metric spaces and fixed-dim...
Given a directed graph G(V,A), the p-Median problem consists of determining p nodes (the median node...
The P-median problem is a classical location model “par excellence”. In this paper we, first examine...
1986-09The k-median problem has been widely studied both from the theoretical point of view and for...
Recently Beltran-Royo et.al presented a Semi-Lagrangean relaxation for the classical p-median locati...
Lagrangian relaxation is commonly used in combinatorial optimization to generate lower bounds for a ...
Lagrangian relaxation is commonly used in combinatorial optimization to generate lower bounds for a ...
Recently Beltrán-Royo, Vial & Alonso-Ayuso (2012) presented a semi-Lagrangean relaxation for the cl...
This paper describes a branch-and-price algorithm for the p-median location problem. The objective i...
The lagrangean/surrogate relaxation has been explored as a faster computational alternative to tradi...
AbstractWe study a well-known linear programming relaxation of the p-median problem. We give a chara...
The p-median problem is a classic discrete location problem with several applications. It aims to op...
The Capacitated p-median Problem (CPMP) is a facility location problem and as such, it can be used f...
The p-median problem has been widely studied in combinatorial optimisation, but its generalisation ...
This chapter reviews the p-median problem in continuous space with an emphasis on some recent heuris...
In this paper we present approximation algorithms for median problems in metric spaces and fixed-dim...
Given a directed graph G(V,A), the p-Median problem consists of determining p nodes (the median node...
The P-median problem is a classical location model “par excellence”. In this paper we, first examine...
1986-09The k-median problem has been widely studied both from the theoretical point of view and for...