Teaching Integer Programming Formulations Using the Traveling Salesman Problem
From MaRDI portal
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Integer programming (90C10) Mixed integer programming (90C11) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Mathematics teaching methods and classroom techniques (97D40)
Recommendations
- A Survey of Different Integer Programming Formulations of the Travelling Salesman Problem
- scientific article; zbMATH DE number 1312984
- The traveling salesman problem: a linear programming formulation
- Formulations and Reformulations in Integer Programming
- Models for Solving the Travelling Salesman Problem
Cited in
(8)- Short combinatorial proof that the DFJ polytope is contained in the MTZ polytope for the asymmetric traveling salesman problem
- Classification and comparison of integer programming formulations for the single-machine sequencing problem
- Combining GLSP and ATSP approaches to lot sizing and sequencing in the production of animal feed supplements
- A Survey of Different Integer Programming Formulations of the Travelling Salesman Problem
- A combinatorial approach to the design of vaccines
- A matheuristic for tactical locomotive and driver scheduling for the swiss national railway company SBB Cargo AG
- Data transfer planning with tree placement for collaborative environments
- Local-MIP: efficient local search for mixed integer programming
This page was built for publication: Teaching Integer Programming Formulations Using the Traveling Salesman Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4426333)
