„Linear programming“

Suchergebnisse

2.638 Treffer

• The Sum-Product Algorithm For Quantitative Multiplicative Linear Logic
  Ehrhard, Thomas ; Faggian, Claudia ; Pagani, Michele 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• How to Take the Inverse of a Type
  Marshall, Danielle ; Orchard, Dominic 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Duality-Based Method for Identifying Elemental Balance Violations in Metabolic Network Models
  Zabeti, Hooman ; Stephen, Tamon ; Berger, Bonnie ; Chindelevitch, Leonid 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Exact Algorithms for the Maximum Planar Subgraph Problem: New Models and Experiments
  Chimani, Markus ; Hedtke, Ivo ; Wiedera, Tilo 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• ILP-based Local Search for Graph Partitioning
  Henzinger, Alexandra ; Noe, Alexander ; Schulz, Christian 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• How to Take the Inverse of a Type (Artifact)
  Marshall, Danielle ; Orchard, Dominic
• Swing shift: a mathematical approach to defensive positioning in baseball
  Bouzarth, Elizabeth ; Grannan, Benjamin ; Harris, John ; Hartley, Andrew ; Hutson, Kevin ; Morton, Ella
• A Strongly Polynomial Algorithm for Linear Programs with at Most Two Non-Zero Entries per Row or Column (Invited Talk)
  Dadush, Daniel ; Koh, Zhuan Khye ; Natura, Bento ; Olver, Neil ; Végh, László A. 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Proof Complexity and Its Relations to SAT Solving (Invited Talk)
  Atserias, Albert 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Fine-Grained Equivalence for Problems Related to Integer Linear Programming
  Rohwedder, Lars ; Węgrzycki, Karol 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• 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
• The Combinatorics of (S,M,L,XL) or the best fitting delivery of T-shirts
  Gaul, Constantin ; Kurz, Sascha ; Rambau, Jörg
• N-gram GP: Early results and half-baked ideas
  McPhee, Nicholas Freitag ; Poli, Riccardo
• Linear Promises: Towards Safer Concurrent Programming (Artifact)
  Rau, Ohad ; Voss, Caleb ; Sarkar, Vivek
• A Combinatorial Certifying Algorithm for Linear Programming Problems with Gainfree Leontief Substitution Systems
  Kimura, Kei ; Makino, Kazuhisa 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Approximation Algorithms for Directed Weighted Spanners
  Grigorescu, Elena ; Kumar, Nithish ; Lin, Young-San 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Bridging Disparate Views on the DCJ-Indel Model for a Capping-Free Solution to the Natural Distance Problem
  Bohnenkämper, Leonard 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Revisiting the Complexity of and Algorithms for the Graph Traversal Edit Distance and Its Variants
  Qiu, Yutong ; Shen, Yihang ; Kingsford, Carl 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Inferring Temporally Consistent Migration Histories
  Roddur, Mrinmoy Saha ; Snir, Sagi ; El-Kebir, Mohammed 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