Fetching the paper…
Reading the bibliography…
Mixed Integer Programs (MIPs) model many optimization problems of interest in Computer Science, Operations Research, and Financial Engineering.
An automatic method of solving discrete programming problems
A. H. Land and A. G. Doig · 1960
Earlier work this paper cites.
On the evolution of random graphs
Paul Erdős, Alfréd Rényi, et al · 1960
Earlier work this paper cites.
Reducibility among combinatorial problems
Richard M Karp · 1972
Earlier work this paper cites.
Solvable model of a spin-glass
David Sherrington and Scott Kirkpatrick · 1975
Earlier work this paper cites.
Integer programming models for sales resource allocation
Andris A Zoltners and Prabhakant Sinha · 1980
Earlier work this paper cites.
Integer polyhedra arising from certain network design problems with connectivity constraints
Martin Grötschel and Clyde L Monma · 1990
Earlier work this paper cites.
A time indexed formulation of non-preemptive single machine scheduling problems
Jorge P Sousa and Laurence A Wolsey · 1992
Earlier work this paper cites.
Polyhedral and computational investigations for designing communication networks with high survivability requirements
Martin Grötschel, Clyde L Monma, and Mechthild Stoer · 1995
Earlier work this paper cites.
Combinatorial Optimization : Algorithms and Complexity
Christos H. Papadimitriou and Kenneth Steiglitz · 1998
Earlier work this paper cites.
A polyhedral approach to single-machine scheduling problems
JM Van den Akker, CPM Van Hoesel, and Martin WP Savelsbergh · 1999
Earlier work this paper cites.
Branch and bound algorithms-principles and examples
Jens Clausen · 1999
Earlier work this paper cites.
On the best search strategy in parallel branch-and-bound: Best-first search versus lazy depth-first search
Jens Clausen and Michael Perregaard · 1999
Earlier work this paper cites.
Optimization Methods in Finance
G. Cornuejols and R. Tütüncü · 2006
Cited alongside, same era.
V12. 1: User’s manual for cplex
IBM ILOG Cplex · 2009
Cited alongside, same era.
Quantum algorithm for linear systems of equations
Aram W. Harrow, Avinatan Hassidim, and Seth Lloyd · 2009
Cited alongside, same era.
Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning
David R. Morrison, Sheldon H. Jacobson, Jason J. Sauppe, and Edward C. Sewell · 2016
Cited alongside, same era.
Low autocorrelation binary sequences
Tom Packebusch and Stephan Mertens · 2016
Cited alongside, same era.
Quantum speed-ups for solving semidefinite programs
Fernando GSL Brandao and Krysta M Svore · 2017
Cited alongside, same era.
A Unified Framework of Quantum Walk Search
Simon Apers, András Gilyén, and Stacey Jeffery · 2019
Later among the works it cites.
Quantum algorithms for portfolio optimization
Iordanis Kerenidis, Anupam Prakash, and Dániel Szilágyi · 2019
Later among the works it cites.
Verifying the output of quantum optimizers with ground-state energy lower bounds
Flavio Baccari, Christian Gogolin, Peter Wittek, and Antonio Acín · 2020
Later among the works it cites.
Convex optimization using quantum oracles
Joran van Apeldoorn, András Gilyén, Sander Gribling, and Ronald de Wolf · 2020
Later among the works it cites.
Quantum algorithms and lower bounds for convex optimization
Shouvanik Chakrabarti, Andrew M Childs, Tongyang Li, and Xiaodi Wu · 2020
Later among the works it cites.
A quantum interior point method for lps and sdps
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Quantum algorithm for tree size estimation, with applications to backtracking and 2-player games
Andris Ambainis and Martins Kokainis · 2017
Cited alongside, same era.
Quantum SDP Solvers: Large Speed-ups, Optimality, and Applications to Quantum Learning
Fernando G. S. L. Brandão, Amir Kalev, Tongyang Li, Cedric Yen-Yu Lin, Krysta M. Svore, and Xiaodi Wu · 2017
Cited alongside, same era.
Quantum-walk speedup of backtracking algorithms
Ashley Montanaro · 2018
Cited alongside, same era.
Improved quantum backtracking algorithms using effective resistance estimates
Michael Jarret and Kianna Wan · 2018
Cited alongside, same era.
Quantum computational finance: quantum algorithm for portfolio optimization
Patrick Rebentrost and Seth Lloyd · 2018
Cited alongside, same era.
Sublinear quantum algorithms for training linear and kernel-based classifiers
Tongyang Li, Shouvanik Chakrabarti, and Xiaodi Wu · 2019
Cited alongside, same era.
Iordanis Kerenidis and Anupam Prakash · 2020
Later among the works it cites.
Quantum speedup of branch-and-bound algorithms
Ashley Montanaro · 2020
Later among the works it cites.
Gurobi Optimizer Reference Manual, 2021
Gurobi Optimization, LLC · 2021
Later among the works it cites.
Sublinear classical and quantum algorithms for general matrix games
Tongyang Li, Chunhao Wang, Shouvanik Chakrabarti, and Xiaodi Wu · 2021
Later among the works it cites.
Nisq-hhl: Portfolio optimization for near-term quantum hardware, 2021
Romina Yalovetzky, Pierre Minssen, Dylan Herman, and Marco Pistoia · 2021
Later among the works it cites.
IOHanalyzer: Detailed performance analyses for iterative optimization heuristics
Hao Wang, Diederick Vermetten, Furong Ye, Carola Doerr, and Thomas Bäck · 2022
Closest in time.