On the computational complexity of combinatorial flexibility problems

DOI10.1080/00207160903315516MaRDI QIDQ3066977zbMATH OpenOpenAlexFDO

Authors V. Leoni, G. Nasini

Publication date 20 January 2011

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207160903315516

zbMATH Keywords

combinatorial problemscomputational complexityflexibility problemsmatroidstest sets

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Combinatorial flexibility problems and their computational complexity
• Recent trends in combinatorial optimization
• scientific article; zbMATH DE number 4149904
• Solving combinatorial problems with combined min-max-min-sum objective and applications
• Flexible-attribute problems

Cites work

• A note on shortest path, assignment, and transportation problems
• Combinatorial flexibility problems and their computational complexity
• scientific article; zbMATH DE number 3643026 (Why is no real title available?)
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1759406 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• The directed subgraph homeomorphism problem

Cited in

(1)

• Combinatorial flexibility problems and their computational complexity

This page was built for publication: On the computational complexity of combinatorial flexibility problems

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