Ontology type: schema:ScholarlyArticle
2013-08
AUTHORSJ. Coego, L. Mandow, J. L. Pérez de la Cruz
ABSTRACTMany real world problems involve several, usually conflicting, objectives. Multiobjective analysis deals with these problems locating trade-offs between different optimal solutions. Regarding graph search problems, several algorithms based on best-first and depth-first approaches have been proposed to return the set of all Pareto optimal solutions. This article presents a detailed comparison between two representatives of multiobjective depth-first algorithms, PIDMOA* and MO-DF-BnB. Both of them extend previous single-objective search algorithms with linear-space requirements to the multiobjective case. Experimental analyses on their time performance over tree-shaped search spaces are presented. The results clarify the fitness of both algorithms to parameters like the number or depth of goal nodes. More... »
PAGES821-829
http://scigraph.springernature.com/pub.10.1007/s10845-012-0632-y
DOIhttp://dx.doi.org/10.1007/s10845-012-0632-y
DIMENSIONShttps://app.dimensions.ai/details/publication/pub.1006521246
JSON-LD is the canonical representation for SciGraph data.
TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT
[
{
"@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json",
"about": [
{
"id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0801",
"inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/",
"name": "Artificial Intelligence and Image Processing",
"type": "DefinedTerm"
},
{
"id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/08",
"inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/",
"name": "Information and Computing Sciences",
"type": "DefinedTerm"
}
],
"author": [
{
"affiliation": {
"alternateName": "University of Malaga",
"id": "https://www.grid.ac/institutes/grid.10215.37",
"name": [
"Dpto. Lenguajes y Ciencias de la Computaci\u00f3n, Universidad de M\u00e1laga, Bulevar Louis Pasteur, 35, 29071, Malaga, Spain"
],
"type": "Organization"
},
"familyName": "Coego",
"givenName": "J.",
"id": "sg:person.011651000035.25",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011651000035.25"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "University of Malaga",
"id": "https://www.grid.ac/institutes/grid.10215.37",
"name": [
"Dpto. Lenguajes y Ciencias de la Computaci\u00f3n, Universidad de M\u00e1laga, Bulevar Louis Pasteur, 35, 29071, Malaga, Spain"
],
"type": "Organization"
},
"familyName": "Mandow",
"givenName": "L.",
"id": "sg:person.012065311235.60",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012065311235.60"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "University of Malaga",
"id": "https://www.grid.ac/institutes/grid.10215.37",
"name": [
"Dpto. Lenguajes y Ciencias de la Computaci\u00f3n, Universidad de M\u00e1laga, Bulevar Louis Pasteur, 35, 29071, Malaga, Spain"
],
"type": "Organization"
},
"familyName": "P\u00e9rez de la Cruz",
"givenName": "J. L.",
"id": "sg:person.011222621661.19",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011222621661.19"
],
"type": "Person"
}
],
"citation": [
{
"id": "https://doi.org/10.1016/j.cor.2008.02.002",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1006277134"
],
"type": "CreativeWork"
},
{
"id": "sg:pub.10.1007/978-3-642-10291-2_27",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1009850090",
"https://doi.org/10.1007/978-3-642-10291-2_27"
],
"type": "CreativeWork"
},
{
"id": "sg:pub.10.1007/978-3-642-10291-2_27",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1009850090",
"https://doi.org/10.1007/978-3-642-10291-2_27"
],
"type": "CreativeWork"
},
{
"id": "sg:pub.10.1007/978-1-4612-1538-7",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1018081143",
"https://doi.org/10.1007/978-1-4612-1538-7"
],
"type": "CreativeWork"
},
{
"id": "sg:pub.10.1007/978-1-4612-1538-7",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1018081143",
"https://doi.org/10.1007/978-1-4612-1538-7"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1145/1754399.1754400",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1029423234"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1016/0004-3702(85)90084-0",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1030400469"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1016/0004-3702(85)90084-0",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1030400469"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1016/0020-0190(96)00009-9",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1038700679"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1016/0004-3702(94)00047-6",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1039071211"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1145/1089023.1089024",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1040031928"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1016/j.ejor.2009.10.015",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1046770222"
],
"type": "CreativeWork"
},
{
"id": "sg:pub.10.1007/s10845-008-0169-2",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1048419306",
"https://doi.org/10.1007/s10845-008-0169-2"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1109/34.297950",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1061156013"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.1287/ijoc.1070.0260",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1064706675"
],
"type": "CreativeWork"
},
{
"id": "https://doi.org/10.2307/1910129",
"sameAs": [
"https://app.dimensions.ai/details/publication/pub.1069639071"
],
"type": "CreativeWork"
}
],
"datePublished": "2013-08",
"datePublishedReg": "2013-08-01",
"description": "Many real world problems involve several, usually conflicting, objectives. Multiobjective analysis deals with these problems locating trade-offs between different optimal solutions. Regarding graph search problems, several algorithms based on best-first and depth-first approaches have been proposed to return the set of all Pareto optimal solutions. This article presents a detailed comparison between two representatives of multiobjective depth-first algorithms, PIDMOA* and MO-DF-BnB. Both of them extend previous single-objective search algorithms with linear-space requirements to the multiobjective case. Experimental analyses on their time performance over tree-shaped search spaces are presented. The results clarify the fitness of both algorithms to parameters like the number or depth of goal nodes.",
"genre": "research_article",
"id": "sg:pub.10.1007/s10845-012-0632-y",
"inLanguage": [
"en"
],
"isAccessibleForFree": false,
"isPartOf": [
{
"id": "sg:journal.1043477",
"issn": [
"0956-5515",
"1572-8145"
],
"name": "Journal of Intelligent Manufacturing",
"type": "Periodical"
},
{
"issueNumber": "4",
"type": "PublicationIssue"
},
{
"type": "PublicationVolume",
"volumeNumber": "24"
}
],
"name": "A comparison of multiobjective depth-first algorithms",
"pagination": "821-829",
"productId": [
{
"name": "readcube_id",
"type": "PropertyValue",
"value": [
"1f0fde302e6d6571343fe0b86c60d298f31fab87cd16aaba9a2dc559c4f4aa34"
]
},
{
"name": "doi",
"type": "PropertyValue",
"value": [
"10.1007/s10845-012-0632-y"
]
},
{
"name": "dimensions_id",
"type": "PropertyValue",
"value": [
"pub.1006521246"
]
}
],
"sameAs": [
"https://doi.org/10.1007/s10845-012-0632-y",
"https://app.dimensions.ai/details/publication/pub.1006521246"
],
"sdDataset": "articles",
"sdDatePublished": "2019-04-10T23:18",
"sdLicense": "https://scigraph.springernature.com/explorer/license/",
"sdPublisher": {
"name": "Springer Nature - SN SciGraph project",
"type": "Organization"
},
"sdSource": "s3://com-uberresearch-data-dimensions-target-20181106-alternative/cleanup/v134/2549eaecd7973599484d7c17b260dba0a4ecb94b/merge/v9/a6c9fde33151104705d4d7ff012ea9563521a3ce/jats-lookup/v90/0000000001_0000000264/records_8693_00000486.jsonl",
"type": "ScholarlyArticle",
"url": "http://link.springer.com/10.1007/s10845-012-0632-y"
}
]Download the RDF metadata as: json-ld nt turtle xml License info
JSON-LD is a popular format for linked data which is fully compatible with JSON.
curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/s10845-012-0632-y'
N-Triples is a line-based linked data format ideal for batch operations.
curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/s10845-012-0632-y'
Turtle is a human-readable linked data format.
curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/s10845-012-0632-y'
RDF/XML is a standard XML format for linked data.
curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/s10845-012-0632-y'
This table displays all metadata directly associated to this object as RDF triples.
117 TRIPLES
21 PREDICATES
40 URIs
19 LITERALS
7 BLANK NODES