Combinatorial flexibility problems and their computational complexity

DOI10.1016/j.endm.2008.01.052zbMath1341.90104OpenAlexW2067001872MaRDI QIDQ3503571

Néstor E. Aguilera, V. Leoni, Graciela L. Nasini

Publication date: 5 June 2008

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2008.01.052

zbMATH Keywords

computational complexitycombinatorial problemsflexibility

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

On the computational complexity of combinatorial flexibility problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Combinatorial flexibility problems and their computational complexity