Results 151 to 160 of about 3,036 (205)

Lagrangian relaxation graph matching

Pattern Recognition, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bin Luo, Xiaochun Cao, Jin Tang
exaly   +3 more sources

Lagrangian relaxation in the multicriterial routing

IEEE Africon '11, 2011
Communications networks routing is not a new subject. However, with a growth of packet networks and the increase of their range and importance, the task of conveying information over the web has grown beyond its original shape and has become far more sophisticated. It is no longer computer scientists and the military that make use of the global network
Krzysztof Stachowiak   +2 more
openaire   +1 more source

A nonlinear optimization by Lagrangian relaxations

ICECS 2000. 7th IEEE International Conference on Electronics, Circuits and Systems (Cat. No.00EX445), 2002
Finding consistent and realistic reorder intervals for each item in large-scale production-distribution systems is formulated as a large-scale nonlinear programming problem. A model is presented and a Lagrange multiplier method of solution is used.
Naser Mollaverdi   +1 more
openaire   +1 more source

Railway Timetabling Using Lagrangian Relaxation

Transportation Science, 1998
We present a novel optimization approach for the timetabling problem of a railway company, i.e., scheduling of a set of trains to obtain a profit maximizing timetable, while not violating track capacity constraints. The scheduling decisions are based on estimates of the value of running different types of service at specified times.
Ulf Brännlund   +3 more
openaire   +2 more sources

Convergence of the Surrogate Lagrangian Relaxation Method

Journal of Optimization Theory and Applications, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mikhail A. Bragin   +4 more
openaire   +1 more source

Constraint-Based Lagrangian Relaxation

2014
This paper studies how to generalize Lagrangian relaxation to high-level optimization models, including constraint-programming and local search models. It exploits the concepts of constraint violation (typically used in constraint programming and local search) and constraint satisfiability (typically exploited in mathematical programming).
Daniel Fontaine   +2 more
openaire   +1 more source

Lagrangian relaxation for gate implementation selection

Proceedings of the 2011 international symposium on Physical design, 2011
In a typical circuit optimization flow, one essential decision is to select the implementation for each gate according to a cell library. An implementation implies specific gate size, threshold voltage, etc. The selection normally needs to handle multiple and often conflicting objectives.
Yi-Le Huang, Jiang Hu 0001, Weiping Shi
openaire   +1 more source

A Lagrangian relaxation network for graph matching

IEEE Transactions on Neural Networks, 1996
A Lagrangian relaxation network for graph matching is presented. The problem is formulated as follows: given graphs G and g, find a permutation matrix M that brings the two sets of vertices into correspondence. Permutation matrix constraints are formulated in the framework of deterministic annealing.
Anand Rangarajan 0001, Eric Mjolsness
openaire   +2 more sources

Home - About - Disclaimer - Privacy