scientific article; zbMATH DE number 1076395

MaRDI QIDQ4359752zbMATH OpenFDO

Authors S. S. Ravi, Sven O. Krumke, Hartmut Noltemeier, Madhav V. Marathe

Publication date 12 October 1998

zbMATH Keywords

complexityapproximabilitybicriteria compact location problemsdiameter constrained minimum diameter problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Discrete location and assignment (90B80)

Recommendations

• Compact location problems
• An Analysis of Network Location Problems with Distance Constraints
• scientific article; zbMATH DE number 1163715

Cited in

(6)

• Bicriteria network location (BNL) problems with criteria dependent lengths and minisum objectives
• Compact location problems with budget and communication constraints
• A geometrical solution for quadratic bicriteria location models
• Compact location problems
• The bicriterion semi-obnoxious location (BSL) problem solved by an -approximation
• Complexity and approximability of certain bicriteria location problems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4359752)