LARGE-SCALE SINGLE FACILITY CONTINUOUS LOCATION BY D.C. OPTIMIZATION

DOI10.1080/02331930290019422MaRDI QIDQ4548044zbMATH OpenOpenAlexFDO

Authors Hoang Tuy, Faiz Al-Khayyal, Fangjun Zhou

Publication date 4 November 2002

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331930290019422

zbMATH Keywords

competitive locationnondifferentiable optimizationconstrained locationmaximin location

Mathematics Subject Classification ID

Methods of successive quadratic programming type (90C55) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Continuous location (90B85)

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

Cites work

• scientific article; zbMATH DE number 644289 (Why is no real title available?)
• A d.c. optimization method for single facility location problems
• An Algorithm for a Constrained Weber Problem
• Approximation of solutions for location problems
• Competitive location with rectilinear distances
• Convex analysis and global optimization
• Global optimization of a nonconvex single facility location problem by sequential unconstrained convex minimization
• Polyhedral annexation, dualization and dimension reduction technique in global optimization
• Weber's problem with attraction and repulsion under polyhedral gauges

Cited in

(11)

• Equity models in planar location
• A d.c. optimization method for single facility location problems
• Gradual cover competitive facility location
• Global optimization of a nonconvex single facility location problem by sequential unconstrained convex minimization
• Solving a continuous multifacility location problem by DC algorithms
• Location of a distribution center for a perishable product
• Big segment small segment global optimization algorithm on networks
• A note on equity across groups in facility location
• Sequential location of two facilities: comparing random to optimal location of the first facility
• Solution of the multisource Weber and conditional Weber problems by d. -c. programming
• Locating a semi-obnoxious facility -- A Toland-Singer duality based approach

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)