Combinatorial flexibility problems and their computational complexity

DOI10.1016/J.ENDM.2008.01.052MaRDI QIDQ3503571zbMATH OpenOpenAlexFDO

Authors Néstor E. Aguilera, V. Leoni, G. 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

combinatorial problemscomputational complexityflexibility

Mathematics Subject Classification ID

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

Recommendations

• On the computational complexity of combinatorial flexibility problems
• Combinatorics and flexure
• scientific article; zbMATH DE number 6832021
• Flexibility and complexity in periodic distribution problems
• Combinatorial Optimization Problems with Soft and Hard Requirements
• scientific article; zbMATH DE number 3121707
• Combinatorial \(n\)-fold integer programming and applications
• Combinatorial \(n\)-fold integer programming and applications
• NP-completeness of a combinator optimization problem
• Cardinality constrained combinatorial optimization: complexity and polyhedra

Cited in

(2)

• On the computational complexity of combinatorial flexibility problems
• Flexible-attribute problems

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

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