Back to search

Clemson University

A Dual Algorithm for the Weighted Euclidean Distance Min-Max Location Problem in R^2 and R^3

Abstract

dc:description.abstract

A dual approach algorithm is given for the solution of the weighted min-max location problem with Euclidean distance in R^2 and R^3. Each subproblem is solved using a directional search procedure and by taking advantage of its geometric structure. An algebraic replacement rule is employed to update the subproblem.

Degree

thesis:*
Name thesis:degree_name
Master of Science (MS)
Level thesis:degree_level
Thesis
Discipline thesis:degree_discipline
Mathematical Science

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Smith, Andrea
Contributors dc:contributor
  • Dearing, Perino M
  • Shier , Douglas R
  • Cawood , Mark E

Subjects

dc:subject × 5

Identifiers

dc:identifier.*
Repository record dc:identifier
https://open.clemson.edu/all_theses/544

Chain of custody

source
Harvested from
Clemson University
Base URL
open.clemson.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Smith, Andrea. A Dual Algorithm for the Weighted Euclidean Distance Min-Max Location Problem in R^2 and R^3. Thesis thesis, https://open.clemson.edu/all_theses/544