Showing 1 - 10 of 1,774
heuristics fail to identify an improving column, an exhaustive search is performed starting with incrementally larger ending …
Persistent link: https://www.econbiz.de/10010950401
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/10010557926
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 Multi-Row Facility Layout Problem. Given a set of rectangular departments, a fixed number of rows, and weights for each pair of departments, the problem consists of finding an assignment of departments to rows and the positions of the departments in each row so...
Persistent link: https://www.econbiz.de/10011264291
In this article we survey mathematical programming approaches to problems in the field of drinking water distribution network optimization. Among the predominant topics treated in the literature, we focus on two different, but related problem classes. One can be described by the notion of...
Persistent link: https://www.econbiz.de/10011209319
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
Geometric branch-and-bound techniques are well-known solution algorithms for non-convex continuous global optimization problems with box constraints. Several approaches can be found in the literature differing mainly in the bounds used.
Persistent link: https://www.econbiz.de/10011052715
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/10010950243