5 citations · 6 across the 3 of their papers we have counts for
4 papers · 1 filter
Robust Combinatorial Optimization with Locally Budgeted Uncertainty
Marc Goerigk, Stefan Lendl
Budgeted uncertainty sets have been established as a major influence on uncertainty modeling for robust optimization problems. A drawback of such sets is that the budget constraint…
Recoverable Robust Representatives Selection Problems with Discrete Budgeted Uncertainty
Marc Goerigk, Stefan Lendl, Lasse Wulf
Recoverable robust optimization is a multi-stage approach, where it is possible to adjust a first-stage solution after the uncertain cost scenario is revealed. We analyze this appr…
Matroid Bases with Cardinality Constraints on the Intersection
Stefan Lendl, Britta Peis, Veerle Timmermans
Given two matroids and on a common ground set with base sets and $\mathcal{B…
Combinatorial Optimization Problems with Interaction Costs: Complexity and Solvable Cases
Stefan Lendl, Ante Ćustić, Abraham P. Punnen
We introduce and study the combinatorial optimization problem with interaction costs (COPIC). COPIC is the problem of finding two combinatorial structures, one from each of two giv…