SPARSE CONVEX OPTIMIZATION VIA ADAPTIVELY REGULARIZED HARD THRESHOLDING

von Axiotis, Kyriakos
Veröffentlicht in International Conference on Machine Learning (37. : 2020 : Online) 37th International Conference on Machine Learning (ICML 2020) ; Part 1 of 15 (2021)

On the maximum quadratic assignment problem

von Nagarajan, Viswanath
Veröffentlicht in Mathematics of operations research (2009)

Tight bounds for permutation flow shop scheduling

von Nagarajan, Viswanath
Veröffentlicht in Mathematics of operations research (2009)

No-wait flowshop scheduling is as hard as asymmetric traveling salesman problem

von Mucha, Marcin
Veröffentlicht in Mathematics of operations research (2016)

High-multiplicity cyclic job shop scheduling

von Kimbrel, Tracy
Veröffentlicht in Operations research letters (2008)

Approximation algorithms for the capacitated multi-item lot-sizing problem via flow-cover inequalities

von Levi, Retsef
Veröffentlicht in Mathematics of operations research (2008)

Machine scheduling with resource dependent processing times

von Grigoriev, Alexander
Veröffentlicht 2005

Integrated supply chain management via randomized rounding

von Pedrosa, Lehilton L. C.
Veröffentlicht in Institute for Operations Research and the Management Sciences INFORMS journal on computing (2018)

A complete 4-parametric complexity classification of short shop scheduling problems

von Kononov, Alexander
Veröffentlicht in Journal of scheduling (2012)

Unrelated machine scheduling with stochastic processing times

von Skutella, Martin
Veröffentlicht in Mathematics of operations research (2016)

Submodular maximization over multiple matroids via generalized exchange properties

von Lee, Jon
Veröffentlicht in Mathematics of operations research (2010)

Unrelated parallel machine scheduling with resource dependent processing times

von Grigoriev, Alexander
Veröffentlicht 2004

Optimal approximation for submodular and supermodular optimization with bounded curvature

von Sviridenko, Maxim
Veröffentlicht in Mathematics of operations research (2017)

Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems

von Bläser, Markus
Veröffentlicht in Operations research letters (2009)

Submodular stochastic probing on matroids

von Adamczyk, Marek
Veröffentlicht in Mathematics of operations research (2016)

A constant approximation algorithm for the one-warehouse multiretailer problem

Veröffentlicht in Management science (2008)

Tight approximation algorithms for maximum separable assignment problems

Veröffentlicht in Mathematics of operations research (2011)

Energy-efficient scheduling and routing via randomized rounding

von Bampis, Evripidis
Veröffentlicht in Journal of scheduling (2018)

Optimal bundle pricing with monotonicity constraint

Veröffentlicht 2008