A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem
type: Item
instance of: scholarly article
title: A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem
zbMATH Open document ID: 1374.90044
author: Peng Zhang
published in: European Journal of Operational Research
publication date: 2017-11-23T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6811849
zbMATH Keywords: travelling salesman
zbMATH Keywords: node current
zbMATH Keywords: integer programming
zbMATH Keywords: fixed-destination problem
Wikidata QID: Q107155169
describes a project that uses: LKH
describes a project that uses: VRP
describes a project that uses: TSPLIB
describes a project that uses: Concorde
MaRDI profile type: Publication
full work available at URL: j.ejor.2017.07.056
OpenAlex ID: W2740867407
cites work: Q3425132
cites work: Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
cites work: Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing
cites work: A Branch-and-Cut method for the Capacitated Location-Routing Problem
cites work: Multi-depot multiple TSP: a polyhedral study and computational results
cites work: Partitioning procedures for solving mixed-variables programming problems
cites work: A New Formulation for the Travelling Salesman Problem
cites work: The exact solution of several classes of inventory-routing problems
cites work: A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
cites work: In Pursuit of the Traveling Salesman
cites work: Solution of a Large-Scale Traveling-Salesman Problem
cites work: Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
cites work: The hybrid electric vehicle-traveling salesman problem
cites work: Q3475129
cites work: Technical Note—An n-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem
cites work: Q3508462
cites work: An effective implementation of the Lin-Kernighan traveling salesman heuristic
cites work: Optimisation of maintenance routing and scheduling for offshore wind farms
cites work: Integer linear programming formulations of multiple salesman problems and its variations
cites work: Classification of travelling salesman problem formulations
cites work: The traveling salesman problem: An overview of exact and approximate algorithms
cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
cites work: Integer Programming Formulation of Traveling Salesman Problems
cites work: A comparative analysis of several asymmetric traveling salesman problem formulations
cites work: A Survey of Different Integer Programming Formulations of the Travelling Salesman Problem
cites work: An analytical comparison of different formulations of the travelling salesman problem
cites work: Q3583114
cites work: Mixed integer linear programming model for multi-commodity multi-depot inventory routing problem
cites work: TSPLIB—A Traveling Salesman Problem Library
cites work: The General Pickup and Delivery Problem
cites work: Generalized multiple depot traveling salesmen problem -- polyhedral study and exact algorithm
cites work: Models, relaxations and exact approaches for the capacitated vehicle routing problem
cites work: The vehicle routing problem
DOI: 10.1016/J.EJOR.2017.07.056
description: scientific article; zbMATH DE number 6811849