Sciweavers

177 search results - page 9 / 36
» arc 2008
Sort
View
COR
2006
94views more  COR 2006»
13 years 7 months ago
A comparison of two different formulations for arc routing problems on mixed graphs
Arc Routing Problems on mixed graphs have been modelled in the literature either using just one variable per edge or associating to each edge two variables, each one representing ...
Angel Corberán, Enrique Mota, José M...
IPL
2007
107views more  IPL 2007»
13 years 7 months ago
Flows in dynamic networks with aggregate arc capacities
Dynamic networks are characterized by transit times on edges. Dynamic flow problems consider transshipment problems in dynamic networks. We introduce a new version of dynamic fl...
Vardges Melkonian
IPL
2008
82views more  IPL 2008»
13 years 7 months ago
On fully orientability of 2-degenerate graphs
Suppose that D is an acyclic orientation of the graph G. An arc of D is dependent if its reversal creates a directed cycle. Let d(D) denote the number of dependent arcs in D. Defi...
Hsin-Hao Lai, Gerard J. Chang, Ko-Wei Lih
ENGL
2008
216views more  ENGL 2008»
13 years 7 months ago
Application of TLM and Cassie-Mayr Arc model on Transformer Aging and Incipient Faults Simulation
Abstract--The development of the transformer insulation failure undergoes three stages: insulation aging, incipient faults and a short circuit. This paper presents a complete schem...
X. Wang, Mark Sumner, D. W. P. Thomas
SIAMDM
2008
77views more  SIAMDM 2008»
13 years 7 months ago
The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra
The Windy Postman Problem consists of finding a minimum cost traversal of all the edges of an undirected graph with two costs associated with each edge, representing the costs of ...
Angel Corberán, Isaac Plana, José M....