Fetching the paper…
Reading the bibliography…
Through recent progress in hardware development, quantum computers have advanced to the point where benchmarking of (heuristic) quantum algorithms at scale is within reach.
Tres observaciones sobre el algebra lineal
Garrett Birkhoff · 1946
Earlier work this paper cites.
Portfolio Selection
Harry Markowitz · 1952
Earlier work this paper cites.
Round Robin Mathematics
J. E. Freund · 1956
Earlier work this paper cites.
The Truck Dispatching Problem
George B Dantzig and John H Ramser · 1959
Earlier work this paper cites.
Diagonals of doubly stochastic matrices
Marvin Marcus and Rimhak Ree · 1959
Earlier work this paper cites.
On Moore graphs with diameters 2 and 3
Alan J Hoffman and Robert R Singleton · 1960
Earlier work this paper cites.
Teaching combinatorial tricks to a computer
Derrick H Lehmer · 1960
Earlier work this paper cites.
Integer programming formulation of traveling salesman problems
C. E. Miller, A. W. Tucker, and R. A. Zemlin · 1960
Earlier work this paper cites.
Scheduling of vehicles from a central depot to a number of delivery points
G. Clarke and J. W. Wright · 1964
Earlier work this paper cites.
Binary pulse compression codes
A Boehmer · 1967
Earlier work this paper cites.
Lifetime portfolio selection under uncertainty: The continuous-time case
Robert C. Merton · 1969
Earlier work this paper cites.
Synthesis of low-peak-factor signals and binary sequences with low autocorrelation (corresp.)
Manfred Schroeder · 1970
Earlier work this paper cites.
Steiner’s problem in graphs and its implications
S Louis Hakimi · 1971
Earlier work this paper cites.
Algorithm for shortest connection of a group of graph vertices
Anatoly Y. Levin · 1971
Earlier work this paper cites.
Reducibility among combinatorial problems
Richard M. Karp · 1972
Earlier work this paper cites.
A lower bound on the average shortest path length in regular graphs
Vinton G Cerf, Donald D Cowan, Ronald C Mullin, and RG Stanton · 1974
Earlier work this paper cites.
Reduction of bivalent maximization to the quadratic case
Rosenberg I · 1975
Earlier work this paper cites.
Multiperiod consumption and investment behavior with convex transactions costs
George M Constantinides · 1979
Earlier work this paper cites.
LINPACK users’ guide
Jack J Dongarra, Cleve Barry Moler, James R Bunch, and Gilbert W Stewart · 1979
Earlier work this paper cites.
Computers and Intractability: A Guide to the Theory of NP-Completeness
M.R. Garey and D.S. Johnson · 1979
Earlier work this paper cites.
Empirical Bayes Estimation of the Multivariate Normal Covariance Matrix
L. R. Haff · 1980
Earlier work this paper cites.
Scheduling in sports
D. de Werra · 1981
Earlier work this paper cites.
Complexity of vehicle routing and scheduling problems
J. K. Lenstra and A. H. G. Rinnooy Kan · 1981
Earlier work this paper cites.
A t = O ( 2 n / 2 ) t={O}(2^{n/2}) , s = O ( 2 n / 4 ) s={O}(2^{n/4}) algorithm for certain NP-complete problems
Richard Schroeppel and Adi Shamir · 1981
Earlier work this paper cites.
Notes on the birkhoff algorithm for doubly stochastic matrices
Richard A Brualdi · 1982
Earlier work this paper cites.
Notes on the birkhoff algorithm for doubly stochastic matrices
Richard A. Brualdi · 1982
Earlier work this paper cites.
Arbitrage, Factor Structure, and Mean-Variance Analysis on Large Asset Markets
Gary Chamberlain and Michael Rothschild · 1983
Earlier work this paper cites.
Network design and transportation planning: Models and algorithms
Thomas L Magnanti and Richard T Wong · 1984
Earlier work this paper cites.
Diameters of communication networks
Fan RK Chung · 1986
Earlier work this paper cites.
Tailoring Benders decomposition for uncapacitated network design
Thomas L Magnanti, Paul Mireault, and Richard T Wong · 1986
Earlier work this paper cites.
Diameters of graphs: Old problems and new results
Fan RK Chung · 1987
Earlier work this paper cites.
Unit disk graphs
Brent N. Clark, Charles J. Colbourn, and David S. Johnson · 1990
Earlier work this paper cites.
Topological design of telecommunication networks-local access design methods
Bezalel Gavish · 1991
Earlier work this paper cites.
The Art of Computer Systems Performance Analysis: Techniques For Experimental Design, Measurement, Simulation, and Modeling
Raj Jain · 1991
Earlier work this paper cites.
Global Portfolio Optimization
Fischer Black and Robert Litterman · 1992
Earlier work this paper cites.
Computational experience with a difficult mixedinteger multicommodity flow problem
Daniel Bienstock and Oktay Günlük · 1995
Earlier work this paper cites.
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
Michel X. Goemans and David P. Williamson · 1995
Earlier work this paper cites.
Simple heuristics for unit disk graphs
M. V. Marathe, H. Breu, H. B. Hunt III, S. S. Ravi, and D. J. Rosenkrantz · 1995
Earlier work this paper cites.
Probabilistic diversification and intensification in local search for vehicle routing
Yves Rochat and Éric D. Taillard · 1995
Earlier work this paper cites.
Polynomial time approximation schemes for euclidean tsp and other geometric problems
Sanjeev Arora · 1996
Earlier work this paper cites.
Computational study of a family of mixed-integer quadratic programming problems
Daniel Bienstock · 1996
Earlier work this paper cites.
Air network design for express shipment service
Cynthia Barnhart and Rina R Schneur · 1996
Earlier work this paper cites.
Packing Steiner trees: polyhedral investigations
Martin Grötschel, Alexander Martin, and Robert Weismantel · 1996
Earlier work this paper cites.
Packing Steiner trees: separation algorithms
Martin Grötschel, Alexander Martin, and Robert Weismantel · 1996
Earlier work this paper cites.
Strengths and weaknesses of quantum computing
Charles H Bennett, Ethan Bernstein, Gilles Brassard, and Umesh Vazirani · 1997
Earlier work this paper cites.
The Steiner tree packing problem in VLSI design
Martin Grötschel, Alexander Martin, and Robert Weismantel · 1997
Earlier work this paper cites.
Label placement by maximum independent set in rectangles
Pankaj K Agarwal, Marc Van Kreveld, and Subhash Suri · 1998
Earlier work this paper cites.
Minimum cost capacity installation for multicommodity network flows
Daniel Bienstock, Sunil Chopra, Oktay Günlük, and Chih-Yang Tsai · 1998
Earlier work this paper cites.
On the ground states of the bernasconi model
Stephan Mertens and Christine Bessenrodt · 1998
Earlier work this paper cites.
Scheduling a major college basketball conference
G. L. Nemhauser and M. A. Trick · 1998
Earlier work this paper cites.
Robust solutions of uncertain linear programs
A. Ben-Tal and A. Nemirovski · 1999
Earlier work this paper cites.
A quantum algorithm for finding the minimum, 1999
Christoph Durr and Peter Hoyer · 1999
Earlier work this paper cites.
Class of hard small 0-1 programs
Milind Dawande Gérard Cornuéjols · 1999
Earlier work this paper cites.
Multicommodity capacitated network design
Bernard Gendron, Teodor Gabriel Crainic, and Antonio Frangioni · 1999
Earlier work this paper cites.
Noise Dressing of Financial Correlation Matrices
Laurent Laloux, Pierre Cizeau, Jean-Philippe Bouchaud, and Marc Potters · 1999
Earlier work this paper cites.
Market split and basis reduction: Towards a solution of the cornuéjols-dawande instances
Karen Aardal, Robert E. Bixby, Cor A. J. Hurkens, Arjen K. Lenstra, and Job W. Smeltink · 2000
Earlier work this paper cites.
Birkhoff-von neumann input buffered crossbar switches
Cheng-Shang Chang, Wen-Jyh Chen, and Hsiang-Yi Huang · 2000
Earlier work this paper cites.
SteinLib: An updated library on steiner tree problems in graphs
T. Koch, A. Martin, and S. Voß · 2000
Earlier work this paper cites.
Optimal execution of portfolio transactions
Neil Chriss Robert Almgren · 2000
Earlier work this paper cites.
Optimal portfolio policies with borrowing and shortsale constraints
Lucie Tepla · 2000
Earlier work this paper cites.
Composite variable formulations for express shipment service network design
Andrew P Armacost, Cynthia Barnhart, and Keith A Ware · 2002
Earlier work this paper cites.
The market for borrowing stock
Gene D’avolio · 2002
Earlier work this paper cites.
On the power of unique 2-prover 1-round games
Subhash Khot · 2002
Earlier work this paper cites.
Models, relaxations and exact approaches for the capacitated vehicle routing problem
Paolo Toth and Daniele Vigo · 2002
Earlier work this paper cites.
The Vehicle Routing Problem
Paolo Toth and Daniele Vigo · 2002
Earlier work this paper cites.
Attacking the market split problem with lattice point enumeration
Alfred Wassermann · 2002
Earlier work this paper cites.
Implementing the Dantzig-Fulkerson-Johnson Algorithm for Large Traveling Salesman Problems
David Applegate, Robert Bixby, Vašek Chvátal, and William Cook · 2003
Earlier work this paper cites.
Packing Steiner trees
Kamal Jain, Mohammad Mahdian, and Mohammad R Salavatipour · 2003
Earlier work this paper cites.
Algorithms for the Steiner problem in networks
Tobias Polzin · 2003
Earlier work this paper cites.
Combinatorial Optimization
Alexander Schrijver · 2003
Earlier work this paper cites.
Rapid Mathematical Programming
Thorsten Koch · 2004
Earlier work this paper cites.
Robust asset allocation
R.H. Tütüncü and M. Koenig · 2004
Earlier work this paper cites.
Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness
Cristina Bazgan, Bruno Escoffier, and Vangelis Th. Paschos · 2005
Earlier work this paper cites.
Optimal portfolio selection and dynamic benchmark tracking
Alexei A Gaivoronski, Sergiy Krylov, and Nico Van der Wijst · 2005
Earlier work this paper cites.
Optimal versus naive diversification: How inefficient is the 1/n portfolio strategy?
Victor DeMiguel, Lorenzo Garlappi, and Raman Uppal · 2007
Earlier work this paper cites.
Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
Subhash Khot, Guy Kindler, Elchanan Mossel, and Ryan O’Donnell · 2007
Earlier work this paper cites.
On the effects of minor changes in model formulations
Tobias Achterberg, Thorsten Koch, and Andreas Tuchscherer · 2008
Earlier work this paper cites.
Efficient Asset Management: A Practical Guide to Stock Portfolio Optimization and Asset Allocation
Richard O. Michaud and Robert O. Michaud · 2008
Earlier work this paper cites.
There are 1,132,835,421,602,062,347 nonisomorphic one-factorizations of K 14 {K}_{14}
P. Kaski and P. RJ Östergård · 2009
Earlier work this paper cites.
Bayesian Portfolio Analysis
Doron Avramov and Guofu Zhou · 2010
Earlier work this paper cites.
Round robin tournaments and three index assignments
D. Briskorn, A. Drexl, and F. C. R. Spieksma · 2010
Earlier work this paper cites.
Information relaxations and duality in stochastic dynamic programs
David B Brown, James E Smith, and Peng Sun · 2010
Earlier work this paper cites.
Dynamic portfolio optimization with transaction costs: Heuristics and dual bounds
David B Brown and James E Smith · 2011
Earlier work this paper cites.
Combinatorial optimization in VLSI design
S. Held, B. Korte, D. Rautenbach, and J. Vygen · 2011
Earlier work this paper cites.
SPEC Benchmarks
Matthias Müller, Brian Whitney, Robert Henschel, and Kalyan Kumaran · 2011
Earlier work this paper cites.
Small-world datacenters
Ji-Yong Shin, Bernard Wong, and Emin Gün Sirer · 2011
Earlier work this paper cites.
Steiner tree packing revisited
Nam-Dũng Hoàng and Thorsten Koch · 2012
Earlier work this paper cites.
Efficient measurement of quantum gate error by interleaved randomized benchmarking
Easwar Magesan, Jay M. Gambetta, B. R. Johnson, Colm A. Ryan, Jerry M. Chow, Seth T. Merkel, Marcus P. da Silva, George A. Keefe, Mary B. Rothwell, Thomas A. Ohki, Mark B. Ketchen, and M. Steffen · 2012
Cited alongside, same era.
Moore graphs and beyond: A survey of the degree/diameter problem
Mirka Miller and Jozef Sirán · 2012
Cited alongside, same era.
Jellyfish: Networking data centers randomly
Ankit Singla, Chi-Yao Hong, Lucian Popa, and P Brighten Godfrey · 2012
Cited alongside, same era.
Solving market split problems with heuristical lattice reduction
Heiko Vogel · 2012
Cited alongside, same era.
Measuring the impact of primal heuristics
Timo Berthold · 2013
Cited alongside, same era.
Dynamic trading with predictable returns and transaction costs
Nicolae Gârleanu and Lasse Heje Pedersen · 2013
Which algorithm to select in sports timetabling?, 2023
David Van Bulck, Dries Goossens, Jan-Patrick Clarner, Angelos Dimitsas, George H. G. Fonseca, Carlos Lamas-Fernandez, Martin Mariusz Lester, Jaap Pedersen, Antony E. Phillips, and Roberto Maria Rosati · 2023
Later among the works it cites.
Revisiting the approximate carathéodory problem via the frank-wolfe algorithm
Cyrille W Combettes and Sebastian Pokutta · 2023
Later among the works it cites.
Quantum-enhanced greedy combinatorial optimization solver
Maxime Dupont, Bram Evert, Mark J. Hodson, Bhuvanesh Sundar, Stephen Jeffrey, Yuki Yamaguchi, Dennis Feng, Filip B. Maciejewski, Stuart Hadfield, M. Sohaib Alam, Zhihui Wang, Shon Grabbe, P. Aaron Lott, Eleanor G. Rieffel, Davide Venturelli, and Matthew J. Reagor · 2023
Later among the works it cites.
Quantum computing: Lecture notes, 2023
Ronald de Wolf · 2023
Later among the works it cites.
VRPSolverEasy: A Python library for the exact solution of a rich vehicle routing problem
Najib Errami, Eduardo Queiroga, Ruslan Sadykov, and Eduardo Uchoa · 2023
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Revisiting Frank-Wolfe: Projection-free sparse convex optimization
Martin Jaggi · 2013
Cited alongside, same era.
Slim fly: A cost effective low-diameter network topology
Maciej Besta and Torsten Hoefler · 2014
Cited alongside, same era.
A quantum approximate optimization algorithm, 11 2014
Edward Farhi, Jeffrey Goldstone, and Sam Gutmann · 2014
Cited alongside, same era.
60 Years of portfolio optimization: Practical challenges and current trends
Petter N. Kolm, Reha Tütüncü, and Frank J. Fabozzi · 2014
Cited alongside, same era.
Ising formulations of many NP problems
Andrew Lucas · 2014
Cited alongside, same era.
Scheduling techniques for hybrid circuit/packet networks
He Liu, Matthew K Mukerjee, Conglong Li, Nicolas Feltman, George Papen, Stefan Savage, Srinivasan Seshan, Geoffrey M Voelker, David G Andersen, Michael Kaminsky, et al · 2015
Cited alongside, same era.
Solving break minimization problems in mirrored double round-robin tournament with QUBO solver, 2023
K. Fujii and T. Matsui · 2023
Later among the works it cites.
Me, myself and I: A general theory of non-Markovian time-inconsistent stochastic control for sophisticated agents
Camilo Hernández and Dylan Possamaï · 2023
Later among the works it cites.
Evidence for the utility of quantum computing before fault tolerance
Youngseok Kim, Andrew Eddins, Sajant Anand, Ken Xuan Wei, Ewout van den Berg, Sami Rosenblatt, Hasan Nayfeh, Yantao Wu, Michael Zaletel, Kristan Temme, and Abhinav Kandala · 2023
Later among the works it cites.
Qubit efficient quantum algorithms for the vehicle routing problem on nisq processors
Ioannis D Leonidas, Alexander Dukakis, Benjamin Tan, and Dimitris G Angelakis · 2023
Later among the works it cites.
Analysis of the vehicle routing problem solved via hybrid quantum algorithms in the presence of noisy channels
Nishikanta Mohanty, Bikash K Behera, and Christopher Ferrie · 2023
Later among the works it cites.
Heuristics and metaheuristics for solving capacitated vehicle routing problem: An algorithm comparison
Dihin Muriyatmoko, Arif Djunaidy, and Ahmad Muklason · 2023
Later among the works it cites.
Benchmarking quantum processor performance at scale, 2023
David C. McKay, Ian Hincks, Emily J. Pritchett, Malcolm Carroll, Luke C. G. Govia, and Seth T. Merkel · 2023
Later among the works it cites.
Diverse adaptive bulk search: a framework for solving qubo problems on multiple gpus
Koji Nakano, Daisuke Takafuji, Yasuaki Ito, Takashi Yazane, Junko Yano, Shiro Ozaki, Ryota Katsuki, and Rie Mori · 2023
Later among the works it cites.
Quantum software architecture blueprints for the cloud: Overview and application to peer-2-peer energy trading
Corey O’Meara, Marina Fernández-Campoamor, Giorgio Cortiana, and Juan Bernabé-Moreno · 2023
Later among the works it cites.
Implications, Conflicts, and Reductions for Steiner Trees
Daniel Rehfeldt and Thorsten Koch · 2023
Later among the works it cites.
Power distribution network expansion planning to improve resilience
Reza Saberi, Hamid Falaghi, Mostafa Esmaeeli, Maryam Ramezani, Ali Ashoornezhad, and Reza Izadpanah · 2023
Later among the works it cites.
Instance space analysis for algorithm testing: Methodology and software tools
K. Smith-Miles and M. A. Muñoz · 2023
Later among the works it cites.
A traditional Benders’ approach to sports timetabling
D. Van Bulck and D. Goossens · 2023
Later among the works it cites.
The international timetabling competition on sports timetabling (ITC2021)
D. Van Bulck and D. Goossens · 2023
Later among the works it cites.
The international timetabling competition on sports timetabling (itc2021)
David Van Bulck and Dries Goossens · 2023
Later among the works it cites.
On the generation of metric tsp instances with a large integrality gap by branch-and-cut
Eleonora Vercesi, Stefano Gualandi, Monaldo Mastrolilli, and Luca Maria Gambardella · 2023
Later among the works it cites.
Integer programming models for round robin tournaments
J. van Doornmalen, C. Hojny, R. Lambers, and F. C. R. Spieksma · 2023
Later among the works it cites.
QUBO.jl: A julia ecosystem for quadratic unconstrained binary optimization, 2023
Pedro Maciel Xavier, Pedro Ripper, Tiago Andrade, Joaquim Dias Garcia, Nelson Maculan, and David E. Bernal Neira · 2023
Later among the works it cites.
Challenges and opportunities in quantum optimization
Amira Abbas, Andris Ambainis, Brandon Augustino, Andreas Bärtschi, Harry Buhrman, Carleton Coffrin, Giorgio Cortiana, Vedran Dunjko, Daniel J. Egger, Bruce G. Elmegreen, Nicola Franco, Filippo Fratini, Bryce Fuller, Julien Gacon, Constantin Gonciulea, Sander Gribling, Swati Gupta, Stuart Hadfield, Raoul Heese, Gerhard Kircher, Thomas Kleinert, Thorsten Koch, Georgios Korpas, Steve Lenk, Jakub Marecek, Vanio Markov, Guglielmo Mazzola, Stefano Mensa, Naeimeh Mohseni, Giacomo Nannicini, Corey O’Meara, Elena Peña Tapia, Sebastian Pokutta, Manuel Proissl, Patrick Rebentrost, Emre Sahin, Benjamin C. B. Symons, Sabine Tornow, Víctor Valls, Stefan Woerner, Mira L. Wolf-Bauwens, Jon Yard, Sheir Yarkoni, Dirk Zechiel, Sergiy Zhuk, and Christa Zoufal · 2024
Later among the works it cites.
Benchmarking quantum computers: Towards a standard performance evaluation approach, 2024
Arturo Acuaviva, David Aguirre, Rubén Peña, and Mikel Sanz · 2024
Later among the works it cites.
Alleviating the quantum Big- M M problem, 2024
Edoardo Alessandroni, Sergi Ramos-Calderer, Ingo Roth, Emiliano Traversi, and Leandro Aolita · 2024
Later among the works it cites.
David E Bernal Neira, Robin Brown, Pratik Sathe, Filip Wudarski, Marco Pavone, Eleanor G Rieffel, and Davide Venturelli · 2024
Later among the works it cites.
Learning to handle complex constraints for vehicle routing problems, 2024
Jieyi Bi, Yining Ma, Jianan Zhou, Wen Song, Zhiguang Cao, Yaoxin Wu, and Jie Zhang · 2024
Later among the works it cites.
Bias-field digitized counterdiabatic quantum optimization, 2024
Alejandro Gomez Cadavid, Archismita Dalal, Anton Simen, Enrique Solano, and Narendra N. Hegade · 2024
Later among the works it cites.
Quantum Optimization for the Maximum Cut Problem on a Superconducting Quantum Computer, 2024
Maxime Dupont, Bhuvanesh Sundar, Bram Evert, David E. Bernal Neira, Zedong Peng, Stephen Jeffrey, and Mark J. Hodson · 2024
Later among the works it cites.
Exploring the capacitated vehicle routing problem using the power of machine learning: A literature review
Manal El Jaouhari, Ghita Bencheikh, and Ghizlane Bencheikh · 2024
Later among the works it cites.
Hybrid Quantum Tabu Search for Solving the Vehicle Routing Problem, 2024
James Holliday, Braeden Morgan, Hugh Churchill, and Khoa Luu · 2024
Later among the works it cites.
Quantum computing with Qiskit, 2024
Ali Javadi-Abhari, Matthew Treinish, Kevin Krsulich, Christopher J. Wood, Jake Lishman, Julien Gacon, Simon Martiel, Paul D. Nation, Lev S. Bishop, Andrew W. Cross, Blake R. Johnson, and Jay M. Gambetta · 2024
Later among the works it cites.
Optimization by decoded quantum interferometry, 2024
Stephen P. Jordan, Noah Shutty, Mary Wootters, Adam Zalcman, Alexander Schmidhuber, Robbie King, Sergei V. Isakov, and Ryan Babbush · 2024
Later among the works it cites.
Graph golf: the order/degree problem competition, 2015
Michihiro Koibuchi, Ikki Fujiwara, Shoichi Hirasawa, Ryota Yasudo, Satoshi Fujita, Koji Nakano, Takeaki Uno, Takeru Inoue, and Ken-ichi Kawarabayashi · 2024
Later among the works it cites.
Optimization applications as quantum performance benchmarks, 2024
Thomas Lubinski, Carleton Coffrin, Catherine McGeoch, Pratik Sathe, Joshua Apanavicius, David Bernal Neira, Quantum Economic Development Consortium, et al · 2024
Later among the works it cites.
Neural combinatorial optimization with heavy decoder: Toward large scale generalization, 2024
Fu Luo, Xi Lin, Fei Liu, Qingfu Zhang, and Zhenkun Wang · 2024
Later among the works it cites.
A quantum online portfolio optimization algorithm
Debbie Lim and Patrick Rebentrost · 2024
Later among the works it cites.
Quantum theory and application of contextual optimal transport, 2024
Nicola Mariella, Albert Akhriev, Francesco Tacchino, Christa Zoufal, Juan Carlos Gonzalez-Espitia, Benedek Harsanyi, Eugene Koskin, Ivano Tavernelli, Stefan Woerner, Marianna Rapsomaniki, Sergiy Zhuk, and Jannis Born · 2024
Later among the works it cites.
IBM’s Big Bet on the Quantum-Centric Supercomputer
Ryan Mandelbaum, Antonio D. Corcoles, and Jay Gambetta · 2024
Later among the works it cites.
How not to fool the masses when giving performance results for quantum computers, 2024
Catherine McGeoch · 2024
Later among the works it cites.
Benchmarking the performance of quantum computing software, 2024
Paul D. Nation, Abdullah Ash Saki, Sebastian Brandhofer, Luciano Bello, Shelly Garion, Matthew Treinish, and Ali Javadi-Abhari · 2024
Later among the works it cites.
Short-depth QAOA circuits and quantum annealing on higher-order Ising models
Elijah Pelofske, Andreas Bärtschi, and Stephan Eidenbenz · 2024
Later among the works it cites.
Benchmarking quantum computers, 2024
Timothy Proctor, Kevin Young, Andrew D. Baczewski, and Robin Blume-Kohout · 2024
Later among the works it cites.
Solving maximum independent set problems and analysis of the influence of various constraint classes
Fabian Rivetta · 2024
Later among the works it cites.
Bias-field digitized counterdiabatic quantum algorithm for higher-order binary optimization
Sebastián V Romero, Anne-Maria Visuri, Alejandro Gomez Cadavid, Enrique Solano, and Narendra N Hegade · 2024
Later among the works it cites.
Squeezing and quantum approximate optimization
Gopal Chandra Santra, Fred Jendrzejewski, Philipp Hauke, and Daniel J. Egger · 2024
Later among the works it cites.
Evidence of scaling advantage for the quantum approximate optimization algorithm on a classically intractable problem
Ruslan Shaydulin, Changhao Li, Shouvanik Chakrabarti, Matthew DeCross, Dylan Herman, Niraj Kumar, Jeffrey Larson, Danylo Lykov, Pierre Minssen, Yue Sun, Yuri Alexeev, Joan M. Dreiling, John P. Gaebler, Thomas M. Gatterman, Justin A. Gerber, Kevin Gilmore, Dan Gresh, Nathan Hewitt, Chandler V. Horst, Shaohan Hu, Jacob Johansen, Mitchell Matheny, Tanner Mengle, Michael Mills, Steven A. Moses, Brian Neyenhuis, Peter Siegfried, Romina Yalovetzky, and Marco Pistoia · 2024
Later among the works it cites.
Which algorithm to select in sports timetabling?
D. Van Bulck, D. Goossens, J.P. Clarner, A. Dimitsas, G. H.G. Fonseca, C. Lamas-Fernandez, M. M. Lester, J. Pedersen, A. E. Phillips, and R. M. Rosati · 2024
Later among the works it cites.
Towards an automatic framework for solving optimization problems with quantum computers
Deborah Volpe, Nils Quetschlich, Mariagrazia Graziano, Giovanna Turvani, and Robert Wille · 2024
Later among the works it cites.
Variational benchmarks for quantum many-body problems
Dian Wu, Riccardo Rossi, Filippo Vicentini, Nikita Astrakhantsev, Federico Becca, Xiaodong Cao, Juan Carrasquilla, Francesco Ferrari, Antoine Georges, Mohamed Hibat-Allah, Masatoshi Imada, Andreas M. Läuchli, Guglielmo Mazzola, Antonio Mezzacapo, Andrew Millis, Javier Robledo Moreno, Titus Neupert, Yusuke Nomura, Jannes Nys, Olivier Parcollet, Rico Pohle, Imelda Romero, Michael Schmid, J. Maxwell Silvester, Sandro Sorella, Luca F. Tocchio, Lei Wang, Steven R. White, Alexander Wietek, Qi Yang, Yiqi Yang, Shiwei Zhang, and Giuseppe Carleo · 2024
Later among the works it cites.
Solving non-native combinatorial optimization problems using hybrid quantum-classical algorithms, 2024
Jonathan Wurtz, Stefan Sack, and Sheng-Tao Wang · 2024
Later among the works it cites.
A feasibility-preserved quantum approximate solver for the capacitated vehicle routing problem
Ningyi Xie, Xinwei Lee, Dongsheng Cai, Yoshiyuki Saito, Nobuyoshi Asai, and Hoong Chuin Lau · 2024
Later among the works it cites.
Disjunctive programming meets QUBO
Pedro Maciel Xavier, Pedro Ripper, Joshua Pulsipher, Joaquim Dias Garcia, Nelson Maculan, and David E Bernal Neira · 2024
Later among the works it cites.
https://github.com/qiskit-community/qopt-best-practices
Best practices in quantum optimization · 2025
Closest in time.
Rl4co: an extensive reinforcement learning for combinatorial optimization benchmark, 2025
Federico Berto, Chuanbo Hua, Junyoung Park, Laurin Luttmann, Yining Ma, Fanchen Bu, Jiarui Wang, Haoran Ye, Minsu Kim, Sanghyeok Choi, Nayeli Gast Zepeda, André Hottung, Jianan Zhou, Jieyi Bi, Yu Hu, Fei Liu, Hyeonah Kim, Jiwoo Son, Haeyeon Kim, Davide Angioni, Wouter Kool, Zhiguang Cao, Qingfu Zhang, Joungho Kim, Jie Zhang, Kijung Shin, Cathy Wu, Sungsoo Ahn, Guojie Song, Changhyun Kwon, Kevin Tierney, Lin Xie, and Jinkyoo Park · 2025
Closest in time.
https://github.com/vvalls/BirkhoffDecomposition.jl
Code for Birkhoff Decomposition · 2025
Closest in time.
https://www.ibm.com/products/ilog-cplex-optimization-studio , 2025
CPLEX · 2025
Closest in time.
[Online; accessed July-18-2025]
Nvidia cuopt / rotuing · 2025
Closest in time.
https://miplib.zib.de/instance_details_dano3mip.html
dano3mip · 2025
Closest in time.
http://dimacs.rutgers.edu/programs/challenge
DIMACS Implementation Challenges · 2025
Closest in time.
https://github.com/ZIB-IOL/FrankWolfe.jl
Frankwolfe · 2025
Closest in time.
AppQSim: Application-oriented benchmarks for Hamiltonian simulation on a quantum computer, 2025
Etienne Granet and Henrik Dreyer · 2025
Closest in time.
IBM Quantum delivers on performance challenge made two years ago
Jay Gambetta and Ryan Mandelbaum · 2025
Closest in time.
[Online; accessed July-18-2025]
Google or tools / routing · 2025
Closest in time.
https://www.gurobi.com/solutions/gurobi-optimizer/ , 2025
Gurobi · 2025
Closest in time.
https://github.com/vidalt/HGS-CVRP
HGS-CVRP · 2025
Closest in time.
IBM Quantum Platform
IBM Quantum · 2025
Closest in time.
https://docs.quantum.ibm.com/guides/docs.quantum.ibm.com/guides/kipu-optimization
Iskay Quantum Optimizer - A Qiskit Function by Kipu Quantum · 2025
Closest in time.
https://robinxval.ugent.be/ITC2021/index.php
International timetabling competition on sports timetabling 2021 · 2025
Closest in time.
A gpu accelerated variant of schroeppel-shamir’s algorithm for solving the market split problem
Nils-Christian Kempke and Thorsten Koch · 2025
Closest in time.
https://github.com/AlejoKQ/data_LABS_BF-DCQO_Benchmark/tree/main
LABS BF-DCQO Benchmark · 2025
Closest in time.
A review and collection of metrics and benchmarks for quantum computers: definitions, methodologies and software, 2025
Deep Lall, Abhishek Agarwal, Weixi Zhang, Lachlan Lindoy, Tobias Lindström, Stephanie Webster, Simon Hall, Nicholas Chancellor, Petros Wallden, Raul Garcia-Patron, Elham Kashefi, Viv Kendon, Jonathan Pritchard, Alessandro Rossi, Animesh Datta, Theodoros Kapourniotis, Konstantinos Georgopoulos, and Ivan Rungger · 2025
Closest in time.
[Online; accessed July-18-2025]
Lkh3 · 2025
Closest in time.
Systematic benchmarking of quantum computers: status and recommendations, 2025
Jeanette Miriam Lorenz, Thomas Monz, Jens Eisert, Daniel Reitzner, Félicien Schopfer, Frédéric Barbaresco, Krzysztof Kurowski, Ward van der Schoot, Thomas Strohm, Jean Senellart, Cécile M. Perrault, Martin Knufinke, Ziyad Amodjee, and Mattia Giardini · 2025
Closest in time.
https://www.minlplib.org/index.html , 2024
MINLPLib: A library of mixed-integer and continuous nonlinear programming instances · 2025
Closest in time.
Decision Tree for Optimization Software
Hans Mittelmann · 2025
Closest in time.
https://github.com/eggerdj/independent_set_benchmarking
Independent set benchmarking · 2025
Closest in time.
https://github.com/qiskit-community/qiskit-optimization
Qiskit Ecosystem: Qiskit Optimization · 2025
Closest in time.
https://git.zib.de/qopt/qoblib-quantum-optimization-benchmarking-library/
Quantum Optimization Benchmarking Library · 2025
Closest in time.
https://abs2.cs.hiroshima-u.ac.jp/home , 2025
QUBO++ with ABS2 GPU QUBO Solver · 2025
Closest in time.
Challenge problems: Independent sets in graphs
N. J. A. Sloane · 2025
Closest in time.
[Online; accessed 11-March-2025]
https://vrpsolver.math.u-bordeaux.fr · 2025
Closest in time.
[Online; accessed 11-March-2025]
https://github.com/inria-UFF/VRPSolverEasy · 2025
Closest in time.
private communication, paper in preparation
Alfred Wassermann, 2025 · 2025
Closest in time.
New improvements in solving large labs instances using massively parallelizable memetic tabu search, 2025
Zhiwei Zhang, Jiayu Shen, Niraj Kumar, and Marco Pistoia · 2025
Closest in time.