scientific article; zbMATH DE number 1178278

MaRDI QIDQ4398725zbMATH OpenFDO

Authors Thomas Christof

Publication date 22 July 1998

zbMATH Keywords

combinatorial optimizationDNA sequencingfacet-enumerationlifting techniqueslow-dimensional polytopesmax-cut problemparallel branch-and-cut procedurephysical mappingtravelling salesmanweighted betweenness problem

Mathematics Subject Classification ID

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

Recommendations

• Combinatorial optimization and small polytopes
• DECOMPOSITION AND PARALLELIZATION TECHNIQUES FOR ENUMERATING THE FACETS OF COMBINATORIAL POLYTOPES
• Algorithmic aspects of using small instance relaxations in parallel branch-and-cut
• Polyhedral techniques in combinatorial optimization II: applications and computations

Cited in

(7)

• Introduction to ABACUS -- a branch-and-cut system
• Combinatorial optimization and small polytopes
• Upper bounds on the maximal number of facets of 0/1-polytopes
• A benchmark library and a comparison of heuristic methods for the linear ordering problem
• Exact Facetial Odd-Cycle Separation for Maximum Cut and Binary Quadratic Optimization
• Algorithmic aspects of using small instance relaxations in parallel branch-and-cut
• PANDA: a software for polyhedral transformations

Describes a project that uses

Uses Software

• PORTA

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4398725)