Product
Help
Pricing
About
Jobs
Log in
Get started
Work
Add to collection
Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty
HTML
Details
Locations
Year:
2019
Type:
article
Source:
European Journal of Operational Research
DOI:
10.1016/j.ejor.2019.05.045
Authors:
André Chassein,
Marc Goerigk,
Jannis Kurtz,
Michael Poss
Institutions:
Deutsche Post (Germany),
University of Siegen,
RWTH Aachen University,
Centre National de la Recherche Scientifique,
Université de Montpellier,
Laboratoire d'Informatique, de Robotique et de Microélectronique de Montpellier
show all 6
Language:
English
Topic:
Risk and Portfolio Optimization
Subfield:
Management Science and Operations Research
Field:
Decision Sciences
Domain:
Social Sciences
Open Access status:
bronze
Funder:
Fondation Mathématique Jacques Hadamard
OpenAlex ID:
W2901613311
FWCI:
1.424
Cites:
32
Cited by:
18
Related to:
20