Solving the continuous multiple allocationp-hub median problem by the hyperbolic smoothing approach
From MaRDI portal
Publication:3453424
DOI10.1080/02331934.2014.929677zbMath1327.90319OpenAlexW2074889662MaRDI QIDQ3453424
Claudio M. Gesteira, Vinicius Layter Xavier, Adilson Elias Xavier
Publication date: 27 November 2015
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2014.929677
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Nondifferentiability (nondifferentiable functions, points of nondifferentiability), discontinuous derivatives (26A27) Smoothing in differential topology (57R10)
Related Items
Hyperbolic regression: a new regression model with applications to the binary classification problem, Dislocation hyperbolic augmented Lagrangian algorithm for nonconvex optimization
Cites Work
- Unnamed Item
- Solving the minimum sum-of-squares clustering problem by hyperbolic smoothing and partition into boundary and gravitational regions
- Adapting polyhedral properties from facility to hub location problems
- Optimal covering of plane domains by circles via hyperbolic smoothing
- A quadratic integer program for the location of interacting hub facilities
- Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
- Integer programming formulations of discrete hub location problems
- Exact and heuristic approaches for the cycle hub location problem
- An improved Benders decomposition algorithm for the tree of hubs location problem
- Star \(p\)-hub median problem with modular arc capacities
- Network hub location problems: The state of the art
- The hyperbolic smoothing clustering method
- Hyperbolic smoothing function method for minimax problems
- On the Location of Hub Facilities
- TSPLIB—A Traveling Salesman Problem Library
- Interacting New Facilities and Location-Allocation Problems
- Hub network design with single and multiple allocation: A computational study
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Solving the hub location problem in a star–star network
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
