Markus Sinnl
Titel
Zitiert von
Zitiert von
Jahr
Redesigning Benders decomposition for large-scale facility location
M Fischetti, I Ljubić, M Sinnl
Management Science 63 (7), 2146-2162, 2017
1302017
A new general-purpose algorithm for mixed-integer bilevel linear programs
M Fischetti, I Ljubić, M Monaci, M Sinnl
Operations Research 65 (6), 1615-1637, 2017
992017
Benders decomposition without separability: A computational study for capacitated facility location problems
M Fischetti, I Ljubić, M Sinnl
European Journal of Operational Research 253 (3), 557-569, 2016
912016
Thinning out Steiner trees: a node-based model for uniform edge costs
M Fischetti, M Leitner, I Ljubić, M Luipersbeck, M Monaci, M Resch, ...
Mathematical Programming Computation 9 (2), 203-229, 2017
782017
Interdiction games and monotonicity, with application to knapsack problems
M Fischetti, I Ljubić, M Monaci, M Sinnl
INFORMS Journal on Computing 31 (2), 390-410, 2019
46*2019
On the use of intersection cuts for bilevel optimization
M Fischetti, I Ljubić, M Monaci, M Sinnl
Mathematical Programming 172 (1), 77-103, 2018
382018
Intersection cuts for bilevel optimization
M Fischetti, I Ljubić, M Monaci, M Sinnl
International Conference on Integer Programming and Combinatorial …, 2016
382016
A dynamic reformulation heuristic for generalized interdiction problems
M Fischetti, M Monaci, M Sinnl
European Journal of Operational Research 267 (1), 40-51, 2018
242018
A dual ascent-based branch-and-bound framework for the prize-collecting Steiner tree and related problems
M Leitner, I Ljubić, M Luipersbeck, M Sinnl
INFORMS Journal on Computing 30 (2), 402-420, 2018
242018
An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem
F Furini, I Ljubić, M Sinnl
European journal of operational research 262 (2), 438-448, 2017
222017
Alteration of Golgi structure by stress: A link to neurodegeneration?
EA Alvarez-Miranda, M Sinnl, H Farhan
Frontiers in neuroscience 9, 435, 2015
172015
A computational study of exact approaches for the bi-objective prize-collecting steiner tree problem
M Leitner, I Ljubić, M Sinnl
INFORMS Journal on Computing 27 (1), 118-134, 2015
16*2015
On the two-architecture connected facility location problem
M Leitner, I Ljubić, M Sinnl, A Werner
Electronic Notes in Discrete Mathematics 41, 359-366, 2013
142013
An algorithmic framework for the exact solution of tree-star problems
M Leitner, I Ljubić, JJ Salazar-González, M Sinnl
European Journal of Operational Research 261 (1), 54-66, 2017
122017
ILP heuristics and a new exact method for bi-objective 0/1 ILPs: Application to FTTx-network design
M Leitner, I Ljubić, M Sinnl, A Werner
Computers & Operations Research 72, 128-146, 2016
122016
A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints
M Sinnl, I Ljubić
Mathematical Programming Computation 8 (4), 461-490, 2016
112016
Branch-and-price for the Steiner tree problem with revenues, budget and hop constraints
M Sinnl
na, 2011
102011
Solving the bi-objective prize-collecting Steiner tree problem with the ϵ-constraint method
M Leitner, I Ljubić, M Sinnl
Electronic Notes in Discrete Mathematics 41, 181-188, 2013
82013
A branch-and-cut algorithm for the maximum covering cycle problem
E Álvarez-Miranda, M Sinnl
Annals of Operations Research 284 (2), 487-499, 2020
72020
A Relax-and-Cut framework for large-scale maximum weight connected subgraph problems
E Álvarez-Miranda, M Sinnl
Computers & Operations Research 87, 63-82, 2017
72017
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20