Pages that link to "Item:Q5940609"
From MaRDI portal
The following pages link to Algorithmic aspects of using small instance relaxations in parallel branch-and-cut (Q5940609):
Displayed 5 items.
- An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
- Local cuts revisited (Q1003489) (← links)
- A survey on the linear ordering problem for weighted or unweighted tournaments (Q2644372) (← links)
- A branch-and-cut algorithm for a resource-constrained scheduling problem (Q3004200) (← links)
- A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems (Q6160119) (← links)