Sciweavers

11 search results - page 1 / 3
» Feasibility of the Mixed Postman Problem with Restrictions o...
Sort
View
ENDM
2007
69views more  ENDM 2007»
13 years 7 months ago
Feasibility of the Mixed Postman Problem with Restrictions on the Edges
Francisco Javier Zaragoza Martínez
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...
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....
MP
2008
137views more  MP 2008»
13 years 7 months ago
Valid inequalities and restrictions for stochastic programming problems with first order stochastic dominance constraints
Stochastic dominance relations are well-studied in statistics, decision theory and economics. Recently, there has been significant interest in introducing dominance relations into...
Nilay Noyan, Andrzej Ruszczynski