Affordable Access

Publisher Website

A note on Galvão's “A graph theoretical bound for thep-median problem”

Authors
Journal
European Journal of Operational Research
0377-2217
Publisher
Elsevier
Publication Date
Volume
12
Issue
4
Identifiers
DOI: 10.1016/0377-2217(83)90162-5
Disciplines
  • Computer Science

Abstract

Abstract Galvão (1981) proposed an algorithm for calculating a strong lower bound for the p-median problem on vertex-unweighted networks. It is shown that there is a mistake in the algorithm. An improved version of the algorithm is given.

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments

More articles like this

Rejoinder to “A note on Galvão's a graph theoretic...

on European Journal of Operationa... Jan 01, 1984

A graph theoretical bound for thep-median problem

on European Journal of Operationa... Jan 01, 1981

An O(pn2) algorithm for thep-median and related pr...

on Operations Research Letters Jan 01, 1996

A neural model for thep-median problem

on Computers & Operations Researc... Jan 01, 2008
More articles like this..