Fetching the paper…
Reading the bibliography…
In an era of digital ubiquity, efficient resource management and decision-making are paramount across numerous industries.
An algorithm for the mixed integer problem
Ralph Gomory · 1960
Earlier work this paper cites.
Decomposition principle for linear programs
George B Dantzig and Philip Wolfe · 1960
Earlier work this paper cites.
Algorithm 247: Radical-inverse quasi-random point sequence
J. H. Halton · 1964
Earlier work this paper cites.
Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study , pages 37–60
Egon Balas and Andrew Ho · 1980
Earlier work this paper cites.
New crash procedures for large systems of linear constraints
Nicholas IM Gould and John K Reid · 1989
Earlier work this paper cites.
Implementing the simplex method: The initial basis
Robert E Bixby · 1992
Earlier work this paper cites.
Heuristic bounds and test problem generation for the time-dependent traveling salesman problem
Russ J Vander Wiel and Nikolaos V Sahinidis · 1995
Earlier work this paper cites.
Presolving in linear programming
Erling D Andersen and Knud D Andersen · 1995
Earlier work this paper cites.
Journal of Global Optimization , 11(4):341–359, 1997
Rainer Storn and Kenneth Price · 1997
Earlier work this paper cites.
Collective dynamics of ‘small-world’networks
Duncan J Watts and Steven H Strogatz · 1998
Earlier work this paper cites.
Computational techniques of the simplex method , volume 61
István Maros · 2002
Earlier work this paper cites.
On the facets of the mixed–integer knapsack polyhedron
Alper Atamtürk · 2003
Earlier work this paper cites.
1 − 1- norm support vector machines
Ji Zhu, Saharon Rosset, Robert Tibshirani, and Trevor Hastie · 2003
Earlier work this paper cites.
Advanced preprocessing techniques for linear and quadratic programming
Csaba Mészáros and Uwe H. Suhl · 2003
Earlier work this paper cites.
Warped gaussian processes
Snelson E., Ghahramani Z., and Rasmussen C · 2003
Earlier work this paper cites.
An improved initial basis for the simplex algorithm
Hélcio Vieira Junior and Marcos Pereira Estellita Lins · 2005
Earlier work this paper cites.
The gurobi optimizer
Bob Bixby · 2007
Earlier work this paper cites.
Constraint integer programming
Tobias Achterberg · 2007
Earlier work this paper cites.
JADE: Self-adaptive differential evolution with fast and reliable convergence performance
Jingqiao Zhang and Arthur C. Sanderson · 2007
Earlier work this paper cites.
JADE: Adaptive differential evolution with optional external archive
Jingqiao Zhang and A.C. Sanderson · 2009
Earlier work this paper cites.
Multi-start JADE with knowledge transfer for numerical optimization
Fei Peng, Ke Tang, Guoliang Chen, and Xin Yao · 2009
Earlier work this paper cites.
Kronecker graphs: an approach to modeling networks
Jure Leskovec, Deepayan Chakrabarti, Jon Kleinberg, Christos Faloutsos, and Zoubin Ghahramani · 2010
Earlier work this paper cites.
Computational experience with linear optimization and related problems
Joseph M Elble · 2010
Earlier work this paper cites.
Algorithms for hyper-parameter optimization
James Bergstra, Rémi Bardenet, Yoshua Bengio, and Balázs Kégl · 2011
Earlier work this paper cites.
Sequential model-based optimization for general algorithm configuration
Frank Hutter, Holger H. Hoos, and Kevin Leyton-Brown · 2011
Earlier work this paper cites.
Guiding combinatorial optimization with uct
Ashish Sabharwal, Horst Samulowitz, and Chandra Reddy · 2012
Earlier work this paper cites.
Implementing cutting plane management and selection techniques
Franz Wesselmann and U Stuhl · 2012
Earlier work this paper cites.
Practical bayesian optimization of machine learning algorithms
Jasper Snoek, Hugo Larochelle, and Ryan P. Adams · 2012
Earlier work this paper cites.
Measuring the impact of primal heuristics
Timo Berthold · 2013
Earlier work this paper cites.
Exploration and exploitation in evolutionary algorithms
Matej Črepinšek, Shih-Hsi Liu, and Marjan Mernik · 2013
Earlier work this paper cites.
Success-history based parameter adaptation for differential evolution
Ryoji Tanabe and Alex Fukunaga · 2013
Earlier work this paper cites.
Solving mixed-integer quadratic programming problems with ibm-cplex: a progress report
Christian Bliek1ú, Pierre Bonami, and Andrea Lodi · 2014
Earlier work this paper cites.
Learning to search in branch and bound algorithms
He He, Hal Daume III, and Jason M Eisner · 2014
Earlier work this paper cites.
Parallelizing exploration-exploitation tradeoffs in gaussian process bandit optimization
Thomas Desautels, Andreas Krause, and Joel W Burdick · 2014
Earlier work this paper cites.
MIRPLib–a library of maritime inventory routing problem instances: Survey, core model, and benchmark results
Dimitri J Papageorgiou, George L Nemhauser, Joel Sokol, Myun-Seok Cheon, and Ahmet B Keha · 2014
Earlier work this paper cites.
Improving the search performance of shade using linear population size reduction
Ryoji Tanabe and Alex S. Fukunaga · 2014
Cited alongside, same era.
Pointer networks
Oriol Vinyals, Meire Fortunato, and Navdeep Jaitly · 2015
Cited alongside, same era.
Hyperopt: a python library for model selection and hyperparameter optimization
James Bergstra, Brent Komer, Chris Eliasmith, Dan Yamins, and David D. Cox · 2015
Cited alongside, same era.
Neural combinatorial optimization with reinforcement learning
Irwan Bello, Hieu Pham, Quoc V Le, Mohammad Norouzi, and Samy Bengio · 2016
Cited alongside, same era.
Learning to branch in mixed integer programming
Elias Khalil, Pierre Le Bodic, Le Song, George Nemhauser, and Bistra Dilkina · 2016
Cited alongside, same era.
Learning to optimize industry-scale dynamic pickup and delivery problems
Xijun Li, Weilin Luo, Mingxuan Yuan, Jun Wang, Jiawen Lu, Jie Wang, Jinhu Lü, and Jia Zeng · 2021
Later among the works it cites.
Machine learning for combinatorial optimization: a methodological tour d’horizon
Yoshua Bengio, Andrea Lodi, and Antoine Prouvost · 2021
Later among the works it cites.
Machine learning for combinatorial optimization, 2021
Simon Bowly, Quentin Cappart, Jonas Charfreitag, Laurent Charlin, Didier Chételat, Antonia Chmiela, Justin Dumouchelle, Maxime Gasse, Ambros Gleixner, Aleksandr M, Kazachkov, Elias B, Khalil, Pawel Lichocki, Andrea Lodi, Miles Lubin, Chris J, Maddison, Christopher Morris, Dimitri J, Papageorgiou, Augustin Parjadis, Sebastian Pokutta, Antoine Prouvost, Lara Scavuzzo, and Giulia Zarpellon · 2021
Later among the works it cites.
Parameterizing branch-and-bound search trees to learn branching policies
Giulia Zarpellon, Jason Jo, Andrea Lodi, and Yoshua Bengio · 2021
Later among the works it cites.
Machine-learning-based column selection for column generation
Mouad Morabit, Guy Desaulniers, and Andrea Lodi · 2021
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Thomas N Kipf and Max Welling · 2016
Cited alongside, same era.
Asynchronous methods for deep reinforcement learning
Volodymyr Mnih, Adria Puigdomenech Badia, Mehdi Mirza, Alex Graves, Timothy Lillicrap, Tim Harley, David Silver, and Koray Kavukcuoglu · 2016
Cited alongside, same era.
Recent advances in differential evolution – an updated survey
Swagatam Das, Sankha Subhra Mullick, and P.N. Suganthan · 2016
Cited alongside, same era.
Learning to run heuristics in tree search
Elias B Khalil, Bistra Dilkina, George L Nemhauser, Shabbir Ahmed, and Yufen Shao · 2017
Cited alongside, same era.
Google vizier: A service for black-box optimization
Daniel Golovin, Benjamin Solnik, Subhodeep Moitra, Greg Kochanski, John Karro, and D. Sculley · 2017
Cited alongside, same era.
Proximal policy optimization algorithms
John Schulman, Filip Wolski, Prafulla Dhariwal, Alec Radford, and Oleg Klimov · 2017
Cited alongside, same era.
Reinforcement learning for solving the vehicle routing problem
Mohammadreza Nazari, Afshin Oroojlooy, Lawrence Snyder, and Martin Takác · 2018
Cited alongside, same era.
Graph networks for molecular design
Rocío Mercado, Tobias Rastemo, Edvard Lindelöf, Günter Klambauer, Ola Engkvist, Hongming Chen, and Esben Jannik Bjerrum · 2021
Later among the works it cites.
Masked graph modeling for molecule generation
Omar Mahmood, Elman Mansimov, Richard Bonneau, and Kyunghyun Cho · 2021
Later among the works it cites.
Learning to select cuts for efficient mixed-integer programming
Zeren Huang, Kerong Wang, Furui Liu, Hui-Ling Zhen, Weinan Zhang, Mingxuan Yuan, Jianye Hao, Yong Yu, and Jun Wang · 2021
Later among the works it cites.
Sample complexity of tree search configuration: Cutting planes and beyond
Maria-Florina F Balcan, Siddharth Prasad, Tuomas Sandholm, and Ellen Vitercik · 2021
Later among the works it cites.
Microsoft nni, https://https://github.com/microsoft/nni , 2021
Microsoft · 2021
Later among the works it cites.
Cplex tuning tool, https://www.ibm.com/docs/en/icos/20.1.0?topic=programmingconsiderations-tuning-tool , 2021
IBM · 2021
Later among the works it cites.
A triangulation and fill-reducing initialization procedure for the simplex algorithm
Nikolaos Ploskas, Nikolaos V Sahinidis, and Nikolaos Samaras · 2021
Later among the works it cites.
Practical large-scale linear programming using primal-dual hybrid gradient
David Applegate, Mateo Díaz, Oliver Hinder, Haihao Lu, Miles Lubin, Brendan O’Donoghue, and Warren Schudy · 2021
Later among the works it cites.
Hebo: Pushing the limits of sample-efficient hyper-parameter optimisation
Alexander I. Cowen-Rivers, Wenlong Lyu, and Rasul Tutunov · 2022
Later among the works it cites.
Learning to optimize dag scheduling in heterogeneous environment
Yunfan Zhou, Xijun Li, Jinhong Luo, Mingxuan Yuan, Jia Zeng, and Jianguo Yao · 2022
Later among the works it cites.
Learning to cut by looking ahead: Cutting plane selection via imitation learning
Max B Paulus, Giulia Zarpellon, Andreas Krause, Laurent Charlin, and Chris Maddison · 2022
Later among the works it cites.
Adaptive cut selection in mixed-integer linear programming
Mark Turner, Thorsten Koch, Felipe Serrano, and Michael Winkler · 2022
Later among the works it cites.
Lookback for learning to branch
Prateek Gupta, Elias B Khalil, Didier Chetélat, Maxime Gasse, Yoshua Bengio, Andrea Lodi, and M Pawan Kumar · 2022
Later among the works it cites.
An improved reinforcement learning algorithm for learning to branch
Qingyu Qu, Xijun Li, Yunfan Zhou, Jia Zeng, Mingxuan Yuan, Jie Wang, Jinhu Lv, Kexin Liu, and Kun Mao · 2022
Later among the works it cites.
Learning to reformulate for linear programming
Xijun Li, Qingyu Qu, Fangzhou Zhu, Jia Zeng, Mingxuan Yuan, Kun Mao, and Jie Wang · 2022
Later among the works it cites.
On representing linear programs by graph neural networks
Ziang Chen, Jialin Liu, Xinshang Wang, Jianfeng Lu, and Wotao Yin · 2022
Later among the works it cites.
A systematic survey on deep generative models for graph generation
Xiaojie Guo and Liang Zhao · 2022
Later among the works it cites.
A survey on deep graph generation: Methods and applications
Yanqiao Zhu, Yuanqi Du, Yinkai Wang, Yichen Xu, Jieyu Zhang, Qiang Liu, and Shu Wu · 2022
Later among the works it cites.
On the performance of deep generative models of realistic sat instances
Iván Garzón, Pablo Mesejo, and Jesús Giráldez-Cru · 2022
Later among the works it cites.
Generalization of neural combinatorial solvers through the lens of adversarial robustness
Simon Geisler, Johanna Sommer, Jan Schuchardt, Aleksandar Bojchevski, and Stephan Günnemann · 2022
Later among the works it cites.
Structural analysis of branch-and-cut and the learnability of gomory mixed integer cuts
Maria-Florina Balcan, Siddharth Prasad, Tuomas Sandholm, and Ellen Vitercik · 2022
Later among the works it cites.
Knowledge-injected federated learning
Zhenan Fan, Zirui Zhou, Jian Pei, Michael P Friedlander, Jiajie Hu, Chengliang Li, and Yong Zhang · 2022
Later among the works it cites.
coin-or/clp: Release releases/1.17.7, January 2022
John Forrest, Stefan Vigerske, Ted Ralphs, Lou Hafer, John Forrest, jpfasano, Haroldo Gambini Santos, Matthew Saltzman, Jan-Willem, Bjarni Kristjansson, h-i gassmann, Alan King, pobonomo, Samuel Brito, and to st · 2022
Later among the works it cites.
The optverse ai solver empowers the tianjin port intelligent planning platform, realizing global integrated planning, https://www.huaweicloud.com/cases/tjg.html , 2023
Huawei Cloud · 2023
Later among the works it cites.
End-to-end meta-bayesian optimisation with transformer neural processes
Alexandre Maraval, Matthieu Zimmer, Antoine Grosnit, and Haitham Bou Ammar · 2023
Later among the works it cites.
Machine learning methods in solving the boolean satisfiability problem
Wenxuan Guo, Hui-Ling Zhen, Xijun Li, Wanqian Luo, Mingxuan Yuan, Yaohui Jin, and Junchi Yan · 2023
Later among the works it cites.
Roco: A general framework for evaluating robustness of combinatorial optimization solvers on graphs
Han Lu, Zenan Li, Runzhong Wang, Qibing Ren, Xijun Li, Mingxuan Yuan, Jia Zeng, Xiaokang Yang, and Junchi Yan · 2023
Later among the works it cites.
Promoting generalization for exact solvers via adversarial instance augmentation
Haoyang Liu, Yufei Kuang, Jie Wang, Xijun Li, Yongdong Zhang, and Feng Wu · 2023
Later among the works it cites.
Presolve, crash and software engineering for highs
Ivet Galabova · 2023
Later among the works it cites.
Transfer learning for bayesian optimization: A survey
Tianyi Bai, Yang Li, Yu Shen, Xinyi Zhang, Wentao Zhang, and Bin Cui · 2023
Later among the works it cites.