Complexity results for a class of min-max problems with robust optimization applications

MaRDI QIDQ2743982zbMATH OpenFDO

Authors Gang Yu, Panagiotis Kouvelis

Publication date 18 September 2001

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)

Cited in

(5)

• Min-max optimization of several classical discrete optimization problems
• A genetic algorithm of determining cycle time for printed circuit board assembly lines
• Relocation problems arising in conservation biology
• Risk-averse single machine scheduling: complexity and approximation
• Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion

This page was built for publication: Complexity results for a class of min-max problems with robust optimization applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2743982)