Similar Search Results

On exact solutions for the Minimax Regret Spanning Tree problem

Pérez-Galarce, Francisco; Álvarez-Miranda, Eduardo; … - In: Computers & operations research : and their … 47 (2014), pp. 114-122

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

A branch-and-price framework for decomposing graphs into relaxed cliques

Gschwind, Timo; Irnich, Stefan; Furini, Fabio - In: INFORMS journal on computing : JOC 33 (2021) 3, pp. 1070-1090

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

Benders decomposition for competitive influence maximization in (social) networks

Kahr, Michael; Leitner, Markus; Ruthmair, Mario; Sinnl, … - In: Omega : the international journal of management science 100 (2021), pp. 1-13

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

Stable set reformulations for the degree preserving spanning tree problem

Lucena, Abílio; Cunha, Alexandre Salles da - In: European journal of operational research : EJOR 319 (2024) 1, pp. 50-61

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

Dynamic usage allocation and pricing for curb space operation

Lim, Jisoon; Masoud, Neda - 2024

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

Logical reconfiguration of reconfigurable manufacturing systems with stream of variations modelling : a stochastic two-stage programming and shortest path model

Kristiano, Yohanes; Gunasekaran, Angappa; Jiao, Jianxin - In: International journal of production research 52 (2014) 5, pp. 1401-1418

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

Block decomposition approach to compute a minimum geodetic set

Ekim, Tinaz; Erey, Aysel - In: RAIRO / Operations research 48 (2014) 4, pp. 497-507

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

A minmax regret version of the time-dependent shortest path problem

Conde, Eduardo; Leal, Marina; Puerto, Justo - In: European journal of operational research : EJOR 270 (2018) 3, pp. 968-981

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

Layered graph approaches for combinatorial optimization problems

Gouveia, Luis; Leitner, Markus; Ruthmair, Mario - In: Computers & operations research : and their … 102 (2019), pp. 22-38

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

Accelerated decomposition techniques for large discounted Markov decision processes

Larach, Abdelhadi; Chafik, S.; Daoui, C. - In: Journal of industrial engineering international 13 (2017) 4, pp. 417-426

Many hierarchical techniques to solve large Markov decision processes (MDPs) are based on the partition of the state space into strongly connected components (SCCs) that can be classified into some levels. In each level, smaller problems named restricted MDPs are solved, and then these partial...

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