|
|
|
|
|
 |
Search published articles |
 |
|
Showing 2 results for Relaxation
Salahi,
Volume 2, Issue 2 (6-2011)
Abstract
Semidefinite optimization relaxations are among the widely used approaches to find global optimal or approximate solutions for many nonconvex problems. Here, we consider a specific quadratically constrained quadratic problem with an additional linear constraint. We prove that under certain conditions the semidefinite relaxation approach enables us to find a global optimal solution of the underlying problem in polynomial time .
Mr Yaser Khosravian, Prof Ali Shahandeh Nookabadi, Prof Ghasem Moslehi,
Volume 15, Issue 1 (7-2024)
Abstract
Traditional maximal p-hub covering problems focus on scenarios where network flow is constrained by resource limitations. However, many existing models rely on static parameters, overlooking the inherent randomness present in real-world logistics. This oversight can result in suboptimal network designs that are vulnerable to congestion and rising costs as demand varies. To address this issue, we propose a novel mathematical model for the capacitated single allocation maximal p-hub covering problem that takes into account stochastic variations in origin-destination flows. Although solving this model poses computational challenges, we utilize a Lagrangian relaxation algorithm to enhance efficiency. Computational experiments using the CAB dataset highlight the effectiveness of our approach in achieving optimal solutions while reducing computation time. This framework offers valuable insights for designing robust hub-and-spoke networks in the face of demand uncertainty.
|
|
|
|
|
|
|
|
|
