# Fabián A. Chudak

According to our database

Collaborative distances:

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

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2018

Solving SAT and MaxSAT with a Quantum Annealer: Foundations, Encodings, and Preliminary Results.

CoRR, 2018

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

Benchmarking Quantum Hardware for Training of Fully Visible Boltzmann Machines.

CoRR, 2016

2012

Investigating the performance of an adiabatic quantum optimization processor.

Quantum Inf. Process., 2012

2011

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

Transportation Science, 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

Improved approximation algorithms for capacitated facility location problems.

Math. Program., 2005

Near-optimal solutions to large-scale facility location problems.

Discret. Optim., 2005

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

Proceedings of the Integer Programming and Combinatorial Optimization, 2005

2004

Fast optical layer mesh protection using pre-cross-connected trails.

IEEE/ACM Trans. Netw., 2004

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

Improved Approximation Algorithms for a Capacitated Facility Location Problem.

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

Improved Approximation Algorithms for Uncapitated Facility Location.

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