Improved bounds for the crossing numbers of Km,n and Kn
Author
Abstract
Suggested Citation
Download full text from publisher
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- de Klerk, E. & Pasechnik, D.V. & Schrijver, A., 2007. "Reduction of symmetric semidefinite programs using the regular*-representation," Other publications TiSEM e418158e-b9dd-4372-b84c-e, Tilburg University, School of Economics and Management.
- Bai, Y.Q. & de Klerk, E. & Pasechnik, D.V. & Sotirov, R., 2007.
"Exploiting Group Symmetry in Truss Topology Optimization,"
Other publications TiSEM
ae445f38-3207-4ae5-9185-1, Tilburg University, School of Economics and Management.
- Bai, Y.Q. & de Klerk, E. & Pasechnik, D.V. & Sotirov, R., 2007. "Exploiting Group Symmetry in Truss Topology Optimization," Discussion Paper 2007-17, Tilburg University, Center for Economic Research.
- de Klerk, E. & Sotirov, R., 2007.
"Exploiting Group Symmetry in Semidefinite Programming Relaxations of the Quadratic Assignment Problem,"
Discussion Paper
2007-44, Tilburg University, Center for Economic Research.
- de Klerk, E. & Sotirov, R., 2010. "Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem," Other publications TiSEM 73287c80-3bc2-40c4-b02d-4, Tilburg University, School of Economics and Management.
- de Klerk, E. & Sotirov, R., 2007. "Exploiting Group Symmetry in Semidefinite Programming Relaxations of the Quadratic Assignment Problem," Other publications TiSEM 87a5d126-86e5-4863-8ea5-1, Tilburg University, School of Economics and Management.
- de Klerk, E., 2006. "The Complexity of Optimizing over a Simplex, Hypercube or Sphere : A Short Survey," Other publications TiSEM 88640b6d-5240-472d-8669-4, Tilburg University, School of Economics and Management.
- de Klerk, E., 2006. "The Complexity of Optimizing over a Simplex, Hypercube or Sphere : A Short Survey," Discussion Paper 2006-85, Tilburg University, Center for Economic Research.
- de Klerk, E. & Pasechnik, D.V., 2007. "A linear programming reformulation of the standard quadratic optimization problem," Other publications TiSEM c3e74115-b343-4a85-976b-8, Tilburg University, School of Economics and Management.
- Klerk, Etienne de, 2010. "Exploiting special structure in semidefinite programming: A survey of theory and applications," European Journal of Operational Research, Elsevier, vol. 201(1), pages 1-10, February.
- Papp, Dávid & Regős, Krisztina & Domokos, Gábor & Bozóki, Sándor, 2023. "The smallest mono-unstable convex polyhedron with point masses has 8 faces and 11 vertices," European Journal of Operational Research, Elsevier, vol. 310(2), pages 511-517.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:tiu:tiutis:eca87811-247d-489f-89c2-cd97534d7a25. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Richard Broekman (email available below). General contact details of provider: https://www.tilburguniversity.edu/about/schools/economics-and-management/ .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.