Showing 1 - 10 of 12
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 …
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
A column generation based approach is proposed for solving the cluster-wise regression problem. The proposed strategy relies firstly on several efficient heuristic strategies to insert columns into the restricted master problem. If these heuristics fail to identify an improving column, an...
Persistent link: https://www.econbiz.de/10010950401
The quadratic assignment problem (QAP) is a challenging combinatorial problem. The problem is NP-hard and in addition, it is considered practically intractable to solve large QAP instances, to proven optimality, within reasonable time limits. In this paper we present an attractive mixed integer...
Persistent link: https://www.econbiz.de/10010597714
Persistent link: https://www.econbiz.de/10010224709
Persistent link: https://www.econbiz.de/10010513883
Persistent link: https://www.econbiz.de/10011413876