Sciweavers

4266 search results - page 88 / 854
» The container loading problem
Sort
View
COCOON
2005
Springer
14 years 7 days ago
A New Approach and Faster Exact Methods for the Maximum Common Subgraph Problem
The Maximum Common Subgraph (MCS) problem appears in many guises and in a wide variety of applications. The usual goal is to take as inputs two graphs, of order m and n, respectiv...
W. Henry Suters, Faisal N. Abu-Khzam, Yun Zhang, C...
EOR
2006
93views more  EOR 2006»
13 years 10 months ago
A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
Given a set of rectangular pieces and a container of fixed width and variable length, the two-dimensional strip packing problem (2D-SPP) consists of orthogonally placing all the p...
Andreas Bortfeldt
CSE
2009
IEEE
14 years 5 months ago
Black Bridge: A Scatternet Formation Algorithm for Solving a New Emerging Problem
Abstract: Nowadays, it has become common to equip a device with Bluetooth. As such devices become pervasive in the world; much work has been done on forming them into a network, ho...
Yanqin Yang, Minyi Guo, Feilong Tang, Gongwei Zhan...
TCBB
2008
73views more  TCBB 2008»
13 years 10 months ago
Nature Reserve Selection Problem: A Tight Approximation Algorithm
The Nature Reserve Selection Problem is a problem that arises in the context of studying biodiversity conservation. Subject to budgetary constraints, the problem is to select a set...
Magnus Bordewich, Charles Semple
TAMC
2009
Springer
14 years 4 months ago
Approximability and Fixed-Parameter Tractability for the Exemplar Genomic Distance Problems
In this paper, we present a survey of the approximability and fixed-parameter tractability results for some Exemplar Genomic Distance problems. We mainly focus on three problems: ...
Binhai Zhu