Origin-destination integer multicommodity flow problems differ from classic multicommodity models in that each commodity has one source and one sink, and each commodity must be routed along a single path. A new invisible-hand heuristic that mimics economic markets' behavior is presented and tested on large-scale telecommunications networks, with solution times two orders of magnitude faster than CPLEX's LP relaxation, more dramatic MIP ratios, and small solution value differences.

中文翻译：

---

起点-终点整数多商品网络流的隐形手启发式算法

起点-终点整数多商品流问题与经典多商品模型的不同之处在于，每个商品都有一个源和一个汇，并且每个商品必须沿着一条路径路由。在大型电信网络上提出并测试了一种新的模拟经济市场行为的隐形手启发式方法，其求解时间比 CPLEX 的 LP 松弛快两个数量级，MIP 比率更显着，并且求解值差异很小。