scientific article; zbMATH DE number 1559403

DOI<581::AID-NAV3>3.0.CO;2-R 10.1002/1520-6750(200010)47:7<581::AID-NAV3>3.0.CO;2-RzbMath0991.90082MaRDI QIDQ4526867

Yoshiaki Ohsawa

Publication date: 31 January 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

polynomial-time algorithmminimax criteriabicriteria location model

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Multi-objective and goal programming (90C29) Discrete location and assignment (90B80) Complexity and performance of numerical algorithms (65Y20)

Related Items (10)

The multicriteria big cube small cube method ⋮ Locating a semi-obnoxious covering facility with repelling polygonal regions ⋮ Dispersion with connectivity in wireless mesh networks ⋮ Fuzzy facility location problem with preference of candidate sites ⋮ An interactive solution approach for a bi-objective semi-desirable location problem ⋮ Location of a semi-obnoxious facility with elliptic maximin and network minisum objectives ⋮ Planar expropriation problem with non-rigid rectangular facilities ⋮ Euclidean push--pull partial covering problems ⋮ Low complexity algorithms for optimal consumer push-pull partial covering in the plane ⋮ Efficiency for continuous facility location problems with attraction and repulsion

Cites Work

• Analytical models for locating undesirable facilities
• Multicriteria planar location problems
• Locational optimization problems solved through Voronoi diagrams
• A geometrical solution for quadratic bicriteria location models
• Proper efficiency and the theory of vector maximization
• Multiobjective analysis of facility location decisions
• Finding Minimal Center-Median Convex Combination (Cent-Dian) of a Graph
• Degree of locational freedom in a single facility euclidean minimax location model
• Multicriteria network location problems with sum objectives

This page was built for publication: