Results 271 to 280 of about 14,692 (300)
Some of the next articles are maybe not open access.
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 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
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
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
Polyhedral Approaches to the Design of Survivable Networks
2008Long-term planning of backbone telephone networks has been an important area of application of combinatorial optimization over the last few years. In this chapter, we review polyhedral results for models related to these problems. In particular, we study classical survivability requirements in terms of k-connectivity of the network, then we extend the ...
Bernard Fortz, Martine Labbé
openaire +1 more source
Multiple Instance Learning by Polyhedral Approaches
2021Multiple Instance Learning (MIL) is a variant of traditional supervised learning that has received a considerable amount of attention due to its applicability to real-world problems such as drug activity prediction and image classification. In particular, we are interested in the binary classification case where the objective is to construct a ...
Annabella Astorino +2 more
openaire +2 more sources
A polyhedral approach to designing communication networks.
2009Polytopes $Q\sbsp{2E}{n}$ and $Q\sbsp{2N}{n}$, which are associated with the minimum cost 2-edge-connected subgraph problem and the minimum cost 2-node-connected subgraph problem, respectively, are studied in this thesis, and some new classes of facet-inducing inequalities are introduced for these polytopes. These classes of inequalities are related to
openaire +2 more sources