Local search algorithm for the compacted cells area problem.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/ictai/ChiaL00
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/ictai/ChiaL00
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Andrew_Lim_0001
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Dennis_Joshua_Chia
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1109%2FTAI.2000.889885
>
foaf:
homepage
<
https://doi.org/10.1109/TAI.2000.889885
>
dc:
identifier
DBLP conf/ictai/ChiaL00
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1109%2FTAI.2000.889885
(xsd:string)
dcterms:
issued
2000
(xsd:gYear)
rdfs:
label
Local search algorithm for the compacted cells area problem.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Andrew_Lim_0001
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Dennis_Joshua_Chia
>
swrc:
pages
294-297
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/ictai/2000
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/ictai/ChiaL00/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/ictai/ChiaL00
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/ictai/ictai2000.html#ChiaL00
>
rdfs:
seeAlso
<
https://doi.org/10.1109/TAI.2000.889885
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/ictai
>
dc:
subject
computational complexity; search problems; divide and conquer methods; local search algorithm; compacted cells area problem; polynomial-time solvable; NP-hard; divide-and-conquer approach; lower-bound; optimal cost; taboo search algorithm; lower bounds
(xsd:string)
dc:
title
Local search algorithm for the compacted cells area problem.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document