traveling salesman - How to add additional constraints to Concorde TSP solver -


i trying solve modified version of traveling salesmen problem. modification of basic tsp nodes have color property , optimal path cannot touch more 4 nodes of same color sequentially. run in connected graph of no more 100 nodes. trying run using concorde.

does know how add color constraint concorde run?

thanks

i don't think concorde set add arbitrary constraints. solver highly customized classical tsp , can't accommodate new constraints that. way if can figure out way convert problem classical tsp changing data (not constraints), i.e., coming trick set cost matrix optimal solutions satisfy color constraint, can't see way that, off hand.


Comments

Popular posts from this blog

php - failed to open stream: HTTP request failed! HTTP/1.0 400 Bad Request -

java - How to filter a backspace keyboard input -

java - Show Soft Keyboard when EditText Appears -