scientific article; zbMATH DE number 1178278

zbMath0911.90280MaRDI QIDQ4398725

Thomas Christof

Publication date: 22 July 1998

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

combinatorial optimizationtravelling salesmanmax-cut problemDNA sequencinglifting techniquesfacet-enumerationphysical mappinglow-dimensional polytopesparallel branch-and-cut procedureweighted betweenness problem

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Combinatorial optimization (90C27) Protein sequences, DNA sequences (92D20) Boolean programming (90C09) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items

Exact Facetial Odd-Cycle Separation for Maximum Cut and Binary Quadratic Optimization, PANDA: a software for polyhedral transformations, A benchmark library and a comparison of heuristic methods for the linear ordering problem, Upper bounds on the maximal number of facets of 0/1-polytopes, Introduction to ABACUS -- a branch-and-cut system

Uses Software

• PORTA