I'm having trouble finding an answer to this question: How accurately does a 1-tree reflect the weight of an optimal tour? I know there are lots papers studying the various ways …

Does anyone know of good lower bounds for a special case of the Generalized Assignment Problem (GAP) when all knapsack constraints have the same right-hand side? (good lower bounds …