Algorithms for the Travelling Salesman Problem
Project: Research
Description
| Acronym | TSP |
|---|---|
| Status | Active |
| Effective start/end date | 1/01/99 → … |
- Letchford, Adam (Principal Investigator)
- Caprara, Alberto (Researcher)
- Fischetti, Matteo (Researcher)
- Fleischer, Lisa (Researcher)
- Lodi, Andrea (Researcher)
- Dehghan Nasiri, Saeideh (PhD Student)
- Pearson, Nicholas (PhD Student)
Activities
The Travelling Salesman Problem
Activity: Talk or presentation types › Invited talk
Algorithms for planar graphs
Activity: Talk or presentation types › Invited talk
Planar graphs and the traveling salesman problem
Activity: Talk or presentation types › Invited talk
The traveling salesman problem: inequalities and separation
Activity: Talk or presentation types › Invited talk
The traveling salesman problem: inequalities and separation
Activity: Talk or presentation types › Invited talk
The traveling salesman problem: inequalities and separation
Activity: Talk or presentation types › Invited talk
On traveling salesman games
Activity: Talk or presentation types › Invited talk
The traveling salesman problem: inequalities and separation
Activity: Talk or presentation types › Invited talk
Oberwolfach Workshop on Combinatorial Optimisation
Activity: Participating in or organising an event types › Participation in conference - Academic
The polyhedral approach to the TSP
Activity: Talk or presentation types › Invited talk
7th Conference on Integer Programming and Combinatorial Optimization (IPCO VII)
Activity: Participating in or organising an event types › Participation in conference - Academic
17th International Symposium on Mathematical Programming (ISMP)
Activity: Participating in or organising an event types › Participation in conference - Academic
6th Aussois Workshop on Combinatorial Optimisation
Activity: Participating in or organising an event types › Participation in conference - Academic
9th Conference in Integer Programming and Combinatorial Optimization (IPCO IX)
Activity: Participating in or organising an event types › Participation in conference - Academic
Integer Programming Conference in Honor of Egon Balas
Activity: Participating in or organising an event types › Participation in conference - Academic
13th Combinatorial Optimisation Conference (CO2004)
Activity: Participating in or organising an event types › Participation in conference - Academic
Bertinoro Workshop on Combinatorial Optimisation
Activity: Participating in or organising an event types › Participation in conference - Academic
21st European Conference on Operational Research (EURO XXI)
Activity: Participating in or organising an event types › Participation in conference - Academic
1st Student Conference on Operational Research
Activity: Participating in or organising an event types › Participation in conference - Academic
Research outputs
Computing good allocations for combinatorial optimization games
Research output: Working paper
Polynomial-time separation of simple comb inequalities
Research output: Working paper
The compatible tour heuristic for the symmetric traveling salesman problem
Research output: Working paper
Compact formulations of the Steiner traveling salesman problem and related problems
Research output: Contribution to Journal/Magazine › Journal article › peer-review
Computing compatible tours for the traveling salesman problem
Research output: Contribution to Journal/Magazine › Journal article › peer-review
Exploiting planarity in separation routines for the symmetric travelling salesman problem
Research output: Contribution to Journal/Magazine › Journal article › peer-review
Good triangulations yield good tours
Research output: Contribution to Journal/Magazine › Journal article › peer-review
New techniques for cost sharing in combinatorial optimization games
Research output: Contribution to Journal/Magazine › Journal article › peer-review
Odd minimum cut-sets and b-matchings revisited
Research output: Contribution to Journal/Magazine › Journal article › peer-review
On disjunctive cuts for combinatorial optimization
Research output: Contribution to Journal/Magazine › Journal article › peer-review
On the separation of maximally violated mod-k cuts
Research output: Contribution to Journal/Magazine › Journal article › peer-review
On the separation of split cuts and related inequalities
Research output: Contribution to Journal/Magazine › Journal article › peer-review
Polynomial-time separation of a superclass of simple comb inequalities
Research output: Contribution to Journal/Magazine › Journal article › peer-review
Primal separation algorithms
Research output: Contribution to Journal/Magazine › Journal article › peer-review
Separating a superclass of comb inequalities in planar graphs
Research output: Contribution to Journal/Magazine › Journal article › peer-review
The Steiner travelling salesman problem with correlated costs
Research output: Contribution to Journal/Magazine › Journal article › peer-review
Mathematical programming approaches to the traveling salesman problem
Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Entry for encyclopedia/dictionary
A faster exact separation algorithm for blossom inequalities
Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Chapter (peer-reviewed)
On the separation of maximally violated mod-k cuts
Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Chapter (peer-reviewed) › peer-review
Polynomial-time separation of simple comb inequalities
Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Chapter (peer-reviewed) › peer-review
Binary clutter inequalities for integer programs
Research output: Contribution to Journal/Magazine › Journal article › peer-review
A fast algorithm for minimum weight odd cuts and circuits in planar graphs
Research output: Contribution to Journal/Magazine › Journal article › peer-review