Bicriteria and restricted 2-facility Weber problems
From MaRDI portal
Publication:1362675
DOI10.1007/BF01193859zbMATH Open0882.90086MaRDI QIDQ1362675FDOQ1362675
Authors: S. Nickel
Publication date: 10 March 1998
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Recommendations
Cites Work
- Solving Bicriterion Mathematical Programs
- Technical Note—Proper Efficiency and the Linear Vector Maximum Problem
- Time bounds for selection
- Multiobjective analysis of facility location decisions
- Facility Locations with the Manhattan Metric in the Presence of Barriers to Travel
- Locating Facilities on the Manhattan Metric with Arbitrarily Shaped Barriers and Convex Forbidden Regions
- Technical Note—Algorithms for Weber Facility Location in the Presence of Forbidden Regions and/or Barriers to Travel
- Title not available (Why is that?)
- Sets of efficient points in a normed space
- Finding efficient solutions for rectilinear distance location problems efficiently
- Determination of efficient points in multiple-objective location problems
- Multicriteria planar location problems
- Combinatorial algorithms for some 1-facility median problems in the plane
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (6)
This page was built for publication: Bicriteria and restricted 2-facility Weber problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1362675)