Pages that link to "Item:Q2010923"

The following pages link to A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints (Q2010923):

Displayed 1 item.

• A branch-and-price algorithm for the minimum sum coloring problem (Q1983110) ‎ (← links)