Min–max–min robust combinatorial optimization

Christoph Buchheim; Jannis Kurtz

doi:10.1007/s10107-016-1053-z

ScienceGate Book Chapters

JOURNAL ARTICLE

Min–max–min robust combinatorial optimization

Christoph Buchheim Jannis Kurtz

Year: 2016 Journal: Mathematical Programming Vol: 163 (1-2)Pages: 1-23 Publisher: Springer Science+Business Media

DOI: 10.1007/s10107-016-1053-z

Get Full-Text PDF Get Analytical Report

Keywords:

Mathematics Oracle Mathematical optimization Combinatorial optimization Function (biology) Heuristic Set (abstract data type) Optimization problem Submodular set function Robust optimization Polyhedron Time complexity Combinatorics Computer science

Metrics

Cited By

4.21

FWCI (Field Weighted Citation Impact)

Refs

0.96

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Risk and Portfolio Optimization

Social Sciences → Decision Sciences → Management Science and Operations Research

Water resources management and optimization

Physical Sciences → Engineering → Ocean Engineering

Optimization and Search Problems

Physical Sciences → Computer Science → Computer Networks and Communications

Min–max–min robust combinatorial optimization

Metrics

Citation History

Topics

Related Documents

Min max min robust (relative) regret combinatorial optimization

Min-Max Results in Combinatorial Optimization

Min–max and min–max regret versions of combinatorial optimization problems: A survey

Min-Sup-Min Robust Combinatorial Optimization with Few Recourse Solutions

Min-max and robust polynomial optimization