A new algorithm for the minimax location problem with the closest distance

DOI10.1080/02331934.2022.2081081MaRDI QIDQ6092935FDOQ6092935

Authors: S. Nobakhtian, Ahmadreza Raeisi Dehkordi 

Publication date: 23 November 2023

Published in: Optimization (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 4204110
• scientific article; zbMATH DE number 4199954
• scientific article; zbMATH DE number 1967834
• scientific article; zbMATH DE number 4181131
• A discretizing algorithm for location problems

zbMATH Keywords

global convergencenon-smooth optimizationclosest distanceminimax location problem

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Continuous location (90B85)

Cites Work

• THE SMALLEST ENCLOSING BALL OF BALLS: COMBINATORIAL STRUCTURE AND ALGORITHMS
• Discrete gradient method: Derivative-free method for nonsmooth optimization
• Title not available (Why is that?)
• Convex Analysis
• Techniques of variational analysis
• Title not available (Why is that?)
• Efficient Algorithms for the (Weighted) Minimum Circle Problem
• The method of projections for finding the common point of convex sets
• Efficient algorithms for the smallest enclosing ball problem
• Two Algorithms for the Minimum Enclosing Ball Problem
• Solving general continuous single facility location problems by cutting planes
• About regularity of collections of sets
• Analysis of the convergence rate for the cyclic projection algorithm applied to basic semialgebraic convex sets
• The Minimum Covering Sphere Problem
• Algorithms with adaptive smoothing for finite minimax problems
• An Incremental Method for Solving Convex Finite Min-Max Problems
• An Approach to Location Models Involving Sets as Existing Facilities
• The rate of convergence for the cyclic projections algorithm. III: Regularity of convex sets
• The Weber problem with regional demand
• Minisum location with closest Euclidean distances
• Title not available (Why is that?)
• Location of facilities with rectangular distances among point and area destinations
• Locating facilities by minimax relative to closest points of demand areas
• Derivative-free optimization methods for finite minimax problems
• Approximate minimum enclosing balls in high dimensions using core-sets
• A subgradient algorithm for certain minimax and minisum problems
• Title not available (Why is that?)
• A fast algorithm for the rectilinear distance location problem
• Duality results for nonlinear single minimax location problems via multi-composed optimization
• An algorithm for the minimax Weber problem
• Title not available (Why is that?)
• Constrained minimum enclosing circle with center on a query line segment
• An efficient algorithm for the smallest enclosing ball problem in high dimensions
• An Efficient Geometric Solution to the Minimum Spanning Circle Problem
• An algorithm for generalized constrained multi-source Weber problem with demand substations
• Using tropical optimization to solve constrained minimax single-facility location problems with rectilinear distance
• The optimal solution set of the multi-source Weber problem

Cited In (4)

• MINIMAX LOCATION PROBLEM WITH A-DISTANCE
• New measures of proximity for the assignment algorithms in the MDVRPTW
• Minisum location problem with farthest Euclidean distances
• Minisum location with closest Euclidean distances

This page was built for publication: A new algorithm for the minimax location problem with the closest distance

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6092935)