Results 151 to 160 of about 65,579 (181)

A Polyhedral Approach to the Asymmetric Traveling Salesman Problem

Management Science, 1997
Several 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

2002
We 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

1999
We 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.

2009
Polytopes $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

2014
We 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, Löffler, Maarten, Mutser, Paul, Staals, Frank   +3 more
openaire   +3 more sources

Integrative oncology: Addressing the global challenges of cancer prevention and treatment

Ca-A Cancer Journal for Clinicians, 2022
Jun J Mao,, Msce, Lorenzo Cohen, Karen M Mustian   +2 more
exaly  

Polyhedral approaches to network survivability

1991
M. Grötschel, C. Monma, M. Stoer
openaire   +1 more source

Polyhedral skeletal electron pair approach

Accounts of Chemical Research, 1984
openaire   +1 more source

Polyhedral separation approaches for pattern classification problems

2019
In 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

Obesity and adverse breast cancer risk and outcome: Mechanistic insights and strategies for intervention

Ca-A Cancer Journal for Clinicians, 2017
Cynthia Morata-Tarifa, Joyce M Slingerland   +1 more
exaly