atlas

Research map / Graph learning / Graph algorithms and clustering

On Representing Mixed-Integer Linear Programs by Graph Neural Networks

ICLR 2023 · Graph learning › Graph algorithms and clustering · approach: Neural combinatorial optimization on graphs · 6 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Restrict the dataset to unfoldable MILPsGNN feasibility prediction · Unfoldable MILPs in D1feasibility prediction errorHelped
Use a standard GNN without random features on foldable MILPsGNN feasibility prediction · Foldable MILPs in D2feasibility prediction errorHurt
Append random vertex featuresGNN feasibility prediction · Foldable MILPs in D2feasibility prediction errorHelped
Restrict the dataset to unfoldable instancesGNN optimal objective value prediction · Feasible instances in D1approximation errorHelped
Append random features to the graphGNN optimal objective value prediction · Feasible instances in D2approximation errorHelped
Use a larger GNNGNN optimal solution prediction · Feasible instances in D1 and D2solution approximation errorMixed

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy