„combinatorial optimization“

Suchergebnisse

1.304 Treffer

• An Investigation of Generic Approaches to Large Neighbourhood Search (Short Paper)
  Souza, Filipe ; Grimes, Diarmuid ; O'Sullivan, Barry 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Slide&Drill, a New Approach for Multi-Objective Combinatorial Optimization
  Cortes, João ; Lynce, Inês ; Manquinho, Vasco 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Certifying Without Loss of Generality Reasoning in Solution-Improving Maximum Satisfiability
  Berg, Jeremias ; Bogaerts, Bart ; Nordström, Jakob ; Oertel, Andy ; Paxian, Tobias ; Vandesande, Dieter 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• On the Smoothed Complexity of Combinatorial Local Search
  Giannakopoulos, Yiannis ; Grosz, Alexander ; Melissourgos, Themistoklis 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Recent Trends in Graph Decomposition (Dagstuhl Seminar 23331)
  Karypis, George ; Schulz, Christian ; Strash, Darren ; Ajwani, Deepak ; Bisseling, Rob H. ; Casel, Katrin ; Çatalyürek, Ümit V. ; Chevalier, Cédric ; Chudigiewitsch, Florian ; Faraj, Marcelo Fonseca ; Fellows, Michael ; Gottesbüren, Lars ; Heuer, Tobias ; Kaya, Kamer ; Lacki, Jakub ; Langguth, Johannes ; Li, Xiaoye Sherry ; Mayer, Ruben ; Meintrup, Johannes ; Mizutani, Yosuke ; Pellegrini, François ; Petrini, Fabrizio ; Rosamond, Frances ; Safro, Ilya ; Schlag, Sebastian ; Sharma, Roohani ; Sullivan,
• Which Ball is the Roundest? - A Suggested Tournament Stability Index
  Lundh, Torbjörn
• Graph decomposition techniques for solving combinatorial optimization problems with variational quantum algorithms
  Ponce, Moises ; Herrman, Rebekah ; Lotshaw, Phillip C. ; Powers, Sarah ; Siopsis, George ; Humble, Travis ; Ostrowski, James
• Linear, Semidefinite Programming and Randomization Methods for Combinatorial Optimization Problems (Dagstuhl Seminar 00041)
  Jansen, Klaus ; Rolim, Jose ; Sudan, Madhu 2000 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Improved Guarantees for the a Priori TSP
  Blauth, Jannis ; Neuwohner, Meike ; Puhlmann, Luise ; Vygen, Jens 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Machine Learning Augmented Algorithms for Combinatorial Optimization Problems (Dagstuhl Seminar 24441)
  Ajwani, Deepak ; Dilkina, Bistra ; Guns, Tias ; Meyer, Ulrich Carsten
• Differentially Private Combinatorial Optimization
  Talwar, Kunal ; Gupta, Anupam ; Ligett, Katrina ; McSherry, Frank ; Roth, Aaron
• Branch-and-Price Solving in G12
  Puchinger, Jakob ; Stuckey, Peter ; Wallace, Mark ; Brand, Sebastian
• Combinatorial problems in solving linear systems
  Duff, Iain S. ; Ucar, Bora
• A New Approach to Finding 2 x n Partially Spatially Balanced Latin Rectangles (Short Paper)
  Mirka, Renee ; Greenstreet, Laura ; Grimson, Marc ; Gomes, Carla P. 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Constraint Programming Models for Depth-Optimal Qubit Assignment and SWAP-Based Routing (Short Paper)
  Booth, Kyle E. C. 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Large Neighborhood Beam Search for Domain-Independent Dynamic Programming
  Kuroiwa, Ryo ; Beck, J. Christopher 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Preprocessing in SAT-Based Multi-Objective Combinatorial Optimization
  Jabs, Christoph ; Berg, Jeremias ; Ihalainen, Hannes ; Järvisalo, Matti 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Round and Bipartize for Vertex Cover Approximation
  Kashaev, Danish ; Schäfer, Guido 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Constant-Factor Approximation for Quasi-Bipartite Directed Steiner Tree on Minor-Free Graphs
  Friggstad, Zachary ; Mousavi, Ramin 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Cutting Planes Width and the Complexity of Graph Isomorphism Refutations
  Torán, Jacobo ; Wörz, Florian 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik