首页> 外文OA文献 >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

【2h】

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

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

页面导航

著录项
引文网络
相似文献
相关主题

著录项

作者
Sampaio Oliveira AH Afonso; Urrutia Sebastián;
展开▼
作者单位

展开▼
年度 2017
总页数
原文格式 PDF
正文语种
中图分类

相似文献

外文文献
中文文献
专利

1. 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期

机译：多堆栈的拾取和交付行销商问题的新配方和分支 - 切割算法
2. A Branch-and-Cut Algorithm for the Pickup and Delivery Traveling Salesman Problem with Multiple Stacks [J] . Jean-Francois Cote, Claudia Archetti, Maria Grazia Speranza, Networks . 2012,第4期

机译：具有多个堆栈的收件和运送旅行商问题的分支剪切算法
3. Formulations and algorithms for the Pickup and Delivery Traveling Salesman Problem with Multiple Stacks [J] . Pereira Armando H., Urrutia Sebastian Computers & operations research . 2018,第MAY期

机译：具有多个堆栈的提货和送货旅行业务员问题的公式和算法
4. The Minimum Connected Dominating Set Problem: Formulation, Valid Inequalities and a Branch-and-Cut Algorithm [C] . Luidi Simonetti, Alexandre Salles da Cunha, Abilio Lucena Network optimization . 2011

机译：最小连通支配集问题：公式，有效不等式和分支剪切算法
5. One commodity pickup and delivery traveling salesman problem and an extension formulations and algorithms. [D] . Luong, Binh Thanh. 2011

机译：一个商品提货和运送旅行推销员问题以及一个扩展公式和算法。
6. Simultaneous Pickup and Delivery Traveling Salesman Problem considering the Express Lockers Using Attention Route Planning Network [O] . Yu Du, Shaochuan Fu, Changxiang Lu, 2021

机译：同时拾取和交付旅行推销员问题考虑使用注意路线规划网络的快速储物柜
7. The Traveling Salesman Problem with Pickup and Delivery: Polyhedral Results and a Branch-and-Cut Algorithm [O] . Irina Dumitrescu, Stefan Ropke, Jean-françois Cordeau, 2010

机译：拾取和交付的旅行商问题：多面体结果和分支切割算法
8. Branch-and-Cut Algorithms for Independent Set Problems: Integrality Gap and An Application to Protein Structure Alignment [R] . Carr, R. D., Lancia, G., Istrail, S. 2000

机译：独立集问题的分支切割算法：完整性差距及其在蛋白质结构比对中的应用

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

著录项

引文网络

相似文献

相关主题

期刊订阅