A+INFORMS Journal on ComputingUTD24202335(5): 1079-1097Provably Good Solutions to the Knapsack Problem via Neural Networks of Bounded SizeChristoph Hertrich, Martin Skutella被引 13阅读 4基金开放获取计算理论与数学
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阅读 6基金开放获取工业与制造工程
A+INFORMS Journal on ComputingUTD24202234(4): 2163-2176Computing Optimized Path Integrals for Knapsack FeasibilityEndric Daues, Ulf Friedrich被引 1阅读 4工业与制造工程
A+INFORMS Journal on ComputingUTD242021Multivariable Branching: A 0-1 Knapsack Problem Case StudyYu Long Yang, Natashia Boland, Martin W. P. Savelsbergh被引 11阅读 4工业与制造工程
A+Management ScienceUTD24FT50202572(7): 5681-5697The Competitive Ratio of Threshold Policies for Online Unit-Density Knapsack ProblemsWill Ma, David Simchi‐Levi, Jinglong Zhao被引 0阅读 14开放获取计算机网络与通信
A+Operations ResearchUTD24FT50202371(5): 1577-1595Nonrobust Strong Knapsack Cuts for Capacitated Location Routing and Related ProblemsPedro Liguori, Ali Ridha Mahjoub, Guillaume Marques, Ruslan Sadykov 等 5 人被引 12阅读 6基金开放获取工业与制造工程
A+INFORMS Journal on ComputingUTD242026Exact Algorithms for Two-Dimensional Knapsack Problems: A Unified Framework with New Benchmark ResultsSunkanghong Wang, Roberto Baldacci, Fabio Furini, Lijun Wei 等 5 人被引 0阅读 12工业与制造工程
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阅读 6高影响力 前 10%工业与制造工程
A+INFORMS Journal on ComputingUTD24201628(2): 319-333Bilevel Knapsack with Interdiction ConstraintsAlberto Caprara, Margarida Carvalho, Andrea Lodi, Gerhard J. Woeginger被引 98阅读 5高影响力 前 10%开放获取工业与制造工程
A+INFORMS Journal on ComputingUTD24201628(2): 308-318Approximation of the Quadratic Knapsack ProblemUlrich Pferschy, Joachim Schauer被引 16阅读 4计算理论与数学
A+INFORMS Journal on ComputingUTD24201931(2): 390-410Interdiction Games and Monotonicity, with Application to Knapsack ProblemsMatteo Fischetti, Ivana Ljubić, Michele Monaci, Markus Sinnl被引 88阅读 13高影响力 前 10%工业与制造工程路网损毁与基础设施韧性
EM-WoSEuropean Journal of Operational Research2024326(1): 1-12The quadratic knapsack problemLaura Galli, Silvano Martello, Paolo Toth被引 8阅读 3基金开放获取工业与制造工程
A+INFORMS Journal on ComputingUTD24202234(6): 3134-3150A Branch-and-Price Algorithm for the Multiple Knapsack ProblemOlivier Lalonde, Jean‐François Côté, Bernard Gendron被引 12阅读 4工业与制造工程
A+INFORMS Journal on ComputingUTD242020A Core-Based Exact Algorithm for the Multidimensional Multiple Choice Knapsack ProblemRenata Mansini, Roberto Zanotti被引 13阅读 4工业与制造工程
A+Operations ResearchUTD24FT50202473(3): 1703-1721Tight Guarantees for Multiunit Prophet Inequalities and Online Stochastic KnapsackJiashuo Jiang, Will Ma, Jiawei Zhang被引 6阅读 2计算机网络与通信
A+Operations ResearchUTD24FT50202271(4): 1414-1433Technical Note—An Approximate Dynamic Programming Approach to the Incremental Knapsack ProblemAli Aouad, Danny Segev被引 4阅读 12工业与制造工程
A+INFORMS Journal on ComputingUTD242017A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict GraphBettinelliAndrea, CacchianiValentina, MalagutiEnrico被引 1阅读 2工业与制造工程
A+INFORMS Journal on ComputingUTD24201628(3): 575-588Optimization-Based Very Large-Scale Neighborhood Search for Generalized Assignment Problems with Location/Allocation ConsiderationsAhmed Ghoniem, Tülay Flamand, Mohamed Haouari被引 28阅读 3高影响力 前 10%工业与制造工程
A+INFORMS Journal on ComputingUTD24201527(2): 392-405Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack ProblemFabio Furini, Manuel Iori, Silvano Martello, Mutsunori Yagiura被引 40阅读 16高影响力 前 10%基金开放获取工业与制造工程
EM-WoSEuropean Journal of Operational Research2024323(2): 425-440A fast and effective breakpoints heuristic algorithm for the quadratic knapsack problemDorit S. Hochbaum, P. Baumann, Olivier Goldschmidt, Y. Zhang被引 8阅读 2基金开放获取工业与制造工程
