A+INFORMS Journal on ComputingUTD24202234(5): 2523-2539An Iterated Dual Substitution Approach for Binary Integer Programming Problems Under the Min-Max Regret CriterionWei Ying Wu, Manuel Iori, Silvano Martello, Mutsunori Yagiura被引 4阅读 2基金开放获取工业与制造工程
A+INFORMS Journal on ComputingUTD242021Multivariable Branching: A 0-1 Knapsack Problem Case StudyYu Long Yang, Natashia Boland, Martin W. P. Savelsbergh被引 11阅读 2工业与制造工程
A+INFORMS Journal on ComputingUTD24202234(4): 2163-2176Computing Optimized Path Integrals for Knapsack FeasibilityEndric Daues, Ulf Friedrich被引 1阅读 2工业与制造工程
A+INFORMS Journal on ComputingUTD24201729(3): 457-473A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict GraphAndrea Bettinelli, Valentina Cacchiani, Enrico Malaguti被引 66阅读 4高影响力 前 10%工业与制造工程
A+INFORMS Journal on ComputingUTD24201628(2): 319-333Bilevel Knapsack with Interdiction ConstraintsAlberto Caprara, Margarida Carvalho, Andrea Lodi, Gerhard J. Woeginger被引 98阅读 2高影响力 前 10%开放获取工业与制造工程
A+Operations ResearchUTD24FT50202271(4): 1414-1433Technical Note—An Approximate Dynamic Programming Approach to the Incremental Knapsack ProblemAli Aouad, Danny Segev被引 4阅读 1工业与制造工程
A+Management ScienceUTD24FT50202471(2): 1120-1137Sensitivity Analysis of the Cost Coefficients in Multiobjective Integer Linear OptimizationKim Allan Andersen, Trine Krogh Boomsma, Britta Efkes, Nicolas Forget被引 2阅读 2控制与系统工程
A+INFORMS Journal on ComputingUTD24202033(3): 1056-1069An Augmented Lagrangian Decomposition Method for Chance-Constrained Optimization ProblemsXiaodi Bai, Jie Sun, Xiaojin Zheng被引 16阅读 2基金开放获取管理科学与运筹学不确定性优化（随机/鲁棒/DRO/CVaR）
A+INFORMS Journal on ComputingUTD24202033(3): 949-962The Quadratic Multiknapsack Problem with Conflicts and Balance ConstraintsPhilippe Olivier, Andrea Lodi, Gilles Pesant被引 12阅读 2工业与制造工程公平—效率权衡
A+INFORMS Journal on ComputingUTD24202336(1): 285-304Enhancing Branch-and-Bound for Multiobjective 0-1 ProgrammingNicolas Forget, Sophie N. Parragh被引 6阅读 2基金开放获取计算理论与数学
A+Operations ResearchUTD24FT50202270(5): 2883-2905Consistency Cuts for Dantzig-Wolfe ReformulationsJens Clausen, Richard Martin Lusby, Stefan Røpke被引 3阅读 2基金开放获取数值分析
A+INFORMS Journal on ComputingUTD24202538(2): 645-675Spatial Branch-and-Bound for Nonconvex Separable Piecewise Linear OptimizationThomas Hübner, Akshay Gupte, Steffen Rebennack被引 0阅读 2基金开放获取数值分析
A+INFORMS Journal on ComputingUTD24202538(3): 844-861Branch-and-Price for the Set-Union Bin Packing ProblemJulia Wahlen, Timo Gschwind被引 1阅读 2工业与制造工程
A+INFORMS Journal on ComputingUTD242026On the Approximation of Separable Nonconvex Optimization Programs to an Arbitrary Numerical ToleranceClaudio Contardo, Sandra Ulrich Ngueveu被引 0阅读 3数值分析
EM-WoSEuropean Journal of Operational Research2026Formulations and an exact algorithm for the Traveling Thief ProblemTomás Kapancioglu, Raquel Bernardino, Maria Cândida Mourão被引 0阅读 1开放获取工业与制造工程
A+INFORMS Journal on ComputingUTD242026A Polynomial-Time Inner Approximation Algorithm for Multiobjective and Parametric OptimizationLevin Nemesch, Stefan Ruzika, Clemens Thielen, Alina Wittmann被引 1阅读 2基金开放获取计算理论与数学
A+INFORMS Journal on ComputingUTD24201628(4): 736-751Modeling Two-Dimensional Guillotine Cutting Problems via Integer ProgrammingFabio Furini, Enrico Malaguti, Dimitri Thomopulos被引 60阅读 1高影响力 前 10%开放获取工业与制造工程
A+INFORMS Journal on ComputingUTD242026Assortment Optimization with General Linear Constraints Under the Paired Combinatorial Logit Choice ModelJianguang Feng, Ada Che, Zhi‐Long Chen被引 0阅读 2管理信息系统
A+Operations ResearchUTD24FT50201665(1): 212-2200/1 Polytopes with Quadratic Chvátal RankThomas Rothvoß, Laura Sanità被引 6基金计算理论与数学
A+INFORMS Journal on ComputingUTD24202336(1): 203-223Fast Continuous and Integer L-Shaped Heuristics Through Supervised LearningEric Larsen, Emma Frejinger, Bernard Gendron, Andrea Lodi被引 18阅读 2高影响力 前 10%基金开放获取数值分析不确定性优化（随机/鲁棒/DRO/CVaR）金融风险与机器学习
