Results 151 to 160 of about 65,892 (182)
Some of the next articles are maybe not open access.
A polyhedral approach to the alldifferent system
Mathematical Programming, 2010This paper examines the facial structure of the convex hull of integer vectors satisfying a system of alldifferent predicates, also called an alldifferent system. The underlying analysis is based on a property, called inclusion, pertinent to such a system.
D. Magos, I. Mourtos, G. Appa
openaire +1 more source
Fairness in Capacitated Networks: A Polyhedral Approach
IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications, 2007The problem of fair and feasible allocation of user throughputs in capacitated networks is investigated. The main contribution of the paper is a novel geometric approach, which facilitates to generalize several throughput allocation strategies, most importantly max-min fairness, from the traditional "fixed-path" model to a more versatile, routing ...
G. Retvari, J. J. Biro, T. Cinkler
openaire +1 more source
New Synthesis Approach for Expandable Polyhedral Linkages
Volume 5A: 38th Mechanisms and Robotics Conference, 2014This paper presents a new synthesis approach for expandable polyhedral linkages, which are synthesized by inserting appropriate link groups into the faces of polyhedron and interconnecting them by a special composite hinges (called gusset by K. Wohlhart).
Ying Zhang +4 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
A Polyhedral Approach to Surface Reconstruction from Planar Contours
2002We investigate the problem of reconstruction a surface given its contours on parallel slices. We present a branch-and-cut algorithm which computes the surface with the minimal area. This surface is assumed to be the best reconstruction since a long time. Nevertheless there were no algorithms to compute this surface.
Althaus, E., Fink, C.
openaire +2 more sources
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 +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
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
Polyhedral approaches to network survivability
1991M. Grötschel, C. Monma, M. Stoer
openaire +1 more source
Polyhedral separation approaches for pattern classification problems
2019In the last twenty years a remarkable research work has been performed in the area of data analysis and machine learning, mainly tackling problems of clustering and classification type. This work deals with pattern classification, which consists in categorizing data into different classes on the basis of their similarities.
A. Astorino, A. Fuduli, M. Gaudioso
openaire +1 more source