Sciweavers

6740 search results - page 306 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
EVOW
2008
Springer
15 years 5 months ago
Metaheuristics for the Bi-objective Ring Star Problem
The bi-objective ring star problem aims to locate a cycle through a subset of nodes of a graph while optimizing two types of cost. The first criterion is to minimize a ring cost, r...
Arnaud Liefooghe, Laetitia Jourdan, Matthieu Basse...
NIPS
2004
15 years 5 months ago
Triangle Fixing Algorithms for the Metric Nearness Problem
Various problems in machine learning, databases, and statistics involve pairwise distances among a set of objects. It is often desirable for these distances to satisfy the propert...
Inderjit S. Dhillon, Suvrit Sra, Joel A. Tropp
DISOPT
2008
113views more  DISOPT 2008»
15 years 4 months ago
The inverse 1-median problem on a cycle
Abstract. Let the graph G = (V, E) be a cycle with n + 1 vertices, nonnegative vertex weights and positive edge lengths. The inverse 1-median problem on a cycle consists in changin...
Rainer E. Burkard, Carmen Pleschiutschnig, Jianzho...
DAM
1999
132views more  DAM 1999»
15 years 3 months ago
Data-dependent Bounds for the General and the Asymmetric Stacker-Crane Problems
The Stacker-Crane Problem (SCP) isa sequencing problem, arising inscheduling and transportation, that consists of nding the minimum cost cycle on a mixed graph with oriented arcs ...
Giovanni Righini, Marco Trubian
JAIR
2010
99views more  JAIR 2010»
15 years 2 months ago
Developing Approaches for Solving a Telecommunications Feature Subscription Problem
Call control features (e.g., call-divert, voice-mail) are primitive options to which users can subscribe off-line to personalise their service. The configuration of a feature su...
David Lesaint, Deepak Mehta, Barry O'Sullivan, Lui...