Similar Search Results

The recoverable robust two-level network design problem

Álvarez-Miranda, Eduardo; Ljubić, Ivana; Raghavan, S.; … - In: INFORMS journal on computing : JOC 27 (2015) 1, pp. 1-19

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

Benders decomposition for very large scale partial set covering and maximal covering location problems

Cordeau, Jean-François; Furini, Fabio; Ljubić, Ivana - In: European journal of operational research : EJOR 275 (2019) 3, pp. 882-896

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

A new general-purpose algorithm for mixed-integer bilevel linear programs

Fischetti, Matteo; Ljubić, Ivana; Monaci, Michele; … - In: Operations research 65 (2017) 6, pp. 1615-1637

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

Solving minimum-cost shared arborescence problems

Álvarez-Miranda, Eduardo; Ljubić, Ivana; Luipersbeck, … - In: European journal of operational research : EJOR 258 (2017) 3, pp. 887-901

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

The generalized regenerator location problem

Chen, Si; Ljubić, Ivana; Raghavan, S. - In: INFORMS journal on computing : JOC 27 (2015) 2, pp. 204-220

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

Redesigning benders decomposition for large-scale facility location

Fischetti, Matteo; Ljubić, Ivana; Sinnl, Markus - In: Management science : journal of the Institute for … 63 (2017) 7, pp. 2146-2162

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

Outer approximation and submodular cuts for maximum capture facility location problems with random utilities

Ljubić, Ivana; Moreno, Eduardo - In: European journal of operational research : EJOR 266 (2018) 1, pp. 46-56

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

Stochastic survivable network design problems : theory and practice

Ljubić, Ivana; Mutzel, Petra; Zey, Bernd - In: European journal of operational research : EJOR 256 (2017) 2, pp. 333-348

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

An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem

Furini, Fabio; Ljubić, Ivana; Sinnl, Markus - In: European journal of operational research : EJOR 262 (2017) 2, pp. 438-448

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

An Exact Method for Assortment Optimization Under the Nested Logit Model

Alfandari, Laurent - 2020

We study the problem of finding an optimal assortment of products maximizing the expected revenue, in which customer preferences are modeled using a Nested Logit choice model. This problem is known to be polynomially solvable in a specific case and NP-hard otherwise, with only approximation...

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

A service of the

zbw