Fetching the paper…
Reading the bibliography…
Integer linear programming (ILP) encompasses a very important class of optimization problems that are of great interest to both academia and industry.
Partitioning procedures for solving mixed-variables programming problems
Benders, J. F · 1962
Earlier work this paper cites.
HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS
Glover, F · 1977
Earlier work this paper cites.
Applying integer linear programming to the fleet assignment problem
Abara, J · 1989
Earlier work this paper cites.
Computers and Intractability; A Guide to the Theory of NP-Completeness (W. H. Freeman & Co., New York, NY, USA, 1990)
Garey, M. R. & Johnson, D. S · 1990
Earlier work this paper cites.
Theory of Linear Integer Programming (John Wiley & Sons, 1998)
Schrijver · 1998
Earlier work this paper cites.
Branch-and-price: Column generation for solving huge integer programs
Barnhart, C., Johnson, E. L., Nemhauser, G. L., Savelsbergh, M. W. & Vance, P. H · 1998
Earlier work this paper cites.
An analysis of monte carlo integer programming, simulated annealing, and tabu search heuristics for solving spatial harvest scheduling problems
Boston, K. & Bettinger, P · 1999
Earlier work this paper cites.
Logic-based benders decomposition
Hooker, J. N. & Ottosson, G · 2003
Earlier work this paper cites.
Staff scheduling at the united states postal service
Bard, J. F., Binici, C. et al · 2003
Earlier work this paper cites.
lp_solve 5.5, open source (mixed-integer) linear programming system
Berkelaar, M., Eikland, K. & Notebaert, P · 2004
Earlier work this paper cites.
Exploring relaxation induced neighborhoods to improve MIP solutions
Danna, E., Rothberg, E. & Pape, C. L · 2004
Earlier work this paper cites.
Mixed integer linear programming in process scheduling: Modeling, algorithms, and applications
Floudas, C. A. & Lin, X · 2005
Earlier work this paper cites.
Concorde tsp solver (2006)
Applegate, D., Bixby, R., Chvatal, V. & Cook, W · 2006
Earlier work this paper cites.
Operations research at container terminals: a literature update
Stahlbock, R. & Voß, S · 2008
Cited alongside, same era.
The new dutch timetable: The or revolution
Kroon, L. et al · 2009
Cited alongside, same era.
Facility location and supply chain management–a review
Melo, M. T., Nickel, S. & Saldanha-Da-Gama, F · 2009
Cited alongside, same era.
Computational Complexity: A Modern Approach (Cambridge University Press, 2009)
Arora, S. & Barak, B · 2009
Cited alongside, same era.
The parallel approach
Di Ventra, M. & Pershin, Y. V · 2013
Cited alongside, same era.
Hybridizing integer programming and metaheuristics for solving high school timetabling
Sørensen, M. & Stidsen, T. R · 2014
Cited alongside, same era.
Absence of periodic orbits in digital memcomputing machines with solutions
Di Ventra, M. & Traversa, F. L · 2017
Later among the works it cites.
Topological field theory and computing with instantons
Di Ventra, M., Traversa, F. L. & Ovchinnikov, I. V · 2017
Later among the works it cites.
Coin-or/cbc: Version 2.9.9 (2018)
Forrest, J. et al · 2018
Closest in time.
The SCIP Optimization Suite 6.0
Gleixner, A. et al · 2018
Closest in time.
Perspective: Memcomputing: Leveraging memory and physics to compute efficiently
Di Ventra, M. & Traversa, F. L · 2018
Closest in time.
Self-organizing logic gates and circuits and complex problem solving with self-organizing logic circuits, US patent application No. 15/557,641, US patent No. 9,911,080 (2018)
Di Ventra, M. & Traversa, F. L · 2018
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Universal memcomputing machines
Traversa, F. L. & Di Ventra, M · 2015
Cited alongside, same era.
Memcomputing NP-complete problems in polynomial time using polynomial resources and collective states
Traversa, F. L., Ramella, C., Bonani, F. & Di Ventra, M · 2015
Cited alongside, same era.
Solving open MIP instances with ParaSCIP on supercomputers using up to 80,000 cores
Shinano, Y. et al · 2016
Cited alongside, same era.
Coin-or/symphony: Version 5.6.16 (2017)
Ralphs, T. et al · 2017
Cited alongside, same era.
Polynomial-time solution of prime factorization and np-complete problems with digital memcomputing machines
Traversa, F. L. & Di Ventra, M · 2017
Cited alongside, same era.
Absence of chaos in digital memcomputing machines with solutions
Di Ventra, M. & Traversa, F. L · 2017
Cited alongside, same era.
Closest in time.
Instantons in self-organizing logic gates
Bearden, S. R., Manukian, H., Traversa, F. L. & Di Ventra, M · 2018
Closest in time.
Evidence of exponential speed-up in the solution of hard optimization problems
Traversa, F. L., Cicotti, P., Sheldon, F. & Di Ventra, M · 2018
Closest in time.
Stress-testing memcomputing on hard combinatorial optimization problems
Sheldon, F., Cicotti, P., Traversa, F. L. & Di Ventra, M · 2018
Closest in time.
Accelerating deep learning with memcomputing
Manukian, H., Traversa, F. L. & Di Ventra, M · 2018
Closest in time.
Collective Computing
Traversa, F. L · 2018
Closest in time.
Tuning and prediction of optimal parameters for algorithm configuration
Foertsch, J., Qian, Z. & Traversa, F. L · 2018
Closest in time.