Pith. sign in

REVIEW

Efficient primal heuristics for mixed-integer linear programs

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2202.02725 v1 pith:X7X73KVC submitted 2022-02-06 math.OC

Efficient primal heuristics for mixed-integer linear programs

classification math.OC
keywords primalcompetitionapproachescombinatorialcompetitorscomputationalcustomizeddataset
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

This paper is a short report about our work for the primal task in the Machine Learning for Combinatorial Optimization NeurIPS 2021 Competition. For each dataset of our interest in the competition, we propose customized primal heuristic methods to efficiently identify high-quality feasible solutions. The computational studies demonstrate the superiority of our proposed approaches over the competitors'.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.