Results 161 to 170 of about 3,036 (205)
Some of the next articles are maybe not open access.
On the Surrogate Gradient Algorithm for Lagrangian Relaxation
Journal of Optimization Theory and Applications, 2007zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sun, T., Zhao, Q. C., Luh, P. B.
openaire +2 more sources
Cluster Analysis: An Application of Lagrangian Relaxation
Management Science, 1979This paper presents and tests an effective optimization algorithm for clustering homogeneous data. The algorithm iteratively employs a subgradient method for determining lower bounds and a simple search procedure for determining upper bounds. The overall objective is to assign n objects to m mutually exclusive “clusters” such that the sum of the ...
John M. Mulvey, Harlan P. Crowder
openaire +2 more sources
Boosting local search with Lagrangian relaxation
Journal of Heuristics, 2014Local search algorithms play an essential role in solving large-scale combinatorial optimization problems. Traditionally, the local search procedure is guided mainly by the objective function of the problem. Hence, the greedy improvement paradigm poses the potential threat of prematurely getting trapped in low quality attraction basins.
Zhilei Ren +4 more
openaire +1 more source
On Lagrangian relaxation for constrained maximization and reoptimization problems
Discrete Applied Mathematics, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ariel Kulik, Hadas Shachnai, Gal Tamir
openaire +2 more sources
Surrogate Gradient Algorithm for Lagrangian Relaxation
Journal of Optimization Theory and Applications, 1999zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhao, X., Luh, Peter B., Wang, J.
openaire +1 more source
Lagrangian relaxations for multiple network alignment
Data Mining and Knowledge Discovery, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Eric Malmi +2 more
openaire +2 more sources
Partial Lagrangian relaxation for general quadratic programming
4OR, 2006The authors give a complete characterization of constant quadratic functions over an affine variety. This result is used to convexify the objective function of a general quadratic programming problem (Pb) which contains linear equality constraints. Thanks to this convexification, the authors show that one can express as a semidefinite programm the dual
Faye, Alain, Roupin, Frédéric
openaire +2 more sources
Revisiting Lagrangian relaxation for network design
Discrete Applied Mathematics, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Lagrangian relaxation for complex job shop scheduling
Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006., 2006Market competition forces manufactures to schedule their resources efficiently for on-time order delivery and low inventory. However, for companies such as textile and steel-making companies, optimizing schedules is difficult because of the NP-hard nature of the problem and the complex product structures: assemblies, disassemblies and couplings across ...
Tao Sun, Peter B. Luh, Min Liu
openaire +1 more source
Operating theatre scheduling using Lagrangian relaxation
European J. of Industrial Engineering, 2006This paper addresses the surgery operation scheduling problem. Two types of resources are considered, operating rooms and recovery beds. Each patient first visits an operating room for surgery operation and is transferred to a recovery room immediately after the surgery operation.
Augusto, Vincent +2 more
openaire +3 more sources