Results 261 to 270 of about 27,242,528 (312)
Some of the next articles are maybe not open access.
The minimum chromatic violation problem: A polyhedral approach
Discrete Applied Mathematics, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mónica Braga +5 more
openaire +3 more sources
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
M. Fischetti, P. Toth
semanticscholar +3 more sources
A spectral approach to polyhedral dimension
Mathematical Programming, 1990The author defines a new dimension function for polytopes using the convex hull of the edge or arc incidence vectors of Hamiltonian tours and other objects in graphs. A matrix with rows equal to the extreme points of the polytope and supplemented with a column of units is constructed. The matrix is reduced to diagonal form by orthogonal transformations.
openaire +1 more source
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 +5 more sources
A Polyhedral Approach to the Feedback Vertex Set Problem
Conference on Integer Programming and Combinatorial Optimization, 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.
M. Funke, G. Reinelt
semanticscholar +3 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 +3 more sources
Polyhedral Corner Reflectors Multidomain Joint Characterization With Fully Polarimetric Radar
IEEE Transactions on Antennas and PropagationPolyhedral corner reflectors, comprising multiple identical trihedral corner reflectors, represent significant passive interference sources in the radar field.
Hao-Liang Li, Si-Wei Chen
semanticscholar +1 more source
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 +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 +4 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 +3 more sources