Starting with the description of the Traveling Salesmen Problem formulation as given by van Vyve and Wolsey in the article “Approximate extended formulations”, we investigate the effects of small variations onto the performance of contemporary mixed integer programming solvers. We will show that even minor changes in the formulation of the model can result in performance difference of more than a factor of 1000. As the results show it is not obvious which changes will result in performance improvements and which not
The aim of this article is to perform a computational study to analyze the impact of formulations, a...
Insight problems are problems where the problem solver struggles to find a solution until * aha! * t...
Insight problems are problems where the problem solver struggles to find a solution until * aha! * t...
none2The performance of mixed-integer programming solvers is subject to some unexpected variability ...
It is well-known that the efficiency of mixed integer linear mathematical programming depends on the...
When solving optimization problems, the importance of speed can not be emphasized enough for many or...
Results on human performance on the Traveling Salesman Problem (TSP) from different laboratories sho...
Abstract. Mixed integer programming (MIP) formulations are typically tightened through the use of a ...
Understanding the performance of algorithms for hard optimization problems such as the Travelling Sa...
We investigated the properties of the distribution of human solution times for Traveling Salesperson...
This paper provides a theoretical and computational comparison of alternative mixed integer programm...
We designed a simple computational exercise to compare weak and strong integer programming formulati...
Results on human performance on the Traveling Salesman Problem (TSP) from different laboratories sho...
We investigate the properties of the distribution of human solution times for Traveling Salesperson ...
We consider the problem of partitioning a set of n numbers into m subsets of cardinality [formula om...
The aim of this article is to perform a computational study to analyze the impact of formulations, a...
Insight problems are problems where the problem solver struggles to find a solution until * aha! * t...
Insight problems are problems where the problem solver struggles to find a solution until * aha! * t...
none2The performance of mixed-integer programming solvers is subject to some unexpected variability ...
It is well-known that the efficiency of mixed integer linear mathematical programming depends on the...
When solving optimization problems, the importance of speed can not be emphasized enough for many or...
Results on human performance on the Traveling Salesman Problem (TSP) from different laboratories sho...
Abstract. Mixed integer programming (MIP) formulations are typically tightened through the use of a ...
Understanding the performance of algorithms for hard optimization problems such as the Travelling Sa...
We investigated the properties of the distribution of human solution times for Traveling Salesperson...
This paper provides a theoretical and computational comparison of alternative mixed integer programm...
We designed a simple computational exercise to compare weak and strong integer programming formulati...
Results on human performance on the Traveling Salesman Problem (TSP) from different laboratories sho...
We investigate the properties of the distribution of human solution times for Traveling Salesperson ...
We consider the problem of partitioning a set of n numbers into m subsets of cardinality [formula om...
The aim of this article is to perform a computational study to analyze the impact of formulations, a...
Insight problems are problems where the problem solver struggles to find a solution until * aha! * t...
Insight problems are problems where the problem solver struggles to find a solution until * aha! * t...