Algorithmic aspects of using small instance relaxations in parallel branch-and-cut

DOI10.1007/S00453-001-0029-3MaRDI QIDQ5940609zbMATH OpenOpenAlexFDO

Authors Thomas Christof, Gerhard Reinelt

Publication date 9 August 2001

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-001-0029-3

zbMATH Keywords

branch-and-cutcombinatorial optimizationpolyhedra

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Combinatorial optimization and small polytopes
• scientific article; zbMATH DE number 1225029
• scientific article; zbMATH DE number 2159169
• scientific article; zbMATH DE number 1178278
• Orbitopal Fixing

Cited in

(7)

• Local cuts revisited
• Combinatorial optimization and small polytopes
• A survey on the linear ordering problem for weighted or unweighted tournaments
• A branch-and-cut algorithm for a resource-constrained scheduling problem
• scientific article; zbMATH DE number 1178278 (Why is no real title available?)
• A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems
• An updated survey on the linear ordering problem for weighted or unweighted tournaments

Describes a project that uses

Uses Software

• MINTO
• PORTA
• LOLIB
• ABACUS

This page was built for publication: Algorithmic aspects of using small instance relaxations in parallel branch-and-cut

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