Sciweavers

14518 search results - page 228 / 2904
» Two Problems for Sophistication
Sort
View
81
Voted
DISOPT
2008
113views more  DISOPT 2008»
15 years 25 days 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...
95
Voted
ANOR
2006
64views more  ANOR 2006»
15 years 25 days ago
A note on asymptotic formulae for one-dimensional network flow problems
This note develops asymptotic formulae for single-commodity network flow problems with random inputs. The transportation linear programming problem (TLP) where N points lie in a r...
Carlos F. Daganzo, Karen R. Smilowitz
96
Voted
EOR
2007
84views more  EOR 2007»
15 years 22 days ago
The multi-layered network design problem
act 11 We address the problem of designing a network built on several layers. This problem occurs in practical applications 12 but has not been studied extensively from the point o...
Arnaud Knippel, Benoit Lardeux
IPL
2007
121views more  IPL 2007»
15 years 20 days ago
Parameterized complexity of the induced subgraph problem in directed graphs
In this paper, we consider the parameterized complexity of the following problem: Given a hereditary property P on digraphs, an input digraph D and a positive integer k, does D ha...
Venkatesh Raman, Somnath Sikdar
107
Voted
ANOR
2011
96views more  ANOR 2011»
14 years 7 months ago
Global propagation of side constraints for solving over-constrained problems
This article deals with the resolution of over-constrained problems using constraint programming, which often imposes to add to the constraint network new side constraints. These ...
Thierry Petit, Emmanuel Poder