AGENTIC-SYSTEMSJuly 15, 20261 min read

LP Mining with LP2Graph: A Use Case for Railway Rescheduling

Researchers introduce LP Mining with LP2Graph, a method to mine and standardize Mixed-Integer Linear Programming (MILP) formulations into a reproducible dataset, establishing a foundation for automated railway rescheduling.

Computer Science > Artificial Intelligence

Title:LP Mining with LP2Graph: A Use Case for Railway Rescheduling

View PDF HTML (experimental)Abstract:Like many optimization-driven domains, railway rescheduling relies on Mixed-Integer Linear Programming (MILP), yet the field's modeling knowledge is scattered across hundreds of papers in incompatible notations, and narrative surveys organize it subjectively: they classify models by vocabulary rather than by structure, and reproduce neither. We present LP Mining with LP2Graph, a method that mines the structure of published LP and MILP formulations into a reproducible dataset and an induced taxonomy. Its core, LP2Graph, represents each formulation admitted by its canonical grammar as a typed variable--equation graph derived from a single canonical model; once a source is extracted into that model, everything downstream is deterministic. Each source is parsed into this model, homologized, and clustered bottom-up (over variables, then constraints and the objective, then whole-model structure) and, separately, by application domain and solution approach; the resulting groups are labeled by a rule-seeded, self-updating classifier. We validate the representation rather than assume it: per-cluster representatives are regenerated as independent LaTeX and re-solved across CBC, HiGHS and Gurobi against the optimum reported in the source paper. The outcome is an objective, repeatable taxonomy of variables, constraints and model types: the principled foundation on which our raiLPminer line of automated railway-rescheduling model development builds.

Bibliographic and Citation Tools

Code, Data and Media Associated with this Article

Demos

Recommenders and Search Tools

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Source: arXiv cs.AI Recent

More in this category

agentic-systems

Good Benchmarks

As AI models advance rapidly, establishing high-quality benchmarks is more critical than ever. A recent paper outlines the core criteria that define a truly effective and practical AI evaluation system.

agentic-systems

Cost-Governed RAG: Unified Per-Tenant Cost Attribution Across Retrieval and Generation in Multi-Tenant LLM Systems

Researchers have introduced Cost-Governed RAG, a novel architecture that enables precise, per-tenant cost attribution across both retrieval and generation layers in multi-tenant LLM systems. By leveraging a codebook-oblivious vector index called TurboVec, the system achieves 99.96% cost attribution accuracy while reducing infrastructure costs by up to 9 times.

agentic-systems

The Emerging Paradigm of Geospatial Foundation Models: From Pre-Training to Agentic Reasoning

This paper explores the paradigm shift enabled by Geospatial Foundation Models (GeoFMs), detailing their types, operationalization strategies, and the future of Agentic Geospatial Reasoning.

NOW LET US Related – Operationalising Multi-Dimensional Evaluation for Conversational Agents: A Scalable, Governed Pipeline with Selective Re-evaluation and Model Benchmarking

agentic-systems

Operationalising Multi-Dimensional Evaluation for Conversational Agents: A Scalable, Governed Pipeline with Selective Re-evaluation and Model Benchmarking

This paper presents GenAI Evaluation, a governed, configuration-driven pipeline designed for large-scale, multi-dimensional evaluation of retail conversational agents. The framework processes approximately 50,000 daily records, achieving high alignment with human judgment across key metrics like helpfulness, truthfulness, and tone.

agentic-systems

Representing and Generating Levels Over Time through Playtrace Reconstructive Partitioning

Researchers introduce a novel 'cake' representation and the Playtrace Reconstructive Partitioning (PRP) algorithm, allowing AI to generate game levels by encoding dynamic playtrace information over time. Tested on Sokoban, this approach outperforms existing PCG methods while preserving solution diversity.

agentic-systems

Connected by Construction: Learning Tractable Near-Tour Marginals for Traveling Salesman Problems

Researchers have introduced C2TSP, a breakthrough unsupervised learning pipeline for the Traveling Salesman Problem (TSP). By focusing on learning structurally meaningful latent objects rather than relying solely on the final decoding stage, C2TSP opens up new possibilities for AI-driven combinatorial optimization.