Skip to search formSkip to main contentSkip to account menu

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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Many practically important combinatorial problems can be efficiently reduced to a problem of Boolean satisfiability (SAT… 
Review
2008
Review
2008
The field of evolutionary computation has traditionally focused on static optimisation problems but recently, many new approaches… 
2007
2007
This work introduces the Bees Algorithm, a new optimisation algorithm inspired by the foraging behaviour of honey-bees. In its… 
Highly Cited
2002
Highly Cited
2002
A parameter-less adaptive penalty scheme for genetic algorithms applied to constrained optimization problems is proposed. Besides… 
2002
2002
  • R. Bergamaschi
  • 2002
  • Corpus ID: 7589964
High-level synthesis operates on internal models known as control/data flow graphs (CDFG) and produces a register-transfer-level… 
2001
2001
Recent generations of Field Programmable Gate Arrays (FPGA) allow the dynamic reconfiguration of cells on the chip during run… 
1999
1999
The chapter presents selected problems and algorithms of fuzzy discrete optimization. The problems discussed constitute fuzzy… 
1993
1993
Graphs play an important role in modeling the underlying structure of many real-world problems. In this thesis, we investigate…