„Problem Management“

Suchergebnisse

10.000+ Treffer

• Parabolic optimal control problems with combinatorial switching constraints, part III: branch-and-bound algorithm
  Buchheim, Christoph ; Grütering, Alexandra ; Meyer, Christian
• A second-order sequential optimality condition for nonlinear second-order cone programming problems
  Fukuda, Ellen H. ; Okabe, Kosuke
• An integrated production planning and inventory management problem for a perishable product: optimization and Monte Carlo simulation as a tool for planning in scenarios with uncertain demands
  Cruz, Jeferson Auto ˜daœ ; Salles Neto, Luiz Leduino ˜deœ ; Schenekemberg, Cleder Marcos
• An adaptive variable neighborhood search for the traveling salesman problem with job-times
  Lan, Shaowen ; Lu, Yongliang ; Fan, Wenjuan
• Building a roadmap for safer and sustainable material chemistries: Addressing the PFAS problem through informatics and data-driven chemistry
  Fong, Arthur ; McPherson, Alexandra ; Rossi, Mark ; Rajan, Krishna
• Regularized standard polynomial programming formulations for the maximum clique problem
  Makovenko, Mykyta ; Butenko, Sergiy ; Pardalos, Miltiades
• Improving the Bounds of the Online Dynamic Power Management Problem
  Liang, Ya-Chun ; Iwama, Kazuo ; Liao, Chung-Shou 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Constraint Programming Approach to Ship Refit Project Scheduling
  Boudreault, Raphaël ; Simard, Vanessa ; Lafond, Daniel ; Quimper, Claude-Guy 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Explainability Queries for ML Models and its Connections with Data Management Problems (Invited Talk)
  Barceló, Pablo 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Time and Business Process Management: Problems, Achievements, Challenges (Invited Talk)
  Eder, Johann ; Franceschetti, Marco 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Heuristics for the run-length encoded Burrows–Wheeler transform alphabet ordering problem
  Major, Lily ; Clare, Amanda ; Daykin, Jacqueline W. ; Mora, Benjamin ; Zarges, Christine
• A memetic algorithm for the flexible periodic vehicle routing problem
  Amiri, Banafsheh ; Ziarati, Koorush ; Sohrabi, Somayeh
• Computing relaxations for the three-dimensional stable matching problem with cyclic preferences
  Cseh, Ágnes ; Escamocher, Guillaume ; Quesada, Luis
• An effective population-based approach for the partial set covering problem
  Zhang, Ye ; He, Jinlong ; Zhou, Yupeng ; Hu, Shuli ; Cai, Dunbo ; Tian, Naiyu ; Yin, Minghao
• Heuristic algorithm for integrated ship scheduling, routing and stowage problem in multi-vessel roll-on/roll-off shipping
  Zhao, Yuzhe ; Peng, Peiyun ; Zhou, Jingmiao ; Wang, Yadong
• A local branching-based solution for the multi-period cutting stock problem with tardiness, earliness, and setup costs
  Araújo Silva Oliveira, Elisama de ; Wanner, Elizabeth ; Sá, Elisangela Martins de ; Souza, Sérgio Ricardo de
• A Q-learning-based algorithm for the block relocation problem
  Liu, Liqun ; Feng, Yuanjun ; Zeng, Qingcheng ; Chen, Zhijun ; Li, Yaqiu
• Optimality conditions for Benson proper efficiency of set-valued equilibrium problems
  Zhou, Zhiang ; Liang, Kehui ; Ansari, Qamrul Hasan
• A reweighted $$\ell _1$$ ℓ 1 -penalty method for nonlinear complementarity problems
  Tian, Boshi ; Chang, Xiaoxing
• Sales Silos - ein Problem?
  Rapp, Hajo