53 search results - page 8 / 11 » Backdoors to Combinatorial Optimization: Feasibility and Opt... |
CPAIOR
2008
Springer
13 years 9 months ago
2008
Springer
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
CPAIOR
2010
Springer
14 years 22 days ago
2010
Springer
Abstract. We investigate mathematical formulations and solution techniques for a variant of the Connected Subgraph Problem. Given a connected graph with costs and profits associat...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
Many combinatorial problems--such as the traveling salesman, feedback arcset, cutwidth, and treewidth problem-can be formulated as finding a feasible permutation of n elements. Ty...
PPSN
1998
Springer
14 years 4 days ago
1998
Springer
This paper presents two variants of Genetic Algorithms (GAs) for solving the Multiple Container Packing Problem (MCPP), which is a combinatorial optimization problem comprising sim...
CCECE
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract—In this work, we propose a framework for supervisory cooperative estimation of multi-agent linear time-invariant (LTI) systems. We introduce a group of sub-observers, ea...