The following pages link to Max-AO (Q17172):
Displaying 19 items.
- Permutation codes with specified packing radius (Q356723) (← links)
- Approximation of rank function and its application to the nearest low-rank correlation matrix (Q386463) (← links)
- Indirect unstructured hex-dominant mesh generation using tetrahedra recombination (Q722824) (← links)
- A new table of permutation codes (Q766240) (← links)
- Semidefinite representations for finite varieties (Q868441) (← links)
- Simple ingredients leading to very efficient heuristics for the maximum clique problem (Q1009196) (← links)
- An effective local search for the maximum clique problem (Q1041822) (← links)
- The generalized independent set problem: polyhedral analysis and solution approaches (Q1753398) (← links)
- An efficient method for convex constrained rank minimization problems based on DC programming (Q1793529) (← links)
- An SDP-based approach for computing the stability number of a graph (Q2123126) (← links)
- A new graph parameter related to bounded rank positive semidefinite matrix completions (Q2248754) (← links)
- On the copositive representation of binary and continuous nonconvex quadratic programs (Q2391001) (← links)
- On a continuous approach for the maximum weighted clique problem (Q2392119) (← links)
- A new trust region technique for the maximum weight clique problem (Q2433799) (← links)
- On a polynomial fractional formulation for independence number of a graph (Q2457911) (← links)
- On extracting maximum stable sets in perfect graphs using Lovász's theta function (Q2506178) (← links)
- Quartic formulation of standard quadratic optimization problems (Q2576445) (← links)
- A review on algorithms for maximum clique problems (Q2630214) (← links)
- A global exact penalty for rank-constrained optimization problem and applications (Q2696914) (← links)
