scientific article; zbMATH DE number 1178278

From MaRDI portal

Revision as of 01:44, 7 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4398725

Jump to:navigation, search

zbMath0911.90280MaRDI QIDQ4398725

Thomas Christof

Publication date: 22 July 1998

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

zbMATH Keywords

combinatorial optimization travelling salesman max-cut problem DNA sequencing lifting techniques facet-enumeration physical mapping low-dimensional polytopes parallel branch-and-cut procedure weighted 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 (5)

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

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4398725&oldid=18420584"