Multi-Objective Integer Programming: An Improved Recursive Algorithm View Full Text


Ontology type: schema:ScholarlyArticle      Open Access: True


Article Info

DATE

2014-02

AUTHORS

Melih Ozlen, Benjamin A. Burton, Cameron A. G. MacRae

ABSTRACT

This paper introduces an improved recursive algorithm to generate the set of all nondominated objective vectors for the Multi-Objective Integer Programming (MOIP) problem. We significantly improve the earlier recursive algorithm of Özlen and Azizoğlu by using the set of already solved subproblems and their solutions to avoid solving a large number of IPs. A numerical example is presented to explain the workings of the algorithm, and we conduct a series of computational experiments to show the savings that can be obtained. As our experiments show, the improvement becomes more significant as the problems grow larger in terms of the number of objectives. More... »

PAGES

470-482

References to SciGraph publications

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/s10957-013-0364-y

DOI

http://dx.doi.org/10.1007/s10957-013-0364-y

DIMENSIONS

https://app.dimensions.ai/details/publication/pub.1044829144


Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
Incoming Citations Browse incoming citations for this publication using opencitations.net

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/0103", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Numerical and Computational Mathematics", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/01", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Mathematical Sciences", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "RMIT University", 
          "id": "https://www.grid.ac/institutes/grid.1017.7", 
          "name": [
            "School of Mathematical and Geospatial Sciences, RMIT University, VIC 3000, Melbourne, Australia"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Ozlen", 
        "givenName": "Melih", 
        "id": "sg:person.01151511254.56", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01151511254.56"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "University of Queensland", 
          "id": "https://www.grid.ac/institutes/grid.1003.2", 
          "name": [
            "School of Mathematics and Physics, University of Queensland, QLD 4072, Brisbane, Australia"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Burton", 
        "givenName": "Benjamin A.", 
        "id": "sg:person.01223220566.38", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01223220566.38"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "RMIT University", 
          "id": "https://www.grid.ac/institutes/grid.1017.7", 
          "name": [
            "School of Mathematical and Geospatial Sciences, RMIT University, VIC 3000, Melbourne, Australia"
          ], 
          "type": "Organization"
        }, 
        "familyName": "MacRae", 
        "givenName": "Cameron A. G.", 
        "id": "sg:person.015410047647.52", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015410047647.52"
        ], 
        "type": "Person"
      }
    ], 
    "citation": [
      {
        "id": "https://doi.org/10.1016/j.ejor.2008.02.005", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1001399521"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/j.ejor.2005.02.072", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1004439017"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1023/a:1004605810296", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1007421870", 
          "https://doi.org/10.1023/a:1004605810296"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/s0377-2217(01)00153-9", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1008650226"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/j.ejor.2008.10.023", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1021886714"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/j.disopt.2010.03.005", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1022680606"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/j.ejor.2004.08.029", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1033044235"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/s0377-2217(03)00255-8", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1036049486"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/s0377-2217(03)00255-8", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1036049486"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/0377-2217(82)90182-5", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1036433751"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/0377-2217(82)90182-5", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1036433751"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-3-540-85646-7_8", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1045103467", 
          "https://doi.org/10.1007/978-3-540-85646-7_8"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-3-540-85646-7_8", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1045103467", 
          "https://doi.org/10.1007/978-3-540-85646-7_8"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/s10898-012-9921-4", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1051368595", 
          "https://doi.org/10.1007/s10898-012-9921-4"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1287/ijoc.1090.0342", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1064706757"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1287/mnsc.1100.1248", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1064715397"
        ], 
        "type": "CreativeWork"
      }
    ], 
    "datePublished": "2014-02", 
    "datePublishedReg": "2014-02-01", 
    "description": "This paper introduces an improved recursive algorithm to generate the set of all nondominated objective vectors for the Multi-Objective Integer Programming (MOIP) problem. We significantly improve the earlier recursive algorithm of \u00d6zlen and Azizo\u011flu by using the set of already solved subproblems and their solutions to avoid solving a large number of IPs. A numerical example is presented to explain the workings of the algorithm, and we conduct a series of computational experiments to show the savings that can be obtained. As our experiments show, the improvement becomes more significant as the problems grow larger in terms of the number of objectives.", 
    "genre": "research_article", 
    "id": "sg:pub.10.1007/s10957-013-0364-y", 
    "inLanguage": [
      "en"
    ], 
    "isAccessibleForFree": true, 
    "isFundedItemOf": [
      {
        "id": "sg:grant.3561548", 
        "type": "MonetaryGrant"
      }
    ], 
    "isPartOf": [
      {
        "id": "sg:journal.1044187", 
        "issn": [
          "0022-3239", 
          "1573-2878"
        ], 
        "name": "Journal of Optimization Theory and Applications", 
        "type": "Periodical"
      }, 
      {
        "issueNumber": "2", 
        "type": "PublicationIssue"
      }, 
      {
        "type": "PublicationVolume", 
        "volumeNumber": "160"
      }
    ], 
    "name": "Multi-Objective Integer Programming: An Improved Recursive Algorithm", 
    "pagination": "470-482", 
    "productId": [
      {
        "name": "readcube_id", 
        "type": "PropertyValue", 
        "value": [
          "d58915b451e9aa2d09eb30c2fa5c367facfa3aa9390583fc15d6e833a008a58d"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/s10957-013-0364-y"
        ]
      }, 
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1044829144"
        ]
      }
    ], 
    "sameAs": [
      "https://doi.org/10.1007/s10957-013-0364-y", 
      "https://app.dimensions.ai/details/publication/pub.1044829144"
    ], 
    "sdDataset": "articles", 
    "sdDatePublished": "2019-04-10T16:43", 
    "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_8669_00000515.jsonl", 
    "type": "ScholarlyArticle", 
    "url": "http://link.springer.com/10.1007%2Fs10957-013-0364-y"
  }
]
 

Download the RDF metadata as:  json-ld nt turtle xml License info

HOW TO GET THIS DATA PROGRAMMATICALLY:

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/s10957-013-0364-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/s10957-013-0364-y'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/s10957-013-0364-y'

RDF/XML is a standard XML format for linked data.

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/s10957-013-0364-y'


 

This table displays all metadata directly associated to this object as RDF triples.

122 TRIPLES      21 PREDICATES      40 URIs      19 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/s10957-013-0364-y schema:about anzsrc-for:01
2 anzsrc-for:0103
3 schema:author Nefbb98de8c784177b4f64123ef803122
4 schema:citation sg:pub.10.1007/978-3-540-85646-7_8
5 sg:pub.10.1007/s10898-012-9921-4
6 sg:pub.10.1023/a:1004605810296
7 https://doi.org/10.1016/0377-2217(82)90182-5
8 https://doi.org/10.1016/j.disopt.2010.03.005
9 https://doi.org/10.1016/j.ejor.2004.08.029
10 https://doi.org/10.1016/j.ejor.2005.02.072
11 https://doi.org/10.1016/j.ejor.2008.02.005
12 https://doi.org/10.1016/j.ejor.2008.10.023
13 https://doi.org/10.1016/s0377-2217(01)00153-9
14 https://doi.org/10.1016/s0377-2217(03)00255-8
15 https://doi.org/10.1287/ijoc.1090.0342
16 https://doi.org/10.1287/mnsc.1100.1248
17 schema:datePublished 2014-02
18 schema:datePublishedReg 2014-02-01
19 schema:description This paper introduces an improved recursive algorithm to generate the set of all nondominated objective vectors for the Multi-Objective Integer Programming (MOIP) problem. We significantly improve the earlier recursive algorithm of Özlen and Azizoğlu by using the set of already solved subproblems and their solutions to avoid solving a large number of IPs. A numerical example is presented to explain the workings of the algorithm, and we conduct a series of computational experiments to show the savings that can be obtained. As our experiments show, the improvement becomes more significant as the problems grow larger in terms of the number of objectives.
20 schema:genre research_article
21 schema:inLanguage en
22 schema:isAccessibleForFree true
23 schema:isPartOf Ndb373fd773254609a0b54791c2937537
24 Nec32f55a68e04ff89b5b7b3ffc470f7e
25 sg:journal.1044187
26 schema:name Multi-Objective Integer Programming: An Improved Recursive Algorithm
27 schema:pagination 470-482
28 schema:productId N463c625b6eb0494c9bfee3bc4d5d0ef1
29 N8d96e8ba96ba42248124490de2eb4c6e
30 Nc6adf00575c74ae5b876234f0323d1fa
31 schema:sameAs https://app.dimensions.ai/details/publication/pub.1044829144
32 https://doi.org/10.1007/s10957-013-0364-y
33 schema:sdDatePublished 2019-04-10T16:43
34 schema:sdLicense https://scigraph.springernature.com/explorer/license/
35 schema:sdPublisher N88b54149f50f436f930d71be184ada6f
36 schema:url http://link.springer.com/10.1007%2Fs10957-013-0364-y
37 sgo:license sg:explorer/license/
38 sgo:sdDataset articles
39 rdf:type schema:ScholarlyArticle
40 N463c625b6eb0494c9bfee3bc4d5d0ef1 schema:name doi
41 schema:value 10.1007/s10957-013-0364-y
42 rdf:type schema:PropertyValue
43 N7acb70aa0aee4ecf90bec58caf639698 rdf:first sg:person.015410047647.52
44 rdf:rest rdf:nil
45 N88b54149f50f436f930d71be184ada6f schema:name Springer Nature - SN SciGraph project
46 rdf:type schema:Organization
47 N8d96e8ba96ba42248124490de2eb4c6e schema:name readcube_id
48 schema:value d58915b451e9aa2d09eb30c2fa5c367facfa3aa9390583fc15d6e833a008a58d
49 rdf:type schema:PropertyValue
50 Nc6adf00575c74ae5b876234f0323d1fa schema:name dimensions_id
51 schema:value pub.1044829144
52 rdf:type schema:PropertyValue
53 Ndb373fd773254609a0b54791c2937537 schema:volumeNumber 160
54 rdf:type schema:PublicationVolume
55 Ne7c8c5b0092b44fd9036b66cbd555b88 rdf:first sg:person.01223220566.38
56 rdf:rest N7acb70aa0aee4ecf90bec58caf639698
57 Nec32f55a68e04ff89b5b7b3ffc470f7e schema:issueNumber 2
58 rdf:type schema:PublicationIssue
59 Nefbb98de8c784177b4f64123ef803122 rdf:first sg:person.01151511254.56
60 rdf:rest Ne7c8c5b0092b44fd9036b66cbd555b88
61 anzsrc-for:01 schema:inDefinedTermSet anzsrc-for:
62 schema:name Mathematical Sciences
63 rdf:type schema:DefinedTerm
64 anzsrc-for:0103 schema:inDefinedTermSet anzsrc-for:
65 schema:name Numerical and Computational Mathematics
66 rdf:type schema:DefinedTerm
67 sg:grant.3561548 http://pending.schema.org/fundedItem sg:pub.10.1007/s10957-013-0364-y
68 rdf:type schema:MonetaryGrant
69 sg:journal.1044187 schema:issn 0022-3239
70 1573-2878
71 schema:name Journal of Optimization Theory and Applications
72 rdf:type schema:Periodical
73 sg:person.01151511254.56 schema:affiliation https://www.grid.ac/institutes/grid.1017.7
74 schema:familyName Ozlen
75 schema:givenName Melih
76 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01151511254.56
77 rdf:type schema:Person
78 sg:person.01223220566.38 schema:affiliation https://www.grid.ac/institutes/grid.1003.2
79 schema:familyName Burton
80 schema:givenName Benjamin A.
81 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01223220566.38
82 rdf:type schema:Person
83 sg:person.015410047647.52 schema:affiliation https://www.grid.ac/institutes/grid.1017.7
84 schema:familyName MacRae
85 schema:givenName Cameron A. G.
86 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015410047647.52
87 rdf:type schema:Person
88 sg:pub.10.1007/978-3-540-85646-7_8 schema:sameAs https://app.dimensions.ai/details/publication/pub.1045103467
89 https://doi.org/10.1007/978-3-540-85646-7_8
90 rdf:type schema:CreativeWork
91 sg:pub.10.1007/s10898-012-9921-4 schema:sameAs https://app.dimensions.ai/details/publication/pub.1051368595
92 https://doi.org/10.1007/s10898-012-9921-4
93 rdf:type schema:CreativeWork
94 sg:pub.10.1023/a:1004605810296 schema:sameAs https://app.dimensions.ai/details/publication/pub.1007421870
95 https://doi.org/10.1023/a:1004605810296
96 rdf:type schema:CreativeWork
97 https://doi.org/10.1016/0377-2217(82)90182-5 schema:sameAs https://app.dimensions.ai/details/publication/pub.1036433751
98 rdf:type schema:CreativeWork
99 https://doi.org/10.1016/j.disopt.2010.03.005 schema:sameAs https://app.dimensions.ai/details/publication/pub.1022680606
100 rdf:type schema:CreativeWork
101 https://doi.org/10.1016/j.ejor.2004.08.029 schema:sameAs https://app.dimensions.ai/details/publication/pub.1033044235
102 rdf:type schema:CreativeWork
103 https://doi.org/10.1016/j.ejor.2005.02.072 schema:sameAs https://app.dimensions.ai/details/publication/pub.1004439017
104 rdf:type schema:CreativeWork
105 https://doi.org/10.1016/j.ejor.2008.02.005 schema:sameAs https://app.dimensions.ai/details/publication/pub.1001399521
106 rdf:type schema:CreativeWork
107 https://doi.org/10.1016/j.ejor.2008.10.023 schema:sameAs https://app.dimensions.ai/details/publication/pub.1021886714
108 rdf:type schema:CreativeWork
109 https://doi.org/10.1016/s0377-2217(01)00153-9 schema:sameAs https://app.dimensions.ai/details/publication/pub.1008650226
110 rdf:type schema:CreativeWork
111 https://doi.org/10.1016/s0377-2217(03)00255-8 schema:sameAs https://app.dimensions.ai/details/publication/pub.1036049486
112 rdf:type schema:CreativeWork
113 https://doi.org/10.1287/ijoc.1090.0342 schema:sameAs https://app.dimensions.ai/details/publication/pub.1064706757
114 rdf:type schema:CreativeWork
115 https://doi.org/10.1287/mnsc.1100.1248 schema:sameAs https://app.dimensions.ai/details/publication/pub.1064715397
116 rdf:type schema:CreativeWork
117 https://www.grid.ac/institutes/grid.1003.2 schema:alternateName University of Queensland
118 schema:name School of Mathematics and Physics, University of Queensland, QLD 4072, Brisbane, Australia
119 rdf:type schema:Organization
120 https://www.grid.ac/institutes/grid.1017.7 schema:alternateName RMIT University
121 schema:name School of Mathematical and Geospatial Sciences, RMIT University, VIC 3000, Melbourne, Australia
122 rdf:type schema:Organization
 




Preview window. Press ESC to close (or click here)


...