# Fabián A. Chudak

According to our database

Collaborative distances:

^{1}, Fabián A. Chudak authored at least 21 papers between 1997 and 2020.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2020

Solving SAT (and MaxSAT) with a quantum annealer: Foundations, encodings, and preliminary results.

Inf. Comput., 2020

2017

Solving SAT and MaxSAT with a Quantum Annealer: Foundations and a Preliminary Report.

Proceedings of the Frontiers of Combining Systems - 11th International Symposium, 2017

2016

Mapping Constrained Optimization Problems to Quantum Annealing with Application to Fault Diagnosis.

Frontiers ICT, 2016

CoRR, 2016

2012

Quantum Inf. Process., 2012

2011

A New Resource-Constrained Multicommodity Flow Model for Conflict-Free Train Routing and Scheduling.

Transp. Sci., 2011

2007

Efficient solutions to relaxations of combinatorial problems with submodular penalties via the Lovász extension and non-smooth convex optimization.

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

2005

Math. Program., 2005

Discret. Optim., 2005

Improved Approximation Schemes for Linear Programming Relaxations of Combinatorial Optimization Problems.

Proceedings of the Integer Programming and Combinatorial Optimization, 2005

2004

IEEE/ACM Trans. Netw., 2004

Approximate <i>k</i>-MSTs and <i>k</i>-Steiner trees via the primal-dual method and Lagrangean relaxation.

Math. Program., 2004

2003

Improved Approximation Algorithms for the Uncapacitated Facility Location Problem.

SIAM J. Comput., 2003

2001

Approximate k-MSTs and k-Steiner Trees via the Primal-Dual Method and Lagrangean Relaxation.

Proceedings of the Integer Programming and Combinatorial Optimization, 2001

1999

A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine.

Oper. Res. Lett., 1999

Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines that Run at Different Speeds.

J. Algorithms, 1999

A 3-Approximation Algorithm for the k-Level Uncapacitated Facility Location Problem.

Inf. Process. Lett., 1999

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

1998

A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs.

Oper. Res. Lett., 1998

Proceedings of the Integer Programming and Combinatorial Optimization, 1998

1997

Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines That Run at Fifferent Speeds (Extended Abstract).

Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997