Get started
Author

Fabián A. Chudak

Discrete optimization using quantum annealing on sparse Ising models
2014 · Zhengbing Bian, Fabian Chudak, et al. · Frontiers in Physics · 137
PDF
Improved Approximation Algorithms for Capacitated Facility Location Problems
1999 · Fabián A. Chudak, David P. Williamson · Lecture notes in computer science · 130
A 3-approximation algorithm for the -level uncapacitated facility location problem
1999 · Karen Aardal, Fabián A. Chudak, et al. · Information Processing Letters · 119
Improved Approximation Algorithms for Uncapacitated Facility Location
1998 · Fabián A. Chudak · Lecture notes in computer science · 118
Experimental Determination of Ramsey Numbers
2013 · Zhengbing Bian, Fabian Chudak, et al. · Physical Review Letters · 105
PDF
Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines that Run at Different Speeds
1999 · Fabián A Chudak, David B Shmoys · Journal of Algorithms · 104
A New Resource-Constrained Multicommodity Flow Model for Conflict-Free Train Routing and Scheduling
2010 · G. Caimi, F. Chudak, et al. · Transportation Science · 103
A primal–dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs
1998 · Fabián A. Chudak, Michel X. Goemans, et al. · Operations Research Letters · 96
Mapping Constrained Optimization Problems to Quantum Annealing with Application to Fault Diagnosis
2016 · Zhengbing Bian, Fabian Chudak, et al. · Frontiers in ICT · 91
PDF
Near-optimal solutions to large-scale facility location problems
2005 · Francisco Barahona, Fabián A. Chudak · Discrete Optimization · 88
PDF
Improved approximation algorithms for a capacitated facility location problem
1999 · Fabián A. Chudak, David B. Shmoys · 79
A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine
1999 · Fabián A. Chudak, Dorit S. Hochbaum · Operations Research Letters · 77
Fast Optical Layer Mesh Protection Using Pre-Cross-Connected Trails
2004 · T.Y. Chow, F. Chudak, et al. · IEEE/ACM Transactions on Networking · 76
PDF
Solving SAT (and MaxSAT) with a quantum annealer: Foundations, encodings, and preliminary results
2020 · Zhengbing Bian, Fabian Chudak, et al. · Information and Computation · 57
Design of a Railway Scheduling Model for Dense Services
2008 · Gabrio Caimi, Dan Burkolter, et al. · Networks and Spatial Economics · 49
Benchmarking Quantum Hardware for Training of Fully Visible Boltzmann Machines
2016 · Korenkevych, Dmytro, Xue, Yanbo, et al. · arXiv (Cornell University) · 39
PDF
Investigating the performance of an adiabatic quantum optimization processor
2011 · Kamran Karimi, Neil G. Dickson, et al. · Quantum Information Processing · 38
PDF
A min-sum 3/2-approximation algorithm for scheduling unrelated parallel machines
1999 · Fabián A. Chudak · Journal of Scheduling · 37
Solving SAT and MaxSAT with a Quantum Annealer: Foundations and a Preliminary Report
2017 · Zhengbing Bian, Fabian Chudak, et al. · Lecture notes in computer science · 32
PDF
Approximate k-MSTs and k-Steiner Trees via the Primal-Dual Method and Lagrangean Relaxation
2001 · Fabián A. Chudak, Tim Roughgarden, et al. · Lecture notes in computer science · 32
Efficient solutions to relaxations of combinatorial problems with submodular penalties via the Lovász extension and non-smooth convex optimization
2007 · Chudak, Fabian, Nagano, Kiyohito · Institutional Repositories DataBase (IRDB) · 31
Approximation algorithms for precedence-constrained scheduling problems on parallel machines that run at different speeds
1997 · Fabián A. Chudak, David B. Shmoys · 30
Solving Large Scale Uncapacitated Facility Location Problems
2000 · Francisco Barahona, Fabián A. Chudak · Nonconvex optimization and its applications · 29
Improved Approximation Schemes for Linear Programming Relaxations of Combinatorial Optimization Problems
2005 · Fabián A. Chudak, Vânia Eleutério · Lecture notes in computer science · 25
Improved Approximation Algorithms for Uncapitated Facility Location
1998 · Fabián A. Chudak · Integer Programming and Combinatorial Optimization · 11
Works count: 31
Citation count: 1,753
H-index: 24
I10-index: 25
Year
Topic
Type