Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,184,854 papers from all fields of science
Search
Sign In
Create Free Account
Discrete optimization
Known as:
Discrete
, Discrete optimisation
Discrete optimization is a branch of optimization in applied mathematics and computer science.
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
19 relations
Bottleneck traveling salesman problem
Branch and bound
Combinatorial optimization
Computer science
Expand
Broader (1)
Mathematical optimization
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
An efficient GVNS for solving Traveling Salesman Problem with Time Windows
N. Mladenović
,
R. Todosijević
,
D. Urošević
Electron. Notes Discret. Math.
2012
Corpus ID: 44425239
2012
2012
Using BOINC Desktop Grid to Solve Large Scale SAT Problems
M. Posypkin
,
A. Semenov
,
O. Zaikin
Computer Science
2012
Corpus ID: 2163379
Many practically important combinatorial problems can be efficiently reduced to a problem of Boolean satisfiability (SAT…
Expand
Review
2008
Review
2008
Attributes of Dynamic Combinatorial Optimisation
Philipp Rohlfshagen
,
X. Yao
Asia-Pacific Conference on Simulated Evolution…
2008
Corpus ID: 31067995
The field of evolutionary computation has traditionally focused on static optimisation problems but recently, many new approaches…
Expand
2007
2007
the Bees Algorithm: a novel optimisation tool
A. Ghanbarzadeh
2007
Corpus ID: 109823808
This work introduces the Bees Algorithm, a new optimisation algorithm inspired by the foraging behaviour of honey-bees. In its…
Expand
Highly Cited
2002
Highly Cited
2002
An Adaptive Penalty Scheme In Genetic Algorithms For Constrained Optimiazation Problems
H. Barbosa
,
Afonso C. C. Lemonge
Annual Conference on Genetic and Evolutionary…
2002
Corpus ID: 8926267
A parameter-less adaptive penalty scheme for genetic algorithms applied to constrained optimization problems is proposed. Besides…
Expand
2002
2002
Bridging the domains of high-level and logic synthesis
R. Bergamaschi
IEEE Trans. Comput. Aided Des. Integr. Circuits…
2002
Corpus ID: 7589964
High-level synthesis operates on internal models known as control/data flow graphs (CDFG) and produces a register-transfer-level…
Expand
2001
2001
Optimization of Dynamic Hardware Reconfigurations
J. Teich
,
S. Fekete
,
Jörg Schepers
Journal of Supercomputing
2001
Corpus ID: 13985572
Recent generations of Field Programmable Gate Arrays (FPGA) allow the dynamic reconfiguration of cells on the chip during run…
Expand
2000
2000
The method of generalized generating sequences
I. Ushakov
European Journal of Operational Research
2000
Corpus ID: 32903197
1999
1999
Discrete fuzzy optimization
S. Chanas
,
D. Kuchta
1999
Corpus ID: 118921666
The chapter presents selected problems and algorithms of fuzzy discrete optimization. The problems discussed constitute fuzzy…
Expand
1993
1993
Graph augmentation and related problems: theory and practice
T. Hsu
1993
Corpus ID: 60857111
Graphs play an important role in modeling the underlying structure of many real-world problems. In this thesis, we investigate…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE