Results 141 to 150 of about 2,210,593 (198)
Some of the next articles are maybe not open access.
Analysis of aggregation errors for the p-median problem
Computers & Operations Research, 1999zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Erhan Erkut, Burçin Bozkaya
openaire +2 more sources
The connected p-median problem on block graphs
Optimization Letters, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shun-Chieh Chang +3 more
openaire +4 more sources
2019
One of the basic problems in the field of discrete location is the p-median problem. In this chapter we present and analyze several versions of the problem, but we can roughly define it as the choice of p facilities, among a set of n candidates, that minimize the cost of supplying a finite set of users.
Alfredo Marín, Mercedes Pelegrín
openaire +1 more source
One of the basic problems in the field of discrete location is the p-median problem. In this chapter we present and analyze several versions of the problem, but we can roughly define it as the choice of p facilities, among a set of n candidates, that minimize the cost of supplying a finite set of users.
Alfredo Marín, Mercedes Pelegrín
openaire +1 more source
A tighter formulation of the p-median problem
Journal of Combinatorial Optimization, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
A Lagrangian search method for the P-median problem
Journal of Global Optimization, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Joshua Q. Hale, Enlu Zhou, Jiming Peng
openaire +1 more source
2013
This chapter focuses on the p-median problem (PMP) and its properties. We consider a pseudo-Boolean formulation of the PMP, demonstrate its advantages and derive the most compact MILP formulation for the PMP within the class of mixed-Boolean linear programming formulations.
Boris Goldengorin +2 more
openaire +1 more source
This chapter focuses on the p-median problem (PMP) and its properties. We consider a pseudo-Boolean formulation of the PMP, demonstrate its advantages and derive the most compact MILP formulation for the PMP within the class of mixed-Boolean linear programming formulations.
Boris Goldengorin +2 more
openaire +1 more source
The Hamiltonian \(p\)-median problem
Electron. J. Comb., 2000Summary: We deal, from a theoretical point of view, with the asymmetric Hamiltonian \(p\)-median problem. This problem, which has many applications, can be viewed as a mixed routing location problem. An ILP-formulation based on a new class of inequalities (subtour number constraints) is presented.
Holger Glaab, Alexander Pott
openaire +2 more sources
An effective VNS for the capacitated p-median problem
European Journal of Operational Research, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Krzysztof Fleszar 0002, Khalil S. Hindi
openaire +2 more sources
Marginal analysis for the fuzzy p-median problem
European Journal of Operational Research, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
María José Canós +2 more
openaire +1 more source