Planar point-objecitve location problems with nonconvex constraints: A geometrical construction
From MaRDI portal
Publication:1890946
DOI10.1007/BF01106606zbMATH Open0834.90076DBLPjournals/jgo/CarrizosaCMP95OpenAlexW1969858788WikidataQ58217370 ScholiaQ58217370MaRDI QIDQ1890946FDOQ1890946
Authors: Emilio Carrizosa, E. Conde, Justo Puerto, M. Muñoz-Márquez 
Publication date: 28 May 1995
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01106606
Recommendations
- A maxmin location problem with nonconvex feasible region
- A characterization of efficient points in constrained location problems with regional demand
- scientific article; zbMATH DE number 764411
- scientific article; zbMATH DE number 849181
- Solving nonconvex planar location problems by finite dominating sets
Cites Work
- Location Theory, Dominance, and Convexity
- Title not available (Why is that?)
- Hull properties in location problems
- Localization in single facility location
- Sets of efficient points in a normed space
- Efficiency in Euclidean constrained location problems
- Determination of efficient points in multiple-objective location problems
- An Algorithm for a Constrained Weber Problem
Cited In (15)
- An away-step Frank-Wolfe algorithm for constrained multiobjective optimization
- Quasiconvex constrained multicriteria continuous location problems: structure of nondominated solution sets
- Planar expropriation problem with non-rigid rectangular facilities
- Solving nonconvex planar location problems by finite dominating sets
- Convergence of a nonmonotone projected gradient method for nonconvex multiobjective optimization
- On \(q\)-Newton's method for unconstrained multiobjective optimization problems
- Relationships between constrained and unconstrained multi-objective optimization and application in location theory
- A steepest descent method for vector optimization
- Planar multifacility location problems with tree structure and finite dominating sets
- Strictly feasible solutions and strict complementarity in multiple objective linear optimization
- A superlinearly convergent nonmonotone quasi-Newton method for unconstrained multiobjective optimization
- Efficiency in constrained continuous location
- Spectral projected subgradient method with a 1-memory momentum term for constrained multiobjective optimization problem
- Pareto efficient solutions in multi-objective optimization involving forbidden regions
- An approach to \(\epsilon\)-duality theorems for nonconvex semi-infinite multiobjective optimization problems
This page was built for publication: Planar point-objecitve location problems with nonconvex constraints: A geometrical construction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1890946)
