Skip to content

Author

Jiang-Hao Lin

We have 5 of 11 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Oct 2026

ORSMT: Unleashing the Potential of Satisfiability Modulo Theories for Semantic Verification and Repair in LLM-Based Optimization

Across 3,034 problems and six generator sizes, ORSMT improves the model-code match rate in all 72 benchmark and generator combinations before selection and raises the aggregate rate from 43.2% to 88.2% and the share that are both correct and matched from 25.2% to 40.2%.

Rui Zhang, Chenyu Zhou, Jiang-Hao Lin et al. · 0 citations
Preprint Oct 2026

TAO: Tool-Aware Joint Scheduling for LLM-Based Agentic Serving

TAO is presented, a tool-aware joint scheduling framework for LLM-based agentic serving that combines near-term tool readiness, node-specific cache credit with time-aware decay, and token footprint; a dynamic program jointly selects and places waiting sessions under capacity constraints.

Shu-Hua Li, Sheng-Dong Ye, Dong-Dong Ge et al. · 1 citation
#artificial intelligence Preprint Sep 2026

Beyond Verified Answers: Solver-Informed Self-Distillation for Bootstrapping Operations Research Language Models

SOLID is proposed, a novel framework for self-improving OR language models without verified answers or external evaluators that improves solution accuracy for both general-purpose and OR-tuned models over outcome-only group-relative training.

Rui-Chen Zhu, Ming-Long Cao, Chen-Yu Zhou et al. · 0 citations
#artificial intelligence Preprint Sep 2026

Ask Before You Optimize: Dynamic Pre-Formulation Clarification for Interactive Optimization

This work introduces OR-Clarify, a benchmark for pre-formulation clarification and proposes Interactive Optimization (InterOPT), a two-stage framework that identifies unresolved formulation-critical gaps and uses them to guide whether to ask the next question or to stop.

Si-Han Ge, Yi-Chen Lin, Chen-Yu Zhou et al. · 0 citations
Jul 2026

GraphBU: MILP Instance Generation with Graph-Native Block Units

GraphBU is proposed, a graph-native generator whose basic unit is a local subproblem plus its interface whose basic unit is a local subproblem plus its interface that keeps graph statistics close to the source family, preserves feasibility on most datasets, and improves downstream Predict-and-Search training.

Xiaolei Guo, Chenyu Zhou, Jiang-Hao Lin et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.