Journal article · 2026

Code and Data Repository for A Primal Approach to Facial Reduction for SDP Relaxations of Combinatorial Optimization Problems

Hao Hu, Mingming Xu

INFORMS journal on computing · Published 10 November 2026 · DOI 10.1287/ijoc.2025.1461.cd

View at the publisherCite this paper

In brief

“Code and Data Repository for A Primal Approach to Facial Reduction for SDP Relaxations of Combinatorial Optimization Problems” is a 2026 journal article by Hao Hu and Mingming Xu, published in INFORMS journal on computing. OpenAlex counts 0 citations as of 18 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.

Citations
0
Authors
2

Abstract

The software and experiment metadata in this repository are a snapshot of the materials associated with the paper A Primal Approach to Facial Reduction for SDP Relaxations of Combinatorial Optimization Problems by Hao Hu and Mingming Xu. Read the full abstract at the publisher.

Excerpt. This paper is not open access.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Hu, H., & Xu, M. (2026). Code and Data Repository for A Primal Approach to Facial Reduction for SDP Relaxations of Combinatorial Optimization Problems. INFORMS journal on computing. https://doi.org/10.1287/ijoc.2025.1461.cd

MLA 9

Hu, Hao, and Mingming Xu. “Code and Data Repository for A Primal Approach to Facial Reduction for SDP Relaxations of Combinatorial Optimization Problems.” INFORMS journal on computing, 2026. https://doi.org/10.1287/ijoc.2025.1461.cd.

Chicago

Hu, Hao and Mingming Xu. 2026. “Code and Data Repository for A Primal Approach to Facial Reduction for SDP Relaxations of Combinatorial Optimization Problems.” INFORMS journal on computing. https://doi.org/10.1287/ijoc.2025.1461.cd.

Harvard

Hu, H. and Xu, M. (2026) ‘Code and Data Repository for A Primal Approach to Facial Reduction for SDP Relaxations of Combinatorial Optimization Problems’, INFORMS journal on computing. doi:10.1287/ijoc.2025.1461.cd.

IEEE

H. Hu and M. Xu, “Code and Data Repository for A Primal Approach to Facial Reduction for SDP Relaxations of Combinatorial Optimization Problems,” INFORMS journal on computing, 2026, doi: 10.1287/ijoc.2025.1461.cd.

BibTeX

@article{hu2026code,
  title     = {{Code and Data Repository for A Primal Approach to Facial Reduction for SDP Relaxations of Combinatorial Optimization Problems}},
  author    = {Hu, Hao and Xu, Mingming},
  journal   = {INFORMS journal on computing},
  year      = {2026},
  doi       = {10.1287/ijoc.2025.1461.cd},
  url       = {https://doi.org/10.1287/ijoc.2025.1461.cd}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Topic and keywords

Physical Sciences › Mathematics › Numerical Analysis › Advanced Optimization Algorithms Research

  • facial reduction
  • semidefinite programming
  • combinatorial optimization
  • SDP relaxation

Work with this paper

Most-cited papers in Mathematics

All highly cited Mathematics papers

Questions about this paper

How do I cite this paper in APA style?

Hu, H., & Xu, M. (2026). Code and Data Repository for A Primal Approach to Facial Reduction for SDP Relaxations of Combinatorial Optimization Problems. INFORMS journal on computing. https://doi.org/10.1287/ijoc.2025.1461.cd

How many times has this paper been cited?

0 times, according to OpenAlex on 18 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

OpenAlex records no free legal copy. Check your library's access, the authors' pages or a repository, or ask the corresponding author for a copy.

Who wrote this paper?

Hao Hu, Mingming Xu.

What is the DOI of this paper?

10.1287/ijoc.2025.1461.cd, permanently at https://doi.org/10.1287/ijoc.2025.1461.cd. Sign in and open it from this page.

Bibliographic data from OpenAlex (CC0), last checked 18 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.