most recent 30 from http://www.or-exchange.com 2010-07-31T00:53:01Z http://www.or-exchange.com/feeds/tag/lowerbound http://www.creativecommons.org/licenses/by-nc/2.5/rdf http://www.or-exchange.com/questions/132/how-accurate-is-the-1-tree-lowerbound-for-the-tsp Daniel 2010-01-06T11:50:56Z 2010-06-02T19:04:21Z

<p>I'm having trouble finding an answer to this question:</p> <p>How accurately does a 1-tree reflect the weight of an optimal tour?</p> <p>I know there are lots papers studying the various ways optimise a 1-tree (by trying to find a 1-tree where every node has degree 2) but I'm interested in a simple non-optimised 1-tree.</p> <p>I'm particularly interested in a theoretical justification.</p>

http://www.or-exchange.com/questions/223/good-lower-bounds-for-special-case-of-gap Tallys Yunes 2010-04-16T18:11:45Z 2010-04-16T18:11:45Z

<p>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 for the generic case are also welcome)? Thanks!</p>