162
click to vote
CPAIOR
2007
Springer
16 years 23 hour ago
2007
Springer
We study the complexity of combinatorial problems that consist of competing infeasibility and optimization components. In particular, we investigate the complexity of the connectio...