Pages that link to "Item:Q2028800"

The following pages link to Compact formulations and an iterated local search-based matheuristic for the minimum weighted feedback vertex set problem (Q2028800):

Displaying 9 items.

• A matheuristic approach for the \(b\)-coloring problem using integer programming and a multi-start multi-greedy randomized metaheuristic (Q2239844) (← links)
• An improved configuration checking-based algorithm for the unicost set covering problem (Q2239985) (← links)
• New formulations and branch-and-cut procedures for the longest induced path problem (Q2669795) (← links)
• Decycling bipartite graphs (Q5084689) (← links)
• MIP formulations for induced graph optimization problems: a tutorial (Q6056886) (← links)
• Maximum weighted induced forests and trees: new formulations and a computational comparative review (Q6071056) (← links)
• Reconciling business analytics with graphically initialized subspace clustering for optimal nonlinear pricing (Q6087510) (← 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)