Pages that link to "Item:Q2669795"

The following pages link to New formulations and branch-and-cut procedures for the longest induced path problem (Q2669795):

Displaying 3 items.

• MIP formulations for induced graph optimization problems: a tutorial (Q6056886) (← links)
• The minimum quasi-clique partitioning problem: complexity, formulations, and a computational study (Q6125237) (← links)
• Integer programming formulations for the \(k\)-in-a-tree problem in graphs (Q6495390) (← links)