Fetching the paper…
Reading the bibliography…
Combinatorial optimization lies at the core of many real-world problems.
On the evolution of random graphs
Paul Erdős and Alfréd Rényi · 1960
Earlier work this paper cites.
A problem of maximum consistent subsets
Raymond E. Miller and David E. Muller · 1960
Earlier work this paper cites.
Strong NP-completeness results
Michael R. Garey and David S. Johnson · 1978
Earlier work this paper cites.
A branch and bound algorithm for the maximum clique problem
Panos M. Pardalos and Gregory P. Rodgers · 1992
Earlier work this paper cites.
A greedy randomized adaptive search procedure for maximum independent set
Thomas A. Feo, Mauricio G. C. Resende, and Stuart H. Smith · 1994
Earlier work this paper cites.
Citeseer: An automatic citation indexing system
C. Lee Giles, Kurt D. Bollacker, and Steve Lawrence · 1998
Earlier work this paper cites.
Collective dynamics of ‘small-world’ networks
Duncan J. Watts and Steven H. Strogatz · 1998
Earlier work this paper cites.
Satlib: An online resource for research on sat
Holger Hoos and Thomas Stützle · 2000
Earlier work this paper cites.
Automating the construction of internet portals with machine learning
Andrew Kachites McCallum, Kamal Nigam, Jason Rennie, and Kristie Seymore · 2000
Earlier work this paper cites.
Reducibility among combinatorial problems
Richard M. Karp · 2001
Earlier work this paper cites.
Statistical mechanics of complex networks
Réka Albert and Albert-László Barabási · 2002
Earlier work this paper cites.
Growing scale-free networks with tunable clustering
Petter Holme and Beom Jun Kim · 2002
Earlier work this paper cites.
A hybrid genetic algorithm for the capacitated vehicle routing problem
Jean Berger and Mohamed Barkaoui · 2003
Earlier work this paper cites.
Maximum Independent Set and Related Problems, with Applications
Sergiy Butenko · 2003
Earlier work this paper cites.
Why most published research findings are false
John P. A. Ioannidis · 2005
Earlier work this paper cites.
Graphs over time: densification laws, shrinking diameters and possible explanations
Jure Leskovec, Jon Kleinberg, and Christos Faloutsos · 2005
Earlier work this paper cites.
Random constraint satisfaction: Easy generation of hard (satisfiable) instances
Ke Xu, Frédéric Boussemart, Fred Hemery, and Christophe Lecoutre · 2007
Earlier work this paper cites.
Exploring network structure, dynamics, and function using networkx
Aric Hagberg, Pieter Swart, and Daniel S Chult · 2008
Earlier work this paper cites.
Collective classification in network data
Prithviraj Sen, Galileo Namata, Mustafa Bilgic, Lise Getoor, Brian Galligher, and Tina Eliassi-Rad · 2008
Earlier work this paper cites.
Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters
Jure Leskovec, Kevin J. Lang, Anirban Dasgupta, and Michael W. Mahoney · 2009
Earlier work this paper cites.
State-of-the art review—evolutionary algorithms for vehicle routing
Jean-Yves Potvin · 2009
Earlier work this paper cites.
Hyperbolic geometry of complex networks
Dmitri Krioukov, Fragkiskos Papadopoulos, Maksim Kitsak, Amin Vahdat, and Marián Boguñá · 2010
Earlier work this paper cites.
Signed networks in social media
Jure Leskovec, Daniel Huttenlocher, and Jon Kleinberg · 2010
Earlier work this paper cites.
A simple and faster branch-and-bound algorithm for finding a maximum clique
Etsuji Tomita, Yoichi Sutani, Takanori Higashi, Shinya Takahashi, and Mitsuo Wakatsuki · 2010
Earlier work this paper cites.
Multiple choice learning: Learning to produce multiple structured outputs
Abner Guzmán-Rivera, Dhruv Batra, and Pushmeet Kohli · 2012
Cited alongside, same era.
Learning to discover social circles in ego networks
Jure Leskovec and Julian Mcauley · 2012
Cited alongside, same era.
Defining and evaluating network communities based on ground-truth
Jaewon Yang and Jure Leskovec · 2013
Cited alongside, same era.
Exploiting social network structure for person-to-person sentiment analysis
Robert West, Hristo S. Paskov, Jure Leskovec, and Christopher Potts · 2014
Cited alongside, same era.
Sustainable supply chain network design: An optimization-oriented review
Majid Eskandarpour, Pierre Dejax, Joe Miemczyk, and Olivier Péton · 2015
Cited alongside, same era.
Adam: A method for stochastic optimization
Combinatorial optimization with graph convolutional networks and guided tree search
Zhuwen Li, Qifeng Chen, and Vladlen Koltun · 2018
Later among the works it cites.
Warmstarting of model-based algorithm configuration
Marius Lindauer and Frank Hutter · 2018
Later among the works it cites.
Efficiently generating geometric inhomogeneous and hyperbolic random graphs
Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Ulrich Meyer, Manuel Penschuck, and Christopher Weyand · 2019
Later among the works it cites.
From graph theory to network science: The natural emergence of hyperbolicity (tutorial)
Tobias Friedrich · 2019
Later among the works it cites.
Scalable kernelization for maximum independent sets
Demian Hespe, Christian Schulz, and Darren Strash · 2019
Later among the works it cites.
Algorithms for the generalized independent set problem based on a quadratic optimization approach
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Diederik P. Kingma and Jimmy Ba · 2015
Cited alongside, same era.
The network data repository with interactive graph analytics and visualization
Ryan A. Rossi and Nesreen K. Ahmed · 2015
Cited alongside, same era.
Deep graph kernels
Pinar Yanardag and S.V.N. Vishwanathan · 2015
Cited alongside, same era.
1, 500 scientists lift the lid on reproducibility
Monya Baker · 2016
Cited alongside, same era.
The generalized independent set problem: Polyhedral analysis and solution approaches
Marco Colombi, Renata Mansini, and Martin Savelsbergh · 2016
Cited alongside, same era.
Edge weight prediction in weighted signed networks
Srijan Kumar, Francesca Spezzano, V. S. Subrahmanian, and Christos Faloutsos · 2016
Cited alongside, same era.
OSMnx: New methods for acquiring, constructing, analyzing, and visualizing complex street networks
Geoff Boeing · 2017
Cited alongside, same era.
Seyedmohammadhossein Hosseinian and Sergiy Butenko · 2019
Later among the works it cites.
Attention, learn to solve routing problems!
Wouter Kool, Herke van Hoof, and Max Welling · 2019
Later among the works it cites.
Exactly solving the maximum weight independent set problem on large real-world graphs
Sebastian Lamm, Christian Schulz, Darren Strash, Robert Williger, and Huashuo Zhang · 2019
Later among the works it cites.
Pytorch: An imperative style, high-performance deep learning library
Adam Paszke, Sam Gross, Francisco Massa, Adam Lerer, James Bradbury, Gregory Chanan, Trevor Killeen, Zeming Lin, Natalia Gimelshein, Luca Antiga, Alban Desmaison, Andreas Kopf, Edward Yang, Zachary DeVito, Martin Raison, Alykhan Tejani, Sasank Chilamkurthy, Benoit Steiner, Lu Fang, Junjie Bai, and Soumith Chintala · 2019
Later among the works it cites.
Mixed integer programming versus evolutionary computation for optimizing a hard real-world staff assignment problem
Jannik Peters, Daniel Stephan, Isabel Amon, Hans Gawendowicz, Julius Lischeid, Lennart Salabarria, Jonas Umland, Felix Werner, Martin S. Krejca, Ralf Rothenberger, Timo Kötzing, and Tobias Friedrich · 2019
Later among the works it cites.
Deep graph library: A graph-centric, highly-performant package for graph neural networks
Minjie Wang, Da Zheng, Zihao Ye, Quan Gan, Mufei Li, Xiang Song, Jinjing Zhou, Chao Ma, Lingfan Yu, Yu Gai, Tianjun Xiao, Tong He, George Karypis, Jinyang Li, and Zheng Zhang · 2019
Later among the works it cites.
Learning what to defer for maximum independent sets
Sungsoo Ahn, Younggyo Seo, and Jinwoo Shin · 2020
Later among the works it cites.
Anaconda software distribution, 2020
Anaconda Inc · 2020
Later among the works it cites.
Reproduciblity, 2020
Zihao Ding, Aniketh Reddy, and Aparna Joshi · 2020
Later among the works it cites.
The power of pivoting for exact clique counting
Shweta Jain and C. Seshadhri · 2020
Later among the works it cites.
Irreproducibility in machine learning, 2020
Sayash Kapoor and Arvind Narayanan · 2020
Later among the works it cites.
Evolutionary minimization of traffic congestion
Maximilian Böther, Leon Schiller, Philipp Fischbeck, Louise Molitor, Martin S. Krejca, and Tobias Friedrich · 2021
Later among the works it cites.
New instances for maximum weight independent set from a vehicle routing application
Yuanyuan Dong, Andrew V. Goldberg, Alexander Noe, Nikos Parotsidis, Mauricio G. C. Resende, and Quico Spaen · 2021
Later among the works it cites.
Gurobi website, 2021
Gurobi Optimization LLC · 2021
Later among the works it cites.
Targeted Branching for the Maximum Independent Set Problem
Demian Hespe, Sebastian Lamm, and Christian Schorr · 2021
Later among the works it cites.
Learning tsp requires rethinking generalization
Chaitanya K. Joshi, Quentin Cappart, Louis-Martin Rousseau, and Thomas Laurent · 2021
Later among the works it cites.
Solving mixed integer programs using neural networks
Vinod Nair, Sergey Bartunov, Felix Gimeno, Ingrid von Glehn, Pawel Lichocki, Ivan Lobov, Brendan O’Donoghue, Nicolas Sonnerat, Christian Tjandraatmadja, Pengming Wang, Ravichandra Addanki, Tharindi Hapuarachchi, Thomas Keck, James Keeling, Pushmeet Kohli, Ira Ktena, Yujia Li, Oriol Vinyals, and Yori Zwols · 2021
Later among the works it cites.
How neural networks extrapolate: From feedforward to graph neural networks
Keyulu Xu, Mozhi Zhang, Jingling Li, Simon Shaolei Du, Ken-ichi Kawarabayashi, and Stefanie Jegelka · 2021
Later among the works it cites.