Exact and heuristic methods in combinatorial optimization. A study on the linear ordering and the maximum diversity problem

DOI10.1007/978-3-662-64877-3zbMath1500.90001OpenAlexW4226083512MaRDI QIDQ2122552

Rafael Martí, Gerhard Reinelt

Publication date: 6 April 2022

Published in: Applied Mathematical Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-64877-3

zbMATH Keywords

combinatorial optimizationbranch-and-boundbranch-and-cutlinear ordering problemmaximum diversity problem

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)

Uses Software

• TSPLIB
• ABACUS
• SYMPHONY
• LOLIB
• MDPLIB