Extended Formulations and Branch-and-Cut Algorithms for the Black-and-White Traveling Salesman Problem (vol 262, pg 908, 2017)

首页> 外文期刊>European Journal of Operational Research >Extended Formulations and Branch-and-Cut Algorithms for the Black-and-White Traveling Salesman Problem (vol 262, pg 908, 2017)

【24h】

Extended Formulations and Branch-and-Cut Algorithms for the Black-and-White Traveling Salesman Problem (vol 262, pg 908, 2017)

机译：用于黑白旅行推销员问题的扩展配方和分支和切割算法（Vol 262，PG 908,2017）

获取原文

获取原文并翻译 | 示例

获取外文期刊封面封底 >>

开具论文收录证明 >>

文献代查 >>

页面导航

著录项
相似文献
相关主题

著录项

来源
《European Journal of Operational Research》 |2020年第3期|共5页
作者

展开▼
作者单位

展开▼
收录信息
原文格式 PDF
正文语种 eng
中图分类运筹学;
关键词

相似文献

外文文献
中文文献
专利

1. 基因多效性人口增量学习算法及其在旅行推销员问题中的应用 [J] . 蔚承建, 何振亚, 张毅锋, 东南大学学报（英文版） . 2000,第002期
2. Extended Formulations and Branch-and-Cut Algorithms for the Black-and-White Traveling Salesman Problem (vol 262, pg 908, 2017) [J] . European Journal of Operational Research . 2020,第3期

机译：用于黑白旅行推销员问题的扩展配方和分支和切割算法（Vol 262，PG 908,2017）
3. Extended formulations and branch-and-cut algorithms for the Black-and-White Traveling Salesman Problem [J] . Luis Gouveia, Markus Leitner, Mario Ruthmair European Journal of Operational Research . 2017,第3期

机译：用于黑白旅行推销员问题的扩展配方和分支和切割算法
4. New formulation and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks [J] . Sampaio Afonso H., Urrutia Sebastian International transactions in operational research: A journal of The International Federation of Operational Research Societies . 2017,第1a2期

机译：多堆栈的拾取和交付行销商问题的新配方和分支 - 切割算法
5. Quantitative evaluation of iterative extended changing crossover operators to solve the traveling salesman problem: Diversity measurement and its application to selection strategies in genetic algorithms [C] . Takahashi R. International Conference on Natural Computation . 2014

机译：求解旅行商问题的迭代扩展变分交叉算子的定量评估：多样性测量及其在遗传算法选择策略中的应用
6. One commodity pickup and delivery traveling salesman problem and an extension formulations and algorithms. [D] . Luong, Binh Thanh. 2011

机译：一个商品提货和运送旅行推销员问题以及一个扩展公式和算法。
7. Genetic Algorithm for Traveling Salesman Problem with Modified Cycle Crossover Operator [O] . Abid Hussain, Yousaf Shad Muhammad, M. Nauman Sajid, 2017

机译：修正周期交叉算子的旅行商问题的遗传算法
8. New formulation and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks: new formulation and branch-and-cut algorithm [O] . Sampaio Oliveira AH Afonso, Urrutia Sebastián 2017

机译：具有多个堆栈的取货和送货旅行推销员问题的新公式和分支切割算法：新公式和分支切割算法

Extended Formulations and Branch-and-Cut Algorithms for the Black-and-White Traveling Salesman Problem (vol 262, pg 908, 2017)

著录项

相似文献

相关主题

期刊订阅