Time-dependent shortest path problem

Jin, B. & Tanaka, S. (2023). An exact algorithm for the unrestricted container relocation problem with new lower bounds and dominance rules. European Journal of Operational Research, 304(2), 494–514

Iterative deepening branch-and-bound algorithm for the unrestricted container relocation problem with duplicate priorities

Robust Stochastic Optimization Made Easy

MCM Math Modeling C 2024 Logistic Regression

东南大学讲座预约半自动脚本

a reedit-version of Flow framework,forked from https://github.com/flow-project/flow

COPT (Cardinal Optimizer) release notes and links

Paper list in traffic prediction field

LibCity Experiment Management and Visualization Web Tool

🐙 Guides, papers, lecture, notebooks and resources for prompt engineering

AutoGPT is the vision of accessible AI for everyone, to use and to build on. Our mission is to provide the tools, so that you can focus on what matters.

Network Analysis in Python

Transportation Networks for Research

General Modeling Network Specification

We introduce a new virtual track-based framework and open-source tools for modeling partially schedulable connected and automated mobility (CAM) systems on layered networks considering the emerging…

《交通大数据理论与方法》