Sciweavers

4266 search results - page 250 / 854
» The container loading problem
Sort
View
CSR
2009
Springer
15 years 11 months ago
Partitioning Graphs into Connected Parts
The 2-Disjoint Connected Subgraphs problem asks if a given graph has two vertex-disjoint connected subgraphs containing prespecified sets of vertices. We show that this problem is...
Pim van 't Hof, Daniël Paulusma, Gerhard J. W...
ALGORITHMICA
2010
111views more  ALGORITHMICA 2010»
15 years 4 months ago
Three-Sided Stable Matchings with Cyclic Preferences
Knuth [14] asked whether the stable matching problem can be generalised to three dimensions i. e., for families containing a man, a woman and a dog. Subsequently, several authors ...
Péter Biró, Eric McDermid
SIAMDM
2008
77views more  SIAMDM 2008»
15 years 4 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....
IJMMS
1998
93views more  IJMMS 1998»
15 years 4 months ago
Construction of problem-solving methods as parametric design
The knowledge-engineering literature contains a number of approaches for constructing or selecting problem solvers. Some of these approaches are based on indexing and selecting a ...
Annette ten Teije, Frank van Harmelen, A. Th. Schr...
BROADNETS
2007
IEEE
15 years 11 months ago
Dedicated path protection for waveband switching in WDM networks (invited paper)
— This paper considers the problem of dedicated path-protection in a wavelength-division multiplexing (WDM) mesh network with waveband switching (WBS) functionality under shared ...
Mengke Li, Byrav Ramamurthy