All Stories

  1. On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs
  2. Preface: Quadratic combinatorial optimization problems
  3. Mathematical Programming Models and Exact Algorithms
  4. On Solving the Quadratic Shortest Path Problem
  5. On solving the densest k-subgraph problem on large graphs
  6. Special cases of the quadratic shortest path problem
  7. The min-cut and vertex separator problem
  8. Graph bisection revisited
  9. A New Semidefinite Programming Relaxation for the Quadratic Assignment Problem and Its Computational Perspectives
  10. On Bounding the Bandwidth of Graphs with Symmetry
  11. Semidefinite programming and eigenvalue bounds for the graph partition problem
  12. An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem
  13. A polynomial optimization approach to constant rebalanced portfolio selection
  14. Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry
  15. A Polynomial Optimization Approach to Constant Rebalanced Portfolio Selection
  16. An Aggregated Optimization Model for Multi-Head SMD Placements
  17. Mini-Workshop: Exploiting Symmetry in Optimization
  18. Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
  19. Exploiting group symmetry in truss topology optimization
  20. On Semidefinite Programming Relaxations of the Traveling Salesman Problem
  21. Exploiting Group Symmetry in Semidefinite Programming Relaxations of the Quadratic Assignment Problem
  22. Exploiting Group Symmetry in Truss Topology Optimization
  23. Bounds for the quadratic assignment problem using the bundle method
  24. On self-regular IPMs