LARGE-SCALE SINGLE FACILITY CONTINUOUS LOCATION BY D.C. OPTIMIZATION
From MaRDI portal
Publication:4548044
DOI10.1080/02331930290019422zbMATH Open1030.90049OpenAlexW2090879885MaRDI QIDQ4548044FDOQ4548044
Hoang Tuy, Fangjun Zhou, Faiz Al-Khayyal
Publication date: 4 November 2002
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331930290019422
Recommendations
- A d.c. optimization method for single facility location problems
- Solving a continuous multifacility location problem by DC algorithms
- Near-optimal solutions to large-scale facility location problems
- Facility location via continuous optimization with discontinuous objective functions
- scientific article; zbMATH DE number 1560330
- An approximation algorithm for a large-scale facility location problem
- Decomposition strategies for large-scale continuous location–allocation problems
- Approximate solutions to large scale capacitated facility location problems
- Efficient solution of large scale, single-source, capacitated plant location problems
- Facility location, distributed approximation
Methods of successive quadratic programming type (90C55) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Continuous location (90B85)
Cites Work
- Approximation of solutions for location problems
- Convex analysis and global optimization
- Competitive location with rectilinear distances
- An Algorithm for a Constrained Weber Problem
- A d.c. optimization method for single facility location problems
- Weber's problem with attraction and repulsion under polyhedral gauges
- Polyhedral annexation, dualization and dimension reduction technique in global optimization
- Global optimization of a nonconvex single facility location problem by sequential unconstrained convex minimization
- Title not available (Why is that?)
Cited In (10)
- A note on equity across groups in facility location
- A d.c. optimization method for single facility location problems
- Solution of the multisource Weber and conditional Weber problems by d. -c. programming
- Gradual cover competitive facility location
- Location of a distribution center for a perishable product
- Equity models in planar location
- Global optimization of a nonconvex single facility location problem by sequential unconstrained convex minimization
- Solving a continuous multifacility location problem by DC algorithms
- Sequential location of two facilities: comparing random to optimal location of the first facility
- Big segment small segment global optimization algorithm on networks
This page was built for publication: LARGE-SCALE SINGLE FACILITY CONTINUOUS LOCATION BY D.C. OPTIMIZATION
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4548044)
