Abstract: Job-shop scheduling is an important but difficult problem arising in low-volume high-variety manufacturing. It is usually solved at the beginning of each shift with strict computational time ...

Abstract: This paper deals with the short-circuit level constrained transmission expansion planning (TEP) problem through a mixed-integer linear programming (MILP) approach. The proposed framework is ...

This repository provides a collection of mFSTSP test problems, as well as the source code to solve mFSTSP instances. The mFSTSP is a variant of the classical TSP, in which one or more UAVs coordinate ...

P vs. NP asks: are these two classes actually the same? If P = NP, then every “hard” problem is secretly fast to solve; we ...

However, the process of building these models is often labor-intensive and time-consuming. We address this by proposing a multi-agent framework LEAN-LLM-OPT, which takes a query (a problem description ...