A+INFORMS Journal on ComputingUTD24202436(6): 1522-1542Decision Diagram-Based Branch-and-Bound with Caching for Dominance and Suboptimality DetectionVianney Coppé, Xavier Gillard, Pierre Schaus被引 6阅读 1开放获取计算理论与数学
A+INFORMS Journal on ComputingUTD24201729(3): 544-557Numerically Safe Lower Bounds for the Capacitated Vehicle Routing ProblemRicardo Fukasawa, Laurent Poirrier被引 3阅读 2工业与制造工程
A+INFORMS Journal on ComputingUTD24201628(1): 96-111An AO* Based Exact Algorithm for the Canadian Traveler ProblemVural Aksakallı, O. Furkan Sahin, İbrahim Arı被引 21阅读 1计算机网络与通信
A+INFORMS Journal on ComputingUTD24201730(1): 137-153Incremental Upper Bound for the Maximum Clique ProblemChu-Min Li, Zhiwen Fang, Hua Jiang, Ke Xu被引 33阅读 2基金计算理论与数学
A+INFORMS Journal on ComputingUTD242025Cut-Based Conflict Analysis in Mixed Integer ProgrammingGioni Mexi, Felipe Serrano, Timo Berthold, Ambros Gleixner 等 5 人被引 0阅读 2开放获取数值分析
