Sciweavers

1289 search results - page 26 / 258
» Complexity of Counting the Optimal Solutions
Sort
View
CEC
2007
IEEE
14 years 5 months ago
SAT-decoding in evolutionary algorithms for discrete constrained optimization problems
— For complex optimization problems, several population-based heuristics like Multi-Objective Evolutionary Algorithms have been developed. These algorithms are aiming to deliver ...
Martin Lukasiewycz, Michael Glaß, Christian ...
JMMA
2010
90views more  JMMA 2010»
13 years 5 months ago
A Unified Approach to Algorithms Generating Unrestricted and Restricted Integer Compositions and Integer Partitions
An original algorithm is presented that generates both restricted integer compositions and restricted integer partitions that can be constrained simultaneously by a) upper and low...
John Douglas Opdyke
MST
2007
167views more  MST 2007»
13 years 10 months ago
The Complexity of Polynomial-Time Approximation
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental ...
Liming Cai, Michael R. Fellows, David W. Juedes, F...
IFSA
2007
Springer
138views Fuzzy Logic» more  IFSA 2007»
14 years 5 months ago
Optimization to Manage Supply Chain Disruptions Using the NSGA-II
Disruption on a supply chain provokes lost that should be minimized looking for alternative suppliers. This solution involves a strategy to manage the impact of the disruption and ...
Víctor Serrano, Matías Alvarado, Car...
JMLR
2006
117views more  JMLR 2006»
13 years 11 months ago
On the Complexity of Learning Lexicographic Strategies
Fast and frugal heuristics are well studied models of bounded rationality. Psychological research has proposed the take-the-best heuristic as a successful strategy in decision mak...
Michael Schmitt, Laura Martignon