Published in: LIPIcs, Volume 244, 30th Annual European Symposium on Algorithms (ESA 2022)
Daniel Blankenburg. Resource Sharing Revisited: Local Weak Duality and Optimal Convergence. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 20:1-20:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{blankenburg:LIPIcs.ESA.2022.20, author = {Blankenburg, Daniel}, title = {{Resource Sharing Revisited: Local Weak Duality and Optimal Convergence}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {20:1--20:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.20}, URN = {urn:nbn:de:0030-drops-169582}, doi = {10.4230/LIPIcs.ESA.2022.20}, annote = {Keywords: Resource sharing, Dantzig-Wolfe-type algorithms, Decreasing minimization} }
Published in: LIPIcs, Volume 210, 27th International Conference on Principles and Practice of Constraint Programming (CP 2021)
Boro Sofranac, Ambros Gleixner, and Sebastian Pokutta. An Algorithm-Independent Measure of Progress for Linear Constraint Propagation. In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 52:1-52:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{sofranac_et_al:LIPIcs.CP.2021.52, author = {Sofranac, Boro and Gleixner, Ambros and Pokutta, Sebastian}, title = {{An Algorithm-Independent Measure of Progress for Linear Constraint Propagation}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {52:1--52:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.52}, URN = {urn:nbn:de:0030-drops-153430}, doi = {10.4230/LIPIcs.CP.2021.52}, annote = {Keywords: Bounds Propagation, Mixed Integer Programming} }
Published in: LIPIcs, Volume 28, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)
Gábor Braun, Samuel Fiorini, and Sebastian Pokutta. Average Case Polyhedral Complexity of the Maximum Stable Set Problem. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 28, pp. 515-530, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
@InProceedings{braun_et_al:LIPIcs.APPROX-RANDOM.2014.515, author = {Braun, G\'{a}bor and Fiorini, Samuel and Pokutta, Sebastian}, title = {{Average Case Polyhedral Complexity of the Maximum Stable Set Problem}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)}, pages = {515--530}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-74-3}, ISSN = {1868-8969}, year = {2014}, volume = {28}, editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.515}, URN = {urn:nbn:de:0030-drops-47201}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.515}, annote = {Keywords: polyhedral approximation, extended formulation, stable sets} }
Feedback for Dagstuhl Publishing