Search Results - subject:"Lagrangean decomposition"

Did you mean: subject:"lagrangian decomposition" (21 results)

Decomposition methods for multi-horizon stochastic programming

Zhang, Hongyu; Grossmann, Ignacio E.; Tomasgard, Asgeir - In: Computational management science 21 (2024) 1, pp. 1-24

Persistent link: https://www.econbiz.de/10014636804

3-D dynamic UAV base station location problem

Cicek, Cihan Tugrul; Shen, Zuo-Jun; Gultekin, Hakan; … - In: INFORMS journal on computing : JOC 33 (2021) 3, pp. 839-860

Persistent link: https://www.econbiz.de/10012628737

A Lagrangean decomposition approach for a novel two-echelon node-based location-routing problem in an offshore oil and gas supply chain

Amiri, Mohsen; Amin, Saman Hassanzadeh; … - In: Transportation research / E : an international journal 128 (2019), pp. 96-114

Persistent link: https://www.econbiz.de/10012061120

Relay network design with capacity and link-imbalance considerations : a lagrangean decomposition algorithm and analysis

Kewcharoenwong, Panitan; Üster, Halit - In: Transportation science : a journal of the Institute for … 51 (2017) 4, pp. 1177-1195

Persistent link: https://www.econbiz.de/10011779261

Lagrangean decomposition for large-scale two-stage stochastic mixed 0-1 problems

Escudero Bueno, Laureano F.; Martín, Garín; Araceli, … - Departamento de Economía Aplicada III (Econometría y … - 2010

In this paper we study solution methods for solving the dual problem corresponding to the Lagrangean Decomposition of …-anticipativity constraints. We compare the performance of four iterative algorithms based on dual Lagrangean Decomposition schemes, as the … representation of the deterministic equivalent model, where 0-1 and continuous variables appear at any stage. Lagrangean …

Persistent link: https://www.econbiz.de/10008460992

A Decomposition Method for Quadratic Zero-One Programming

Chardaire, Pierre; Sutter, Alain - In: Management Science 41 (1995) 4, pp. 704-712

This paper proposes a decomposition method to compute a lower bound for unconstrained quadratic zero-one minimization. First, we show that any quadratic function can be expressed as a sum of particular quadratic functions whose minima can be computed by a simple branch and bound algorithm. Then,...

Persistent link: https://www.econbiz.de/10009214386