Multiple asymmetric traveling salesmen problem with and without precedence constraints: performance comparison of alternative formulations (Q337114): Difference between revisions

Latest revision as of 22:47, 12 July 2024

scientific article

Language	Label	Description	Also known as
English	Multiple asymmetric traveling salesmen problem with and without precedence constraints: performance comparison of alternative formulations	scientific article

Statements

instance of

scholarly article

0 references

title

Multiple asymmetric traveling salesmen problem with and without precedence constraints: performance comparison of alternative formulations (English)

0 references

zbMATH Open document ID

1348.90011

0 references

DOI

10.1016/j.cor.2014.05.014

0 references

author

Hanif D. Sherali

0 references

Jason D. Judd

0 references

Pei-Fang (Jennifer) Tsai

0 references

Sarin, Subhash C.

0 references

published in

Computers \& Operations Research

0 references

publication date

10 November 2016

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

multiple asymmetric traveling salesmen problem

0 references

precedence constraints

0 references

sequential ordering problem

0 references

describes a project that uses

TSPLIB

0 references

VRP

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.cor.2014.05.014

0 references

0 references

0 references

A comparative analysis of several asymmetric traveling salesman problem formulations

0 references

Computational Experience with an M-Salesman Traveling Salesman Algorithm

0 references

Note—A Note on “The Formulation of the M-Salesman Traveling Salesman Problem”

0 references

Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations

0 references

Integer linear programming formulations of multiple salesman problems and its variations

0 references

Integer Programming Formulation of Traveling Salesman Problems

0 references

Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints

0 references

The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling

0 references

A classification of formulations for the (time-dependent) traveling salesman problem

0 references

Technical Note—An n-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem

0 references

Improving Discrete Model Representations via Symmetry Considerations

0 references

A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints

0 references

The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints

0 references

A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems

0 references

A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems

0 references

New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints

0 references

A Cutting Planes Algorithm for the m-Salesmen Problem

0 references

Solution of a Large-Scale Traveling-Salesman Problem

0 references

Transformation of Multisalesman Problem to the Standard Traveling Salesman Problem

0 references

Technical Note—An Improved Transformation of the Symmetric Multiple Traveling Salesman Problem

0 references

TSPLIB—A Traveling Salesman Problem Library

0 references

An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems

0 references

Preemptive and nonpreemptive multi-objective programming: Relationships and counterexamples

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:337114

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.cor.2014.05.014
+Normal rank
@@ Property / OpenAlex ID @@
+W2147151422
@@ Property / OpenAlex ID: W2147151422 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4166568
@@ Property / cites work: Q4166568 / rank @@
+Normal rank
@@ Property / cites work @@
+A comparative analysis of several asymmetric traveling salesman problem formulations
+Normal rank
@@ Property / cites work @@
+Computational Experience with an <i>M</i>-Salesman Traveling Salesman Algorithm
+Normal rank
@@ Property / cites work @@
+Note—A Note on “The Formulation of the <i>M</i>-Salesman Traveling Salesman Problem”
+Normal rank
@@ Property / cites work @@
+Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
+Normal rank
@@ Property / cites work @@
+Integer linear programming formulations of multiple salesman problems and its variations
+Normal rank
@@ Property / cites work @@
+Integer Programming Formulation of Traveling Salesman Problems
+Normal rank
@@ Property / cites work @@
+Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
+Normal rank
@@ Property / cites work @@
+The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
+Normal rank
@@ Property / cites work @@
+A classification of formulations for the (time-dependent) traveling salesman problem
+Normal rank
@@ Property / cites work @@
+Technical Note—An <i>n</i>-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+Improving Discrete Model Representations via Symmetry Considerations
+Normal rank
@@ Property / cites work @@
+A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints
+Normal rank
@@ Property / cites work @@
+The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints
+Normal rank
@@ Property / cites work @@
+A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
+Normal rank
@@ Property / cites work @@
+A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
+Normal rank
@@ Property / cites work @@
+New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints
+Normal rank
@@ Property / cites work @@
+A Cutting Planes Algorithm for the m-Salesmen Problem
+Normal rank
@@ Property / cites work @@
+Solution of a Large-Scale Traveling-Salesman Problem
+Normal rank
@@ Property / cites work @@
+Transformation of Multisalesman Problem to the Standard Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+Technical Note—An Improved Transformation of the Symmetric Multiple Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+TSPLIB—A Traveling Salesman Problem Library
@@ Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank @@
+Normal rank
@@ Property / cites work @@
+An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems
+Normal rank
@@ Property / cites work @@
+Preemptive and nonpreemptive multi-objective programming: Relationships and counterexamples
+Normal rank