メインコンテンツへスキップ

Can the callback function combine two check mechanism?(TSP subtour elimination + Bender's decomposition)

回答済み

コメント

3件のコメント

  • 正式なコメント
    Simranjit Kaur
    • Gurobi Staff
    This post is more than three years old. Some information may not be up to date. For current information, please check the Gurobi Documentation or Knowledge Base. If you need more help, please create a new post in the community forum, or try Gurobot, our chatbot interface offering instant, expert-level support.
  • Jacob Jin
    • Gurobi-versary
    • Curious
    • Collaborator

    I have verified that all the lazy constraints' formulations are correct。。。

    0
  • Jaromił Najman
    • Gurobi Staff

    Hi Jacob,

    Could you briefly explain what is \(\texttt{N}\) in your code snippet?

    The case \(\texttt{len(tour) == N}\) cannot be reached because it always lands in \(\texttt{len(tour) < N+1}\).

    Best regards, 
    Jaromił

    0

投稿コメントは受け付けていません。