Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
implicit enumeration
Description:
An algorithmic search method for discrete optimization that systematically explores candidate solutions while pruning branches that cannot yield an optimum.
Related topics:
Complexity and Algorithms in Graphs (14%),
Advanced Optimization Algorithms Research (12%),
Scheduling and Optimization Algorithms (10%)
OpenAlex ID:
keywords/implicit-enumeration
An Implicit Enumeration Algorithm to Generate Tests for Combinational Logic Circuits
1981
·
Goel
·
IEEE Transactions on Computers
·
1,178
Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning
2016
·
David R. Morrison
, Sheldon H. Jacobson
, et al.
·
Discrete Optimization
·
779
A Mathematical Model for Periodic Scheduling Problems
1989
·
Paolo Serafini
, Walter Ukovich
·
SIAM Journal on Discrete Mathematics
·
624
Set Partitioning: A survey
1976
·
Egon Balas
, Manfred W. Padberg
·
SIAM Review
·
516
Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
1969
·
Egon Balas
·
Operations Research
·
464
The Mixed Integer Linear Bilevel Programming Problem
1990
·
James T. Moore
, Jonathan F. Bard
·
Operations Research
·
423
Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
1980
·
Egon Balas
, Andrew Ho
·
Mathematical programming studies
·
397
Optimal Political Districting by Implicit Enumeration Techniques
1970
·
R. S. Garfinkel
, G. L. Nemhauser
·
Management Science
·
349
Integer Programming: Theory, Applications, and Computations
2014
·
Hamdy A. Taha
·
332
Application of 0-1 integer programming to multitarget tracking problems
1977
·
C. Morefield
·
IEEE Transactions on Automatic Control
·
317
A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
1986
·
Warren P. Adams
, Hanif D. Sherali
·
Management Science
·
291
Markovian Decision Processes with Uncertain Transition Probabilities
1973
·
Jay K. Satia
, Roy E. Lave
·
Operations Research
·
288
Integer Programming by Implicit Enumeration and Balas’ Method
1967
·
Arthur M. Geoffrion
·
SIAM Review
·
255
An Improved Implicit Enumeration Approach for Integer Programming
1969
·
A. M. Geoffrion
·
Operations Research
·
251
An index for operational flexibility in chemical process design. Part II: Computational algorithms
1985
·
R. E. Swaney
, I. E. Grossmann
·
AIChE Journal
·
246
On the General Feasibility Test of Scheduling Lot Sizes for Several Products on One Machine
1983
·
Wen-Lian Hsu
·
Management Science
·
221
Job-Shop Scheduling by Implicit Enumeration
1977
·
B. J. Lageweg
, J. K. Lenstra
, et al.
·
Management Science
·
216
An Integer Programming Algorithm with Network Cuts for Solving the Assembly Line Balancing Problem
1984
·
F. Brian Talbot
, James H. Patterson
·
Management Science
·
179
Minimizing mean absolute deviation of completion times about a common due date
1986
·
Uttarayan Bagchi
, Robert S. Sullivan
, et al.
·
Naval Research Logistics Quarterly
·
178
Algorithms for the Simple Plant-Location Problem with Some Side Conditions
1969
·
Kurt Spielberg
·
Operations Research
·
177
Quadratic Binary Programming with Application to Capital-Budgeting Problems
1970
·
D. J. Laughhunn
·
Operations Research
·
170
Solving Resource-Constrained Network Problems by Implicit Enumeration—Nonpreemptive Case
1970
·
Linus Schrage
·
Operations Research
·
165
Shortest chain subject to side constraints
1983
·
Y. P. Aneja
, V. Aggarwal
, et al.
·
Networks
·
164
Optimal Allocation of Protective Resources in Shortest-Path Networks
2010
·
Paola Cappanera
, Maria Paola Scaparra
·
Transportation Science
·
156
An Implicit Enumeration Algorithm for Quadratic Integer Programming
1980
·
R. D. McBride
, J. S. Yormark
·
Management Science
·
152
Show more works
View as search
Works count:
705
Citation count:
18,240
Year
Topic
Type