Sciweavers

4266 search results - page 112 / 854
» The container loading problem
Sort
View
COCOA
2008
Springer
15 years 4 months ago
Strong Formulations for 2-Node-Connected Steiner Network Problems
Abstract. We consider a survivable network design problem known as the 2-NodeConnected Steiner Network Problem (2NCON): we are given a weighted undirected graph with a node partiti...
Markus Chimani, Maria Kandyba, Ivana Ljubic, Petra...
DAM
2007
70views more  DAM 2007»
15 years 2 months ago
Tree-edges deletion problems with bounded diameter obstruction sets
We study the following problem: Given a tree G and a finite set of trees H, find a subset O of the edges of G such that G − O does not contain a subtree isomorphic to a tree f...
Dekel Tsur
LICS
2009
IEEE
15 years 9 months ago
The General Vector Addition System Reachability Problem by Presburger Inductive Invariants
The reachability problem for Vector Addition Systems (VASs) is a central problem of net theory. The general problem is known decidable by algorithms exclusively based on the class...
Jérôme Leroux
GECCO
2007
Springer
182views Optimization» more  GECCO 2007»
15 years 8 months ago
An analysis of the effects of population structure on scalable multiobjective optimization problems
Multiobjective evolutionary algorithms (MOEA) are an effective tool for solving search and optimization problems containing several incommensurable and possibly conflicting objec...
Michael Kirley, Robert L. Stewart
EMMCVPR
2001
Springer
15 years 7 months ago
Estimation of Distribution Algorithms: A New Evolutionary Computation Approach for Graph Matching Problems
The interest of graph matching techniques in the pattern recognition field is increasing due to the versatility of representing knowledge in the form of graphs. However, the size ...
Endika Bengoetxea, Pedro Larrañaga, Isabell...