scientific article; zbMATH DE number 4199954

zbMATH Open0726.90045MaRDI QIDQ3348693FDOQ3348693

Authors:

Publication date: 1990

Title of this publication is not available (Why is that?)

Recommendations

• scientific article
• scientific article; zbMATH DE number 232388
• An O\((n \log{}n)\) algorithm for a maxmin location problem
• scientific article; zbMATH DE number 4181131
• An Efficient Computational Procedure for the Rectilinear MAXIMIN Location Problem

zbMATH Keywords

polynomial time complexityrectilinear metrictwo-dimensional constrained minimax location

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Abstract computational complexity for mathematical programming problems (90C60) Continuous location (90B85)

Cited In (10)

• Title not available (Why is that?)
• Quality locations for the constrained minimax location model
• Title not available (Why is that?)
• Algebraic solution of minimax single-facility constrained location problems with Chebyshev and rectilinear distances
• On minimizing distance by the road less traveled
• A geometrical solution for quadratic bicriteria location models
• An Efficient Computational Procedure for the Rectilinear MAXIMIN Location Problem
• Note on a Rectilinear Distance Round-Trip Location Problem
• A fast algorithm for the rectilinear distance location problem
• A SHORTEST PATH APPROACH TO A MULTIFACILITY MINIMAX LOCATION PROBLEM WITH RECTILINEAR DISTANCES

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 Q3348693)