[algogeeks] CPAIOR 2009: Call for Workshops

My apologies if you receive multiple copies of this message. -- CALL FOR WORKSHOPS CP-AI-OR 2009 Sixth International Conference on Integration of Artificial Intelligence and Operations Re

[algogeeks] Re: Q: TSP with 2-edge cost definition?

Of course it is , because both problems are NP-COMPLETE. But the transformation is non-trivial, it only comes from the definition fo NP-Completeness 2008/12/16 Golabi Doon > > Hello folks, > > I am trying to solve a non-standard TSP problem with no success so > far. I would really appreciate som

[algogeeks] CPAIOR 2009: Call for Papers

My apologies if you receive multiple copies of this message. -- CALL FOR PAPERS CP-AI-OR 2009 Sixth International Conference on Integration of Artificial Intelligence and Operations Rese

[algogeeks] Q: TSP with 2-edge cost definition?

Hello folks, I am trying to solve a non-standard TSP problem with no success so far. I would really appreciate some help/hint on this problem. The problem is a typical TSP problem: Given a complete graph, we want to visit all the nodes and each node exactly once in a way that the cost of travers

[algogeeks] Re: League Scheduling Problem

I dont konw, i expert in C++ and it is easy. But i dont know python, all you need is sorting pairs, and mayby you can use tuples instead of pairs. 2008/12/16 Ross > > I'm a novice python programmer. Would this be a difficult problem to > represent programatically? > > On Dec 11, 6:37 am, "Mirosl