Sciweavers

805 search results - page 49 / 161
» Combinatorial optimization problems in self-assembly
Sort
View
CEC
2009
IEEE
14 years 5 months ago
A multi-objective approach to Redundancy Allocation Problem in parallel-series systems
— The Redundancy Allocation Problem (RAP) is a kind of reliability optimization problems. It involves the selection of components with appropriate levels of redundancy or reliabi...
Zai Wang, Tianshi Chen, Ke Tang, Xin Yao
CPAIOR
2010
Springer
14 years 3 months ago
Solving Connected Subgraph Problems in Wildlife Conservation
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...
Bistra N. Dilkina, Carla P. Gomes
EVOW
2007
Springer
14 years 5 months ago
A Hybrid Method for Solving Large-Scale Supply Chain Problems
Abstract. The strategic supply chain design problem which allows capacity shifts and budget limitations can be formulated as a linear program. Since facilities are allowed to be op...
Steffen Wolf, Peter Merz
INFORMATICALT
2000
125views more  INFORMATICALT 2000»
13 years 10 months ago
An Algorithm for Construction of Test Cases for the Quadratic Assignment Problem
In this paper we present an algorithm for generating quadratic assignment problem (QAP) instances with known provably optimal solution. The flow matrix of such instances is constru...
Gintaras Palubeckis
HEURISTICS
1998
103views more  HEURISTICS 1998»
13 years 10 months ago
Computing Approximate Solutions of the Maximum Covering Problem with GRASP
We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a s...
Mauricio G. C. Resende