Algorithmic aspects of using small instance relaxations in parallel branch-and-cut
From MaRDI portal
Publication:5940609
DOI10.1007/s00453-001-0029-3zbMath0973.90064MaRDI QIDQ5940609
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
Related Items
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, Local cuts revisited, A survey on the linear ordering problem for weighted or unweighted tournaments, A branch-and-cut algorithm for a resource-constrained scheduling problem
Uses Software