Pages that link to "Item:Q1854428"
From MaRDI portal
The following pages link to On weighted vs unweighted versions of combinatorial optimization problems (Q1854428):
Displayed 8 items.
- Computational results of a semidefinite branch-and-bound algorithm for \(k\)-cluster (Q342176) (← links)
- Quell (Q500997) (← links)
- On approximability of linear ordering and related NP-optimization problems on graphs. (Q1427183) (← links)
- On regularity of Max-CSPs and Min-CSPs (Q2122790) (← links)
- On Khot’s unique games conjecture (Q3109809) (← links)
- On percolation and ‐hardness (Q4633317) (← links)
- (Q5077145) (← links)
- Introduction to the Maximum Solution Problem (Q5504706) (← links)