Teaching Integer Programming Formulations Using the Traveling Salesman Problem

DOI10.1137/S00361445023685zbMath1040.90024MaRDI QIDQ4426333

Gábor Pataki

Publication date: 16 September 2003

Published in: SIAM Review (Search for Journal in Brave)

zbMATH Keywords

integer programmingtraveling salesman problemcutting planessubtour elimination constraints

Mathematics Subject Classification ID

Integer programming (90C10) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Mathematics teaching methods and classroom techniques (97D40)

Related Items (5)

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 ⋮ Short combinatorial proof that the DFJ polytope is contained in the MTZ polytope for the asymmetric traveling salesman problem ⋮ Combinação de abordagens GLSP e ATSP para o problema de dimensionamento e sequenciamento de lotes de produção de suplementos para nutrição animal ⋮ A combinatorial approach to the design of vaccines

Uses Software

• Matlab

This page was built for publication: Teaching Integer Programming Formulations Using the Traveling Salesman Problem