.png){kind=icon}
返回
Teaching integer programming formulations using the traveling salesman problem
.png){kind=icon}
OA
AI
DOI：10.1137/S00361445023685.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We designed a simple computational exercise to compare weak and strong integer programming formulations of the traveling salesman problem. Using commercial IP software. and a short (60 line long) MATLAB code, students can optimally solve instances with lip to 70 cities in a few minutes by adding cuts from the stronger formulation to the weaker, but simpler one.
Keyword:
integer programming
traveling salesman problem
subtour elimination constraints
cutting planes
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.1
论文数:
888
被引数:
1.2W
机构
暂无机构信息
引用论文
.png){kind=icon}
Induction and elimination of bulky benzo[a]pyrene-related DNA adducts and 8-oxodGuo in mussels Mytilus galloprovincialis exposed in vivo to B[a]P-contaminated feed体内暴露于B[a]P污染的饲料中的贻贝Mytilus galloprovincialis中庞大的苯并 [a] re相关DNA加合物和8-氧代果的诱导和消除
OAAI
OAAI分享收藏