全部 |
  • 全部
  • 题名
  • 作者
  • 机构
  • 关键词
  • NSTL主题词
  • 摘要
检索 二次检索 AI检索
外文文献 中文文献
筛选条件:

1. Pricing filtering in Dantzig-Wolfe decomposition NSTL国家科技图书文献中心

Mehamdi, Abdellah Bu... |  Lacroix, Mathieu... -  《Operations Research Letters》 - 2025,58 - 共7页

摘要:-Wolfe Decomposition, especially for linear programs | Column generation is used alongside Dantzig |  having a decomposable pricing step requiring to solve |  numerous independent pricing subproblems. We propose a |  filtering method to detect which pricing subproblems may
关键词: Dantzig-Wolfe decomposition |  Linear programming |  Column generation |  Pricing subproblems |  Pricing filtering

2. Last fifty years of integer linear programming: A focus on recent practical advances NSTL国家科技图书文献中心

Clautiaux, Francois |  Ljubic, Ivana -  《European Journal of Operational Research》 - 2025,324(3) - 707~731 - 共25页

摘要: branch-and-cut methods, Dantzig-Wolfe decomposition | , and Benders decomposition. The paper concludes by | Mixed-integer linear programming (MILP) has |  become a cornerstone of operations research. This is |  driven by the enhanced efficiency of modern solvers
关键词: Combinatorial optimization |  Mixed-integer linear programming |  Branch-and-cut |  Dantzig-Wolfe decomposition |  Benders decomposition

3. The Multi-commodity Flow Problem: Double Dantzig-Wolfe decomposition NSTL国家科技图书文献中心

Zhang Fan |  Wang Jiazheng... -  《2024 10th International Conference on Control,Decision and Information Technologies》 -  International Conference on Control,Decision and Information Technologies - 2024, - 1171~1176 - 共6页

摘要: way to use a double Dantzig-Wolfe decomposition | Traffic Engineering (TE) represents one of the |  most essential tools in modern telecommunication |  networks. The rapid growth of exchanged traffic has |  required tackling a known NP-hard problem called the
关键词: Costs |  NP-hard problem |  Programming |  Throughput |  Routing |  Communications technology |  Information technology

4. A new upper bound based on Dantzig-Wolfe decomposition to maximize the stability radius of a simple assembly line under uncertainty NSTL国家科技图书文献中心

Shibasaki, Rui S. |  Rossi, Andre... -  《European Journal of Operational Research》 - 2024,313(3) - 1015~1030 - 共16页

摘要: approach, based on Dantzig-Wolfe decomposition and column |  reformulation resulting from the Dantzig-Wolfe decomposition | This work presents a new upper bounding |  generation, for a relatively novel problem of designing |  simple assembly lines to maximize their stability
关键词: Manufacturing |  Assembly line balancing |  Robustness |  Stability radius |  Dantzig-Wolfe decomposition |  FIXED CYCLE TIME |  HEURISTIC SOLUTION |  ALGORITHM |  BALANCE |  BRANCH...

5. Hybrid Quantum-Classical Computing via Dantzig-Wolfe Decomposition for Integer Linear Programming NSTL国家科技图书文献中心

Xinliang Wei |  Jiyao Liu... -  《2024 33rd International Conference on Computer Communications and Networks,[v.1]》 -  International Conference on Computer Communications and Networks - 2024, - 1~9 - 共9页

摘要: framework via Dantzig-Wolfe decomposition, paving the way | , termed Hybrid quantum-classical Dantzig-Wolfe |  Decomposition (HyDWD), aimed at solving these problems. In | Numerous optimization scenarios such as |  industrial production planning, network communication
关键词: Computers |  Quantum computing |  Computational modeling |  Scalability |  Simulated annealing |  Integer linear programming |  Quantum annealing

6. Use of Machine Learning Models to Warmstart Column Generation for Unit Commitment NSTL国家科技图书文献中心

Nagisa Sugishita |  Andreas Grothey... -  《INFORMS journal on computing》 - 2024,36(4) - 1129~1146 - 共18页

摘要:. Dantzig-Wolfe decomposition with a column generation | The unit commitment problem is an important |  optimization problem in the energy industry used to compute |  the most economical operating schedules of power |  plants. Typically, this problem has to be solved
关键词: unit commitment |  Dantzig-Wolfe decomposition |  column generation |  warmstarting |  machine learning

7. Incorporating Operational Modes into long-Term Open-Pit Mine Planning Under Geological Uncertainty: An Optimization Combining Variable Neighborhood Descent with Linear Programming NSTL国家科技图书文献中心

Quelopana Aldo |  Navarra Alessandro -  《Mining, Metallurgy & Exploration》 - 2024,41(5) - 2769~2782 - 共14页

摘要: programming techniques refined through DantzigWolfe |  decomposition. This approach is exemplified through a case | Abstract Sophisticated models have |  progressively been developed to address the challenges related |  to long-term, open-pit mine planning under
关键词: Metaheuristic |  Linear programming |  Long-term mine planning |  Geological uncertainty |  DantzigWolfe decomposition

8. A Modeling and Hybridized Decomposition Approach for the Multi-level Capacitated Lot-Sizing Problem with Setup Carryover, Backlogging, and Emission Control NSTL国家科技图书文献中心

Chowdhury Nusrat T. |  Baki Mohammed F.... -  《SN Operations Research Forum》 - 2024,5(3) - 1~32 - 共32页

摘要: considered. An item Dantzig-Wolfe decomposition-based | Abstract The goal of the production planning |  problem is to determine the optimum quantity to produce |  in order to satisfy demand over a predetermined |  planning horizon with the least amount of money spent
关键词: Inventory |  Multi-level capacitated lot-sizing |  Emission control |  Setup carryover |  Dantzig-Wolfe decomposition

9. Branch-Price-and-Cut algorithms for the team orienteering problem with interval-varying profits NSTL国家科技图书文献中心

Li, Jiaojiao |  Zhu, Jianghan... -  《European Journal of Operational Research》 - 2024,319(3) - 793~807 - 共15页 - 被引量:1

摘要:This paper studies the team orienteering |  problem (TOP), wherein each vertex requires two visits | , and the service profit of each vertex depends on the |  time interval between these two visits. Motivated by |  scenarios like perishable product delivery, home health
关键词: Team orienteering problem |  Interval-varying profits |  Mixed-integer linear programming |  Dantzig-Wolfe decomposition |  Branch-Price-and-Cut |  VEHICLE-ROUTING PROBLEM |  TIME WINDOWS

10. A Flow-Based Formulation for Parallel Machine Scheduling Using Decision Diagrams NSTL国家科技图书文献中心

Daniel Kowalczyk |  Roel Leus... -  《INFORMS journal on computing》 - 2024,36(6) - 1696~1714 - 共19页

摘要: constraints, and hence we apply a Dantzig-Wolfe |  decomposition to compute the linear programming relaxation in | We present a new flow-based formulation for |  identical parallel machine scheduling with a regular |  objective function and without idle time. The formulation
关键词: parallel machine scheduling |  weighted tardiness |  column generation |  decision diagrams
检索条件Dantzig-Wolfe decomposition
  • 检索词扩展

NSTL主题词

  • NSTL学科导航