( en | de | ru )

 

Disambiguation of "Chudak, Fabián A."

Author of the publication

copydeleteadd this publication to your clipboard
Solving SAT and MaxSAT with a Quantum Annealer: Foundations and a Preliminary Report.

, , , , , and . FroCoS, volume 10483 of Lecture Notes in Computer Science, page 153-171. Springer, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Sebastian Chudak

Claudia Chudak

Fabián Pérez Willard

Andrés Fabián Lasagni

Fabián David Nonis

 

Other publications of authors with the same name

Approximate k-MSTs and k-Steiner Trees via the Primal-Dual Method and Lagrangean Relaxation., , and . IPCO, volume 2081 of Lecture Notes in Computer Science, page 60-70. Springer, (2001)Mapping Constrained Optimization Problems to Quantum Annealing with Application to Fault Diagnosis., , , , , and . Frontiers ICT, (2016)Fast optical layer mesh protection using pre-cross-connected trails, , and . CoRR, (2002)Improved Approximation Algorithms for Capacitated Facility Location Problems., and . IPCO, volume 1610 of Lecture Notes in Computer Science, page 99-113. Springer, (1999)Efficient solutions to relaxations of combinatorial problems with submodular penalties via the Lovász extension and non-smooth convex optimization., and . SODA, page 79-88. SIAM, (2007)Solving SAT (and MaxSAT) with a quantum annealer: Foundations, encodings, and preliminary results., , , , , and . Inf. Comput., (2020)Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines That Run at Fifferent Speeds (Extended Abstract)., and . SODA, page 581-590. ACM/SIAM, (1997)Solving SAT and MaxSAT with a Quantum Annealer: Foundations, Encodings, and Preliminary Results., , , , , and . CoRR, (2018)Improved approximation algorithms for capacitated facility location problems., and . Math. Program., 102 (2): 207-222 (2005)Improved Approximation Schemes for Linear Programming Relaxations of Combinatorial Optimization Problems., and . IPCO, volume 3509 of Lecture Notes in Computer Science, page 81-96. Springer, (2005)