We designed a simple computational exercise to compare weak and strong integer programming formulations of the traveling salesman problem. Using commercial IP software, and a short (60 line long) Matlab code, students can optimally solve instances with up to 70 cities in a few minutes by adding cuts from the stronger formulation to the weaker, but simpler one
This paper presents a Mixed Integer Program to solve the Balanced TSP. It exploits the underlying st...
none2This paper surveys the most effective mathematical models and exact algorithms proposed for fin...
Two experiments on performance on the traveling salesman problem (TSP) are reported. The TSP consist...
Abstract. We designed a simple computational exercise to compare weak and strong integer programming...
We designed a simple computational exercise to compare weak and strong integer programming formulati...
We describe and survey Integer-Programming approaches for solving the classical Traveling Salesman P...
The traveling salesman problem (TSP) is one of the NP-hard problems in combinatorial optimization. T...
A formulation of the traveling salesman problem with more than one salesman is offered. The particul...
The paper explains shortly the famous Traveling Salesman Problem, develops GUI hfATLAB-program for i...
This book presents the latest findings on one of the most intensely investigated subjects in computa...
This article introduces one more specific solution of the travelling salesman problem. The seller ha...
The purpose of this thesis is to give an overview of the history of the Traveling Salesman Problem a...
A traveling salesman problem (TSP) is a problem whereby the salesman starts from an origin node and ...
A traveling salesman problem (TSP) is a problem whereby the salesman starts from an origin node and ...
This paper presents a self-contained introduction into algorithmic and computational aspects of the ...
This paper presents a Mixed Integer Program to solve the Balanced TSP. It exploits the underlying st...
none2This paper surveys the most effective mathematical models and exact algorithms proposed for fin...
Two experiments on performance on the traveling salesman problem (TSP) are reported. The TSP consist...
Abstract. We designed a simple computational exercise to compare weak and strong integer programming...
We designed a simple computational exercise to compare weak and strong integer programming formulati...
We describe and survey Integer-Programming approaches for solving the classical Traveling Salesman P...
The traveling salesman problem (TSP) is one of the NP-hard problems in combinatorial optimization. T...
A formulation of the traveling salesman problem with more than one salesman is offered. The particul...
The paper explains shortly the famous Traveling Salesman Problem, develops GUI hfATLAB-program for i...
This book presents the latest findings on one of the most intensely investigated subjects in computa...
This article introduces one more specific solution of the travelling salesman problem. The seller ha...
The purpose of this thesis is to give an overview of the history of the Traveling Salesman Problem a...
A traveling salesman problem (TSP) is a problem whereby the salesman starts from an origin node and ...
A traveling salesman problem (TSP) is a problem whereby the salesman starts from an origin node and ...
This paper presents a self-contained introduction into algorithmic and computational aspects of the ...
This paper presents a Mixed Integer Program to solve the Balanced TSP. It exploits the underlying st...
none2This paper surveys the most effective mathematical models and exact algorithms proposed for fin...
Two experiments on performance on the traveling salesman problem (TSP) are reported. The TSP consist...
DOI
Add to ORKG