Algorithms for approximating the nondominated set of multiobjective optimization problems
are reviewed. The approaches are categorized into general methods that are applicable …

We consider the minimum cost spanning tree problem under the restriction that all degrees
must be at most a given value k. We show that we can efficiently find a spanning tree of …

Many combinatorial optimization problems have underlying goal functions that are
submodular. The classical goal is to find a good solution for a given submodular function f …

Abstract Affinely Adjustable Robust Counterparts provide tractable alternatives to (two‐
stage) robust programs with arbitrary recourse. Following Ouorou and Vial, we apply them to …

We present new algebraic approaches for two well-known combinatorial problems:
nonbipartite matching and matroid intersection. Our work yields new randomized algorithms …

We investigate the problem of computing a minimum set of solutions that approximates
within a specified accuracy ϵ the Pareto curve of a multiobjective optimization problem. We …

A natural way to deal with multiple, partially conflicting objectives is turning all the objectives
but one into budget constraints. Many classical optimization problems, such as maximum …

We study a family of matroid optimization problems with a linear constraint (MOL). In these
problems, we seek a subset of elements which optimizes (ie, maximizes or minimizes) a …

We study the budgeted laminar matroid independent set problem. The input is a ground set,
where each element has a cost and a non-negative profit, along with a laminar matroid over …

In this paper we derive tight lower bounds resolving the hardness status of several
fundamental weighted matroid problems. One notable example is budgeted matroid …