Pages that link to "Item:Q5917881"
From MaRDI portal
The following pages link to Semidefinite relaxations for partitioning, assignment and ordering problems (Q5917881):
Displaying 17 items.
- Semidefinite relaxations of ordering problems (Q359627) (← links)
- Semidefinite programming for discrete optimization and matrix completion problems (Q697582) (← links)
- New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph (Q896848) (← links)
- Surveys in operations research (Q1730527) (← links)
- A two-level graph partitioning problem arising in mobile wireless communications (Q1744904) (← links)
- Projection results for the \(k\)-partition problem (Q1751250) (← links)
- A MAX-CUT formulation of 0/1 programs (Q1785732) (← links)
- Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems (Q1978696) (← links)
- An exact approach for the multi-constraint graph partitioning problem (Q2219514) (← links)
- Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints (Q2287849) (← links)
- A mathematical programming formulation for the Hartree-Fock problem on open-shell systems (Q2414124) (← links)
- An evaluation of semidefinite programming based approaches for discrete lot-sizing problems (Q2514881) (← links)
- Twelve surveys in operations research (Q2630815) (← links)
- Tight Approximation Bounds for the Seminar Assignment Problem (Q2971167) (← links)
- A guide to conic optimisation and its applications (Q4634309) (← links)
- (Q4737533) (← links)
- Semidefinite relaxations for partitioning, assignment and ordering problems (Q5925162) (← links)
