Upgrading edges in the graphical TSP

Cites Work

On an exact method for the constrained shortest path problem
A branch-and-cut algorithm for the maximum benefit Chinese postman problem
On the graphical relaxation of the symmetric traveling salesman polytope
A cutting plane procedure for the travelling salesman problem on road networks
On the cycle polytope of a binary matroid
The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities
Modifying edges of a network to obtain short subgraphs
A branch-and-cut algorithm for the undirected rural postman problem
On the flow cost lowering problem
Upgrading nodes in tree-shaped hub location
Lagrangian and branch-and-cut approaches for upgrading spanning tree problems
Upgrading the 1-center problem with edge length variables on a tree
Upgrading min-max spanning tree problem under various cost functions
The graphical relaxation: A new framework for the symmetric traveling salesman polytope
Improving spanning trees by upgrading nodes
Maximum shortest path interdiction problem by upgrading edges on trees under weighted \(l_1\) norm
Solving the length constrained \(K\)-drones rural postman problem
Optimal approaches for upgrading selective obnoxious \(p\)-median location problems on tree networks
Upgrading edges in the maximal covering location problem
Upgrading Shortest Paths in Networks
Shortest-path algorithms: Taxonomy and annotation
The traveling salesman problem on a graph and some related integer polyhedra
A dual algorithm for the constrained shortest path problem
Maximizing the minimum source-sink path subject to a budget constraint
Edge Weight Reduction Problems in Directed Acyclic Graphs
Network upgrading problems
Increasing the Weight of Minimum Spanning Trees
The Symmetric Traveling Salesman Polytope: New Facets from the Graphical Relaxation
Upgrading arcs to minimize the maximum travel time in a network
A new integer programming formulation of the graphical traveling salesman problem

This page was built for publication: Upgrading edges in the graphical TSP