Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
enumeration algorithms
Description:
Algorithms that systematically generate all solutions or objects satisfying a specified problem's conditions.
Related topics:
Advanced Combinatorial Mathematics (18%),
Advanced Graph Theory Research (15%),
Complexity and Algorithms in Graphs (14%)
Wikidata ID:
wiki/Q21405405
OpenAlex ID:
keywords/enumeration-algorithms
Two-dimensional packing problems: A survey
2002
·
Andrea Lodi
, Silvano Martello
, et al.
·
European Journal of Operational Research
·
980
The worst-case time complexity for generating all maximal cliques and computational experiments
2006
·
Etsuji Tomita
, Akira Tanaka
, et al.
·
Theoretical Computer Science
·
930
PDF
A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
1996
·
Nicholas G. Hall
, Chelliah Sriskandarajah
·
Operations Research
·
908
Reverse search for enumeration
1996
·
David Avis
, Komei Fukuda
·
Discrete Applied Mathematics
·
897
On generating all maximal independent sets
1988
·
David S. Johnson
, Mihalis Yannakakis
, et al.
·
Information Processing Letters
·
882
Better Key Sizes (and Attacks) for LWE-Based Encryption
2011
·
Richard Lindner
, Chris Peikert
·
Lecture notes in computer science
·
843
Integer Programming: Methods, Uses, Computations
1965
·
M. L. Balinski
·
Management Science
·
754
A New Algorithm for Generating All the Maximal Independent Sets
1977
·
Shuji Tsukiyama
, Mikio Ide
, et al.
·
SIAM Journal on Computing
·
693
A concise survey of scheduling with time-dependent processing times
2003
·
T.C.E Cheng
, Q Ding
, et al.
·
European Journal of Operational Research
·
672
Double description method revisited
1996
·
Komei Fukuda
, Alain Prodon
·
Lecture notes in computer science
·
571
Improved algorithms for integer programming and related lattice problems
1983
·
Ravi Kannan
·
ACM Symposium on Theory of Computing (STOC)
·
560
Scheduling with limited machine availability
2000
·
Günter Schmidt
·
European Journal of Operational Research
·
517
A survey of algorithms for the generalized assignment problem
1992
·
Dirk G. Cattrysse
, Luk N. Van Wassenhove
·
European Journal of Operational Research
·
502
Skew braces and the Yang–Baxter equation
2016
·
L. Guarnieri
, L. Vendramin
·
Mathematics of Computation
·
453
Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
1980
·
E. L. Lawler
, J. K. Lenstra
, et al.
·
SIAM Journal on Computing
·
318
An enumerative approach for analyzing Time Petri Nets
1983
·
Bernard Berthomieu
, Miguel Menasche
·
HAL
·
309
A minimal algorithm for the multiple-choice knapsack problem
1995
·
David Pisinger
·
European Journal of Operational Research
·
295
Enumeration of the Elementary Circuits of a Directed Graph
1973
·
Robert Tarjan
·
SIAM Journal on Computing
·
295
A note on finding the bridges of a graph
1974
·
R.Endre Tarjan
·
Information Processing Letters
·
287
Combinatorial algorithms
1977
·
J. Alanen
·
Proceedings of the IEEE
·
267
A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
1980
·
T. H. Matheiss
, David S. Rubin
·
Mathematics of Operations Research
·
257
Reaction routes in biochemical reaction systems: Algebraic properties, validated calculation procedure and example from nucleotide metabolism
2002
·
S. Schuster
, C. Hilgetag
, et al.
·
Journal of Mathematical Biology
·
249
The Art of Computer Programming, Volume 4, Fascicle 3: Generating All Combinations and Partitions
2005
·
Donald E. Knuth
·
247
Methods of Nonlinear 0-1 Programming
1979
·
Pierre Hansen
·
Annals of discrete mathematics
·
236
Inverse Optimization with Noisy Data
2018
·
Anil Aswani
, Zuo-Jun (Max) Shen
, et al.
·
Operations Research
·
231
PDF
Show more works
View as search
Works count:
2,379
Citation count:
42,810
Year
Topic
Type