Pages that link to "Item:Q5925162"
From MaRDI portal
The following pages link to Semidefinite relaxations for partitioning, assignment and ordering problems (Q5925162):
Displaying 10 items.
- Semidefinite relaxations of ordering problems (Q359627) (← links)
- Semidefinite programming for discrete optimization and matrix completion problems (Q697582) (← links)
- Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems (Q1978696) (← links)
- A new approximation algorithm for unrelated parallel machine scheduling with release dates (Q2289003) (← links)
- Tight Approximation Bounds for the Seminar Assignment Problem (Q2971167) (← links)
- (Q3620678) (← links)
- (Q4737533) (← links)
- The Maximum <i>k</i>-Colorable Subgraph Problem and Related Problems (Q5084675) (← links)
- On solving the densest<i>k</i>-subgraph problem on large graphs (Q5859000) (← links)
- Semidefinite relaxations for partitioning, assignment and ordering problems (Q5917881) (← links)