Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Multi-objective minmax robust combinatorial optimization with
  cardinality-constrained uncertainty   In this paper we develop two approaches to find minmax robust efficient
solutions for multi-objective combinatorial optimization problems with
cardinality-constrained uncertainty. First, we extend an algorithm of Bertsimas
and Sim (2003) for the single-objective problem to multi-objective
optimization. We propose also an enhancement to accelerate the algorithm, even
for the single-objective case, and we develop a faster version for special
multi-objective instances. Second, we introduce a deterministic multi-objective
problem with sum and bottleneck functions, which provides a superset of the
robust efficient solutions. Based on this, we develop a label setting algorithm
to solve the multi-objective uncertain shortest path problem. We compare both
approaches on instances of the multi-objective uncertain shortest path problem
originating from hazardous material transportation.

28
The categories of this paper are: alg-geom
7
The categories of this paper are: hep-th
11
The categories of this paper are: hep-lat
26
The categories of this paper are: bayes-an
10
The categories of this paper are: q-bio
16
The categories of this paper are: stat
20
The categories of this paper are: acc-phys
6
The categories of this paper are: astro-ph
5
The categories of this paper are: gr-qc
25
The categories of this paper are: patt-sol
22
The categories of this paper are: chao-dyn
29
The categories of this paper are: funct-an
12
The categories of this paper are: nucl-th
30
The categories of this paper are: q-alg
17
The categories of this paper are: q-fin
34
The categories of this paper are: chem-ph