TE
科技回声
首页24小时热榜最新最佳问答展示工作
GitHubTwitter
首页

科技回声

基于 Next.js 构建的科技新闻平台,提供全球科技新闻和讨论内容。

GitHubTwitter

首页

首页最新最佳问答展示工作

资源链接

HackerNews API原版 HackerNewsNext.js

© 2025 科技回声. 版权所有。

Using Julia+JuMP to Solve a TSP with Lazy Constraints

52 点作者 idunning超过 11 年前

2 条评论

StefanKarpinski超过 11 年前
This is very cool. Any notion of how the performance compares to real TSP solvers? Presumably they pull all sorts of dirty tricks to be as fast as possible.<p>It also strikes me that this is going to be great for comparing the performance of various solvers without having to rewrite all the code every time since you can use the same code across all backends.
评论 #6918249 未加载
评论 #6918259 未加载
elchief超过 11 年前
SAS might have an issue with the name JuMP when then have a product named JMP, pronounced &quot;jump&quot;.
评论 #6917884 未加载