A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs
Work
Year: 2016
Type: article
Abstract: This work deals with a class of problems under interval data uncertainty, namely interval robust-hard problems, composed of interval data min-max regret generalizations of classical NP-hard combinator... more
Source: Computers & Operations Research
Cites: 70
Cited by: 11
Related to: 10
FWCI: 1.096
Citation percentile (by year/subfield): 81.5
Field: Decision Sciences
Domain: Social Sciences
Open Access status: hybrid
APC paid (est): $3,210