A characterization of linear admissible transformations for the m-travelling salesmen problem-Reference-Cited by-同舟云学术

A characterization of linear admissible transformations for the m-travelling salesmen problem

Published:1979-05 Issue:3 Volume:3 Page:232-238
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Berenguer Xavier

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference5 articles.

1. Scheduling of vehicles from a central depot to a number of delivery points;Clarke;Operations Res.,1963

2. Bases for vehicle fleet scheduling;Gaskell;Operations Res. Quart.,1967

3. An algorithm for the travelling salesman problem;Little;Operations Res.,1963

4. Computers in vehicle scheduling;National Computer Center,1969

5. La régularisation dans les problèmes combinatoires et son application dans les problèmes de tournées;Vo-Khac;Rev. Française Automat. Informat. Recherche Opérationelle,1971

Cited by 22 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Stability Analysis for the Modification Method Under the a Priori Strategy of the PTSP;IEEE Access;2020

2. Representations of quadratic combinatorial optimization problems: A case study using quadratic set covering and quadratic knapsack problems;Computers & Operations Research;2019-12

3. Combinatorial optimization with interaction costs: Complexity and solvable cases;Discrete Optimization;2019-08

4. The bilinear assignment problem: complexity and polynomially solvable special cases;Mathematical Programming;2017-01-19

5. The constant objective value property for multidimensional assignment problems;Discrete Optimization;2016-02