对“带时间窗的路由问题的取消的Miller-Tucker-Zemlin子路线消去约束的注释”一文中公式的评注

IF 0.9 4区数学 Q3 MATHEMATICS, APPLIED

Discrete Optimization Pub Date : 2025-04-02 DOI:10.1016/j.disopt.2025.100888

İmdat Kara, Gözde Önder Uzun

引用次数: 0

摘要

在本文中，我们证明了最近一篇论文[1]给出的带时间窗旅行推销员问题（TSPTW）的公式可能无法找到最优解，然后我们建议在模型中添加一个新的约束。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A remark on the formulation given in “A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for routing problems with time windows”

In this paper, we show that, the formulation given in a recent paper [1] for the travelling salesman problem with time windows (TSPTW), may not find the optimal solution and then we recommend to add a new constraint to the model.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Discrete Optimization 管理科学-应用数学

CiteScore

2.10

自引率

9.10%

发文量

审稿时长

>12 weeks

期刊介绍： Discrete Optimization publishes research papers on the mathematical, computational and applied aspects of all areas of integer programming and combinatorial optimization. In addition to reports on mathematical results pertinent to discrete optimization, the journal welcomes submissions on algorithmic developments, computational experiments, and novel applications (in particular, large-scale and real-time applications). The journal also publishes clearly labelled surveys, reviews, short notes, and open problems. Manuscripts submitted for possible publication to Discrete Optimization should report on original research, should not have been previously published, and should not be under consideration for publication by any other journal.