Find link

language:

Find link is a tool written by Edward Betts.

searching for Lagrangian relaxation 14 found (25 total)

Subgradient method (1,495 words) [view diff] exact match in snippet view article find links to article

Springer-Verlag. ISBN 0-387-12763-1. Lemaréchal, Claude (2001). "Lagrangian relaxation". In Michael Jünger and Denis Naddef (ed.). Computational combinatorial

Duality (optimization) (3,869 words) [view diff] exact match in snippet view article

ISBN 978-0-486-41999-2. MR 1888251. Lemaréchal, Claude (2001). "Lagrangian relaxation". In Jünger, Michael; Naddef, Denis (eds.). Computational combinatorial

Automatic label placement (1,545 words) [view diff] exact match in snippet view article find links to article

can usually be found in a practical amount of computer time using Lagrangian relaxation to solve the dual formulation of the optimization problem. The first

Duality gap (844 words) [view diff] exact match in snippet view article find links to article

ISBN 978-0-486-41999-2. MR 1888251. Lemaréchal, Claude (2001). "Lagrangian relaxation". In Jünger, Michael; Naddef, Denis (eds.). Computational combinatorial

De novo peptide sequencing (3,995 words) [view diff] exact match in snippet view article find links to article

described by Andreotti et al. in 2012, Antilope is a combination of Lagrangian relaxation and an adaptation of Yen's k shortest paths. It is based on 'spectrum

Vijay Vazirani (860 words) [view diff] exact match in snippet view article find links to article

location and k-median problems using the primal-dual schema and Lagrangian relaxation", Journal of the ACM, 48 (2): 274–296, doi:10.1145/375827.375845

Claude Lemaréchal (1,257 words) [view diff] exact match in snippet view article find links to article

ISBN 978-3-540-56852-0. MR 1295240. Lemaréchal, Claude (2001). "Lagrangian relaxation". In Michael Jünger and Denis Naddef (ed.). Computational combinatorial

Convex optimization (3,092 words) [view diff] exact match in snippet view article find links to article

Springer-Verlag. ISBN 978-3-540-15642-0. Lemaréchal, Claude (2001). "Lagrangian relaxation". In Michael Jünger and Denis Naddef (ed.). Computational combinatorial

Albert Wagelmans (1,070 words) [view diff] exact match in snippet view article find links to article

algorithms are both based on a combination of column generation and Lagrangian relaxation. Furthermore, we compare those integrated approaches with each other

Hugh Everett III (3,812 words) [view diff] exact match in snippet view article find links to article

interpretation" . Lemaréchal (2001, pp. 125–126): Lemaréchal, Claude (2001). "Lagrangian relaxation". In Michael Jünger and Denis Naddef (ed.). Computational combinatorial

MRF optimization via dual decomposition (1,324 words) [view diff] exact match in snippet view article find links to article

{\displaystyle x^{T}\in \chi ^{T}} The Slave problems Theorem 1. Lagrangian relaxation (9) is equivalent to the LP relaxation of (2). min { x T } , x {

Unit commitment problem in electrical power production (2,611 words) [view diff] exact match in snippet view article find links to article

Bard. Short-term scheduling of thermal-electric generators using Lagrangian relaxation. Operations Research 1338 36(5):765–766, 1988. N.P. Padhy. Unit

Mathematical economics (13,620 words) [view diff] exact match in snippet view article find links to article

ISBN 978-3-540-56852-0. MR 1295240. Lemaréchal, Claude (2001). "Lagrangian relaxation". In Michael Jünger; Denis Naddef (eds.). Computational combinatorial

List of RNA structure prediction software (8,423 words) [view diff] exact match in snippet view article find links to article

alignment of ncRNA families using integer linear programming and Lagrangian relaxation. any Yes Yes No sourcecode LocaRNA LocaRNA is the successor of PMcomp