„assignment problem“

Suchergebnisse

585 Treffer

• A Nearly Optimal Deterministic Algorithm for Online Transportation Problem
  Harada, Tsubasa ; Itoh, Toshiya 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Algorithms for the Diverse-k-SAT Problem: The Geometry of Satisfying Assignments
  Austrin, Per ; Bercea, Ioana O. ; Goswami, Mayank ; Limaye, Nutan ; Srinivasan, Adarsh 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Markov decision process and approximate dynamic programming for a patient assignment scheduling problem
  O'Reilly, Małgorzata M. ; Krasnicki, Sebastian ; Montgomery, James ; Heydar, Mojtaba ; Turner, Richard ; Dam, Pieter Van ; Maree, Peter
• An experimental examination into the design of decentralized methods to solve the assignment problem with and without money
  Olson, Mark A. ; Porter, David
• Assignment problems with changeover cost
  Sinha, Pritibhushan
• The computational complexity of bilevel assignment problems
  Gassner, Elisabeth ; Klinz, Bettina
• Strategy-proofness, solidarity, and consistency for multiple assignment problems
  Klaus, Bettina ; Miyagawa, Eiichi
• Faster Algorithms for some Optimization Problems on Collinear Points
  Biniaz, Ahmad ; Bose, Prosenjit ; Carmi, Paz ; Maheshwari, Anil ; Munro, Ian ; Smid, Michiel 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Model and migrating birds optimization algorithm for two-sided assembly line worker assignment and balancing problem
  Janardhanan, Mukund Nilakantan ; Li, Zixiang ; Nielsen, Peter
• Product-oriented time window assignment for a multi-compartment vehicle routing problem
  Martins, Sara ; Ostermeier, Manuel ; Amorim, Pedro ; Hübner, Alexander ; Almada-Lobo, Bernardo 2019 Universität Augsburg
• Finding Small Satisfying Assignments Faster Than Brute Force: A Fine-Grained Perspective into Boolean Constraint Satisfaction
  Künnemann, Marvin ; Marx, Dániel 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Hierarchicity-based (self-similar) hybrid genetic algorithm for the grey pattern quadratic assignment problem
  Misevičius, Alfonsas ; Palubeckis, Gintaras ; Drezner, Zvi
• Upper-contour strategy-proofness in the probabilistic assignment problem
  Chun, Youngsub ; Yun, Kiyong
• Solving the Periodic Scheduling Problem: An Assignment Approach in Non-Periodic Networks
  Grafe, Vera ; Schöbel, Anita 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Regional Search for the Resource Constrained Assignment Problem
  Borndörfer, Ralf ; Reuther, Markus 2015 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• An Investigation of the Recoverable Robust Assignment Problem
  Fischer, Dennis ; Hartmann, Tim A. ; Lendl, Stefan ; Woeginger, Gerhard J. 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Davidson College multi-objective assignment problem: a case study
  Chartier, Timothy P. ; Ellison, Victoria ; Langville, Amy N.
• A Bilevel Model for the Frequency Setting Problem
  Gatt, Hector ; Freche, Jean-Marie ; Laurent, Arnaud ; Lehuédé, Fabien 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Realignment in the NHL, MLB, NFL, and NBA
  Macdonald, Brian ; Pulleyblank, William
• Comparing Different Approaches on the Door Assignment Problem in LTL-Terminals
  Naujoks, Boris ; Chmielewski, Annette