Results 131 to 140 of about 11,390 (166)
Some of the next articles are maybe not open access.
An Algebraic Approach to the Construction of Polyhedral Invariant Cones
SIAM Journal on Matrix Analysis and Applications, 2000The authors state a result of \textit{B. S. Tam} and \textit{H. Schneider} [Trans. Am. Math. Soc. 343, No.~2, 479-524 (1994; Zbl 0826.15015)] by means of algebraic arguments. Namely they characterize the real square matrices leaving a proper polyhedral cone \(K\) invariant in terms of properties of their eigenvalues.
Maria Elena Valcher, Lorenzo Farina
openaire +4 more sources
A polyhedral approach to a production planning problem
Annals of Operations Research, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
A new curve-based approach to polyhedral machining
Computer-Aided Design, 2002This paper presents a new approach to three-axis NC tool path generation for sculptured surfaces. In the proposed curve-based approach, the gouge-free tool paths are generated from a polyhedral model of the STL (stereolithography) format. The polyhedral model is offset by a local-offsetting scheme.
Cha-Soo Jun +2 more
openaire +1 more source
A Polyhedral Approach to the Asymmetric Traveling Salesman Problem
Management Science, 1997Several branch-and-bound algorithms for the exact solution of the asymmetric traveling salesman problem (ATSP), based on the assignment problem (AP) relaxation, have been proposed in the literature. These algorithms perform very well for some instances (e.g., those with uniformly random integer costs), but very poorly for others. The aim of this paper
FISCHETTI, MATTEO, P. Toth
openaire +2 more sources
Practical Approaches to Partially Guarding a Polyhedral Terrain
2014We study the problem of placing guard towers on a terrain such that the terrain can be seen from at least one tower. This problem is important in many applications, and has an extensive history in the literature (known as, e.g., multiple observer siting). In this paper, we consider the problem on polyhedral terrains, and we allow the guards to see only
Kammer, Frank +3 more
openaire +3 more sources
A polyhedral branch-and-cut approach to global optimization
Mathematical Programming, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mohit Tawarmalani, Nikolaos V. Sahinidis
openaire +1 more source
A polyhedral approach to sequence alignment problems
1999We study two problems in sequence alignment both from a theoretical and a practical point of view. For the first time in sequence alignment, we use tools from combinatorial optimization to develop branch-and-cut algorithms that solve these problems efficiently.
openaire +3 more sources
A polyhedral approach to the feedback vertex set problem
1996Feedback problems consist of removing a minimal number of arcs or nodes of a directed or undirected graph in order to make it acyclic. In this paper we consider a special variant, namely the problem of finding a maximum weight node induced acyclic subdigraph.
Meinrad Funke, Gerhard Reinelt
openaire +1 more source
A Polyhedral Approach to Ease the Composition of Program Transformations
2004We wish to extend the effectiveness of loop-restructuring compilers by improving the robustness of loop transformations and easing their composition in long sequences. We propose a formal and practical framework for program transformation. Our framework is well suited for iterative optimization techniques searching not only for the appropriate ...
Cohen, Albert +2 more
openaire +2 more sources
Survivable network design using polyhedral approaches
2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011), 2011We consider the problem of designing a survivable telecommunication network using facilities of a fixed capacity. Given a graph G = (V,E), the traffic demand among the nodes, and the cost of installing facilities on the edges of G, we wish to design the minimum cost network, so that under any single edge failure, the network permits the flow of all ...
openaire +1 more source