Results 21 to 30 of about 3,036 (205)
Journal of Telecommunications and Information Technology, 2012 A cross-layer network optimization problem is considered. It involves network and transport layers, treating both routing and flows as decision variables.
Andrzej Karbowski
doaj +1 more source
On Lagrangian Relaxation and Reoptimization Problems
CoRR, 2015 We prove a general result demonstrating the power of Lagrangian relaxation in solving constrained maximization problems with arbitrary objective functions. This yields a unified approach for solving a wide class of {\em subset selection} problems with linear constraints.
Ariel Kulik, Hadas Shachnai, Gal Tamir
openaire +2 more sources
A Capacitated Location-Inventory Model with Demand Selection
Journal of Advanced Transportation, 2019 In this paper, we consider an integrated supply chain network design problem, which incorporates inventory and pricing decisions into the capacitated facility location model. We assume that each warehouse has a capacity limitation that limits the average
Zhengyi Li, Jiangtao Hai
doaj +1 more source
A Lagrangian-ACO matheuristic for car sequencing
EURO Journal on Computational Optimization, 2014 In this study, we investigate a hybrid Lagrangian relaxation ant colony optimisation for optimisation version of the car sequencing problem. Several cars are required to be scheduled on an assembly line and each car requires a number of options such as ...
Dhananjay Thiruvady +2 more
doaj +1 more source
Solving Spatial Optimization Problems via Lagrangian Relaxation and Automatic Gradient Computation
ISPRS International Journal of Geo-InformationSpatial optimization is an integral part of GIS and spatial analysis. It involves making various decisions in space, ranging from the location of public facilities to vehicle routing and political districting.
Zhen Lei, Ting L. Lei
doaj +1 more source
On Lagrangian Relaxation and Subset Selection Problems [PDF]
, 2009 We prove a general result demonstrating the power of Lagrangian relaxation in solving constrained maximization problems with arbitrary objective functions. This yields a unified approach for solving a wide class of subset selection problems with linear constraints. Given a problem in this class and some small e ∈ (0,1), we show that if there exists a ρ-
Ariel Kulik, Hadas Shachnai
openaire +1 more source
Lagrangian-Relaxation-Based Self-Repairing Mechanism for Wi-Fi Networks
IEEE Access, 2019 Wi-Fi was developed to support software-defined networks that are crucial for achieving high quality of service for next generation wireless networks. In this software-defined networking technology, network resources are utilized to reduce the effects of
Ming-Chi Tsai +2 more
doaj +1 more source
Exact makespan minimization of unrelated parallel machines
Open Journal of Mathematical Optimization, 2021 We study methods for the exact solution of the unrelated parallel machine problem with makespan minimization, generally denoted as $R||C_\text{max}$. Our original application arises from the automotive assembly process where tasks needs to be distributed
Åblad, Edvin +2 more
doaj +1 more source
A Flexible Space-Time Tradeoff on Hybrid Index with Bicriteria Optimization
Tsinghua Science and Technology, 2019 Inverted indexes are widely adopted in the vast majority of information systems. Growing requirements for efficient query processing have motivated the development of various compression techniques with different space-time characteristics.
Xingshen Song, Yuexiang Yang, Yu Jiang
doaj +1 more source
Mimetic Methods for Lagrangian Relaxation of Magnetic Fields [PDF]
SIAM Journal on Scientific Computing, 2014 We present a new code that performs a relaxation of a magnetic field towards a force-free state (Beltrami field) using a Lagrangian numerical scheme. Beltrami fields are of interest for the dynamics of many technical and astrophysical plasmas as they are the lowest energy states that the magnetic field can reach. The numerical method strictly preserves
Simon Candelaresi +2 more
openaire +4 more sources