Showing 1 - 10 of 2,407
heuristics fail to identify an improving column, an exhaustive search is performed starting with incrementally larger ending …
Persistent link: https://www.econbiz.de/10010950401
Persistent link: https://www.econbiz.de/10010557926
combines a general modeling methodology with effective learning hyper-heuristics to solve this problem. The proposed hyper-heuristics …
Persistent link: https://www.econbiz.de/10010871281
Persistent link: https://www.econbiz.de/10005755633
Persistent link: https://www.econbiz.de/10004303889
Persistent link: https://www.econbiz.de/10009609183
Persistent link: https://www.econbiz.de/10000107230
establishes a thesis stating that a metaheuristics approach to PPCS will harvest benefits not possibly considered when optimizing …
Persistent link: https://www.econbiz.de/10005126234
This paper is concerned with the analysis and comparison of semidefinite programming (SDP) relaxations for the satisfiability (SAT) problem. Our presentation is focussed on the special case of 3-SAT, but the ideas presented can in principle be extended to any instance of SAT specified by a set...
Persistent link: https://www.econbiz.de/10010847851