The item dependent stockingcost constraint View Full Text


Ontology type: schema:ScholarlyArticle     


Article Info

DATE

2019-04

AUTHORS

Vinasetan Ratheil Houndji, Pierre Schaus, Laurence Wolsey

ABSTRACT

In a previous work we introduced a global StockingCost constraint to compute the total number of periods between the production periods and the due dates in a multi-order capacitated lot-sizing problem. Here we consider a more general case in which each order can have a different per period stocking cost and the goal is to minimise the total stocking cost. In addition the production capacity, limiting the number of orders produced in a given period, is allowed to vary over time. We propose an efficient filtering algorithm in O(n log n) where n is the number of orders to produce. On a variant of the capacitated lot-sizing problem, we demonstrate experimentally that our new filtering algorithm scales well and is competitive wrt the StockingCost constraint when the stocking cost is the same for all orders. More... »

PAGES

1-27

References to SciGraph publications

  • 1999. Cost-Based Domain Filtering in PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING – CP’99
  • 2002-07. Cost-Based Arc Consistency for Global Cardinality Constraints in CONSTRAINTS
  • 2015. Conflict Ordering Search for Scheduling Problems in PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING
  • 2006-12. A Cost-Regular Based Hybrid Column Generation Approach in CONSTRAINTS
  • 2015. Understanding the Potential of Propagators in INTEGRATION OF AI AND OR TECHNIQUES IN CONSTRAINT PROGRAMMING
  • 2006. Production Planning by Mixed Integer Programming in NONE
  • 2003. An Efficient Bounds Consistency Algorithm for the Global Cardinality Constraint in PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING – CP 2003
  • 2014. The StockingCost Constraint in PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING
  • 1989-08. Facets and algorithms for capacitated lot sizing in MATHEMATICAL PROGRAMMING
  • 2004. A Regular Language Membership Constraint for Finite Sequences of Variables in PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING – CP 2004
  • 1998. Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems in PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING — CP98
  • Identifiers

    URI

    http://scigraph.springernature.com/pub.10.1007/s10601-018-9300-y

    DOI

    http://dx.doi.org/10.1007/s10601-018-9300-y

    DIMENSIONS

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


    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/1103", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Clinical Sciences", 
            "type": "DefinedTerm"
          }, 
          {
            "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/11", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Medical and Health Sciences", 
            "type": "DefinedTerm"
          }
        ], 
        "author": [
          {
            "affiliation": {
              "alternateName": "Universit\u00e9 d'Abomey-Calavi", 
              "id": "https://www.grid.ac/institutes/grid.412037.3", 
              "name": [
                "Institut de Formation et de Recherche en Informatique (IFRI), Universit\u00e9 d\u2019Abomey-Calavi (UAC), Abomey-Calavi, Benin"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Houndji", 
            "givenName": "Vinasetan Ratheil", 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "Universit\u00e9 Catholique de Louvain", 
              "id": "https://www.grid.ac/institutes/grid.7942.8", 
              "name": [
                "Institute of Information and Communication Technologies, Electronics and Applied Mathematics (ICTEAM), Universit\u00e9 catholique de Louvain (UCL), Louvain la Neuve, Belgium"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Schaus", 
            "givenName": "Pierre", 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "Universit\u00e9 Catholique de Louvain", 
              "id": "https://www.grid.ac/institutes/grid.7942.8", 
              "name": [
                "Institute for Multidisciplinary Research in Quantitative Modelling and Analysis (IMMAQ), Universit\u00e9 catholique de Louvain (UCL), Louvain la Neuve, Belgium"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Wolsey", 
            "givenName": "Laurence", 
            "type": "Person"
          }
        ], 
        "citation": [
          {
            "id": "sg:pub.10.1007/0-387-33477-7", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1003225121", 
              "https://doi.org/10.1007/0-387-33477-7"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://app.dimensions.ai/details/publication/pub.1003225121", 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/s0377-2217(97)00030-1", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1008623147"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/s0305-0483(03)00059-8", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1013927686"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/s0305-0483(03)00059-8", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1013927686"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-319-10428-7_29", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1014437114", 
              "https://doi.org/10.1007/978-3-319-10428-7_29"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-319-23219-5_10", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1016789935", 
              "https://doi.org/10.1007/978-3-319-23219-5_10"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/s0305-0483(98)00045-0", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1019769997"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/bf01589110", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1020417359", 
              "https://doi.org/10.1007/bf01589110"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/s10601-006-9003-7", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1021730445", 
              "https://doi.org/10.1007/s10601-006-9003-7"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/s10601-006-9003-7", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1021730445", 
              "https://doi.org/10.1007/s10601-006-9003-7"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-45193-8_41", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1024255352", 
              "https://doi.org/10.1007/978-3-540-45193-8_41"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-45193-8_41", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1024255352", 
              "https://doi.org/10.1007/978-3-540-45193-8_41"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-48085-3_14", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1025585608", 
              "https://doi.org/10.1007/978-3-540-48085-3_14"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-48085-3_14", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1025585608", 
              "https://doi.org/10.1007/978-3-540-48085-3_14"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-49481-2_30", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1030539804", 
              "https://doi.org/10.1007/3-540-49481-2_30"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1023/a:1020506526052", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1039833510", 
              "https://doi.org/10.1023/a:1020506526052"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-319-18008-3_29", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1043190236", 
              "https://doi.org/10.1007/978-3-319-18008-3_29"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-30201-8_36", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1044615390", 
              "https://doi.org/10.1007/978-3-540-30201-8_36"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-30201-8_36", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1044615390", 
              "https://doi.org/10.1007/978-3-540-30201-8_36"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1287/mnsc.30.10.1255", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1064719826"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1287/mnsc.47.7.993.9800", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1064722147"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1287/trsc.32.1.12", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1064735452"
            ], 
            "type": "CreativeWork"
          }
        ], 
        "datePublished": "2019-04", 
        "datePublishedReg": "2019-04-01", 
        "description": "In a previous work we introduced a global StockingCost constraint to compute the total number of periods between the production periods and the due dates in a multi-order capacitated lot-sizing problem. Here we consider a more general case in which each order can have a different per period stocking cost and the goal is to minimise the total stocking cost. In addition the production capacity, limiting the number of orders produced in a given period, is allowed to vary over time. We propose an efficient filtering algorithm in O(n log n) where n is the number of orders to produce. On a variant of the capacitated lot-sizing problem, we demonstrate experimentally that our new filtering algorithm scales well and is competitive wrt the StockingCost constraint when the stocking cost is the same for all orders.", 
        "genre": "research_article", 
        "id": "sg:pub.10.1007/s10601-018-9300-y", 
        "inLanguage": [
          "en"
        ], 
        "isAccessibleForFree": false, 
        "isPartOf": [
          {
            "id": "sg:journal.1043977", 
            "issn": [
              "1383-7133", 
              "1572-9354"
            ], 
            "name": "Constraints", 
            "type": "Periodical"
          }, 
          {
            "issueNumber": "2", 
            "type": "PublicationIssue"
          }, 
          {
            "type": "PublicationVolume", 
            "volumeNumber": "24"
          }
        ], 
        "name": "The item dependent stockingcost constraint", 
        "pagination": "1-27", 
        "productId": [
          {
            "name": "readcube_id", 
            "type": "PropertyValue", 
            "value": [
              "2d2be5c7a95078b01950e8e8a7e99fd131ed09e140c8154ad6be9b5e0946c020"
            ]
          }, 
          {
            "name": "doi", 
            "type": "PropertyValue", 
            "value": [
              "10.1007/s10601-018-9300-y"
            ]
          }, 
          {
            "name": "dimensions_id", 
            "type": "PropertyValue", 
            "value": [
              "pub.1112223142"
            ]
          }
        ], 
        "sameAs": [
          "https://doi.org/10.1007/s10601-018-9300-y", 
          "https://app.dimensions.ai/details/publication/pub.1112223142"
        ], 
        "sdDataset": "articles", 
        "sdDatePublished": "2019-04-11T13:50", 
        "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/0000000371_0000000371/records_130794_00000006.jsonl", 
        "type": "ScholarlyArticle", 
        "url": "https://link.springer.com/10.1007%2Fs10601-018-9300-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/s10601-018-9300-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/s10601-018-9300-y'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/s10601-018-9300-y'

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

    curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/s10601-018-9300-y'


     

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

    140 TRIPLES      21 PREDICATES      45 URIs      19 LITERALS      7 BLANK NODES

    Subject Predicate Object
    1 sg:pub.10.1007/s10601-018-9300-y schema:about anzsrc-for:11
    2 anzsrc-for:1103
    3 schema:author N7aea2635d98c4ccd8c958321d668498b
    4 schema:citation sg:pub.10.1007/0-387-33477-7
    5 sg:pub.10.1007/3-540-49481-2_30
    6 sg:pub.10.1007/978-3-319-10428-7_29
    7 sg:pub.10.1007/978-3-319-18008-3_29
    8 sg:pub.10.1007/978-3-319-23219-5_10
    9 sg:pub.10.1007/978-3-540-30201-8_36
    10 sg:pub.10.1007/978-3-540-45193-8_41
    11 sg:pub.10.1007/978-3-540-48085-3_14
    12 sg:pub.10.1007/bf01589110
    13 sg:pub.10.1007/s10601-006-9003-7
    14 sg:pub.10.1023/a:1020506526052
    15 https://app.dimensions.ai/details/publication/pub.1003225121
    16 https://doi.org/10.1016/s0305-0483(03)00059-8
    17 https://doi.org/10.1016/s0305-0483(98)00045-0
    18 https://doi.org/10.1016/s0377-2217(97)00030-1
    19 https://doi.org/10.1287/mnsc.30.10.1255
    20 https://doi.org/10.1287/mnsc.47.7.993.9800
    21 https://doi.org/10.1287/trsc.32.1.12
    22 schema:datePublished 2019-04
    23 schema:datePublishedReg 2019-04-01
    24 schema:description In a previous work we introduced a global StockingCost constraint to compute the total number of periods between the production periods and the due dates in a multi-order capacitated lot-sizing problem. Here we consider a more general case in which each order can have a different per period stocking cost and the goal is to minimise the total stocking cost. In addition the production capacity, limiting the number of orders produced in a given period, is allowed to vary over time. We propose an efficient filtering algorithm in O(n log n) where n is the number of orders to produce. On a variant of the capacitated lot-sizing problem, we demonstrate experimentally that our new filtering algorithm scales well and is competitive wrt the StockingCost constraint when the stocking cost is the same for all orders.
    25 schema:genre research_article
    26 schema:inLanguage en
    27 schema:isAccessibleForFree false
    28 schema:isPartOf Ne6578eff3e054cb78d6eb6bfcf799494
    29 Ne69e26adaf444627a9b8b8eb23851319
    30 sg:journal.1043977
    31 schema:name The item dependent stockingcost constraint
    32 schema:pagination 1-27
    33 schema:productId N248f82b2f3b64cff8552320c1d6a575e
    34 N5fbde956e635443fb7462f121d0c927a
    35 Nea8d63b7302f48eca20ba84038785d57
    36 schema:sameAs https://app.dimensions.ai/details/publication/pub.1112223142
    37 https://doi.org/10.1007/s10601-018-9300-y
    38 schema:sdDatePublished 2019-04-11T13:50
    39 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    40 schema:sdPublisher Ndaa4c82d4c7344e8a1e9b2bc9e0c3a1d
    41 schema:url https://link.springer.com/10.1007%2Fs10601-018-9300-y
    42 sgo:license sg:explorer/license/
    43 sgo:sdDataset articles
    44 rdf:type schema:ScholarlyArticle
    45 N01c68be7e9eb4cebbf4cbcf478797bc9 rdf:first N8abf127cb17e493699f85cb162c1c935
    46 rdf:rest rdf:nil
    47 N248f82b2f3b64cff8552320c1d6a575e schema:name doi
    48 schema:value 10.1007/s10601-018-9300-y
    49 rdf:type schema:PropertyValue
    50 N5fbde956e635443fb7462f121d0c927a schema:name dimensions_id
    51 schema:value pub.1112223142
    52 rdf:type schema:PropertyValue
    53 N7aea2635d98c4ccd8c958321d668498b rdf:first Nc0c22ea3c84d4897bb77c35f9feeeac2
    54 rdf:rest Ncc60a72fec8646ec9348779156947c18
    55 N849f80cd592c4d31b13bbd5fbb78cc02 schema:affiliation https://www.grid.ac/institutes/grid.7942.8
    56 schema:familyName Schaus
    57 schema:givenName Pierre
    58 rdf:type schema:Person
    59 N8abf127cb17e493699f85cb162c1c935 schema:affiliation https://www.grid.ac/institutes/grid.7942.8
    60 schema:familyName Wolsey
    61 schema:givenName Laurence
    62 rdf:type schema:Person
    63 Nc0c22ea3c84d4897bb77c35f9feeeac2 schema:affiliation https://www.grid.ac/institutes/grid.412037.3
    64 schema:familyName Houndji
    65 schema:givenName Vinasetan Ratheil
    66 rdf:type schema:Person
    67 Ncc60a72fec8646ec9348779156947c18 rdf:first N849f80cd592c4d31b13bbd5fbb78cc02
    68 rdf:rest N01c68be7e9eb4cebbf4cbcf478797bc9
    69 Ndaa4c82d4c7344e8a1e9b2bc9e0c3a1d schema:name Springer Nature - SN SciGraph project
    70 rdf:type schema:Organization
    71 Ne6578eff3e054cb78d6eb6bfcf799494 schema:volumeNumber 24
    72 rdf:type schema:PublicationVolume
    73 Ne69e26adaf444627a9b8b8eb23851319 schema:issueNumber 2
    74 rdf:type schema:PublicationIssue
    75 Nea8d63b7302f48eca20ba84038785d57 schema:name readcube_id
    76 schema:value 2d2be5c7a95078b01950e8e8a7e99fd131ed09e140c8154ad6be9b5e0946c020
    77 rdf:type schema:PropertyValue
    78 anzsrc-for:11 schema:inDefinedTermSet anzsrc-for:
    79 schema:name Medical and Health Sciences
    80 rdf:type schema:DefinedTerm
    81 anzsrc-for:1103 schema:inDefinedTermSet anzsrc-for:
    82 schema:name Clinical Sciences
    83 rdf:type schema:DefinedTerm
    84 sg:journal.1043977 schema:issn 1383-7133
    85 1572-9354
    86 schema:name Constraints
    87 rdf:type schema:Periodical
    88 sg:pub.10.1007/0-387-33477-7 schema:sameAs https://app.dimensions.ai/details/publication/pub.1003225121
    89 https://doi.org/10.1007/0-387-33477-7
    90 rdf:type schema:CreativeWork
    91 sg:pub.10.1007/3-540-49481-2_30 schema:sameAs https://app.dimensions.ai/details/publication/pub.1030539804
    92 https://doi.org/10.1007/3-540-49481-2_30
    93 rdf:type schema:CreativeWork
    94 sg:pub.10.1007/978-3-319-10428-7_29 schema:sameAs https://app.dimensions.ai/details/publication/pub.1014437114
    95 https://doi.org/10.1007/978-3-319-10428-7_29
    96 rdf:type schema:CreativeWork
    97 sg:pub.10.1007/978-3-319-18008-3_29 schema:sameAs https://app.dimensions.ai/details/publication/pub.1043190236
    98 https://doi.org/10.1007/978-3-319-18008-3_29
    99 rdf:type schema:CreativeWork
    100 sg:pub.10.1007/978-3-319-23219-5_10 schema:sameAs https://app.dimensions.ai/details/publication/pub.1016789935
    101 https://doi.org/10.1007/978-3-319-23219-5_10
    102 rdf:type schema:CreativeWork
    103 sg:pub.10.1007/978-3-540-30201-8_36 schema:sameAs https://app.dimensions.ai/details/publication/pub.1044615390
    104 https://doi.org/10.1007/978-3-540-30201-8_36
    105 rdf:type schema:CreativeWork
    106 sg:pub.10.1007/978-3-540-45193-8_41 schema:sameAs https://app.dimensions.ai/details/publication/pub.1024255352
    107 https://doi.org/10.1007/978-3-540-45193-8_41
    108 rdf:type schema:CreativeWork
    109 sg:pub.10.1007/978-3-540-48085-3_14 schema:sameAs https://app.dimensions.ai/details/publication/pub.1025585608
    110 https://doi.org/10.1007/978-3-540-48085-3_14
    111 rdf:type schema:CreativeWork
    112 sg:pub.10.1007/bf01589110 schema:sameAs https://app.dimensions.ai/details/publication/pub.1020417359
    113 https://doi.org/10.1007/bf01589110
    114 rdf:type schema:CreativeWork
    115 sg:pub.10.1007/s10601-006-9003-7 schema:sameAs https://app.dimensions.ai/details/publication/pub.1021730445
    116 https://doi.org/10.1007/s10601-006-9003-7
    117 rdf:type schema:CreativeWork
    118 sg:pub.10.1023/a:1020506526052 schema:sameAs https://app.dimensions.ai/details/publication/pub.1039833510
    119 https://doi.org/10.1023/a:1020506526052
    120 rdf:type schema:CreativeWork
    121 https://app.dimensions.ai/details/publication/pub.1003225121 schema:CreativeWork
    122 https://doi.org/10.1016/s0305-0483(03)00059-8 schema:sameAs https://app.dimensions.ai/details/publication/pub.1013927686
    123 rdf:type schema:CreativeWork
    124 https://doi.org/10.1016/s0305-0483(98)00045-0 schema:sameAs https://app.dimensions.ai/details/publication/pub.1019769997
    125 rdf:type schema:CreativeWork
    126 https://doi.org/10.1016/s0377-2217(97)00030-1 schema:sameAs https://app.dimensions.ai/details/publication/pub.1008623147
    127 rdf:type schema:CreativeWork
    128 https://doi.org/10.1287/mnsc.30.10.1255 schema:sameAs https://app.dimensions.ai/details/publication/pub.1064719826
    129 rdf:type schema:CreativeWork
    130 https://doi.org/10.1287/mnsc.47.7.993.9800 schema:sameAs https://app.dimensions.ai/details/publication/pub.1064722147
    131 rdf:type schema:CreativeWork
    132 https://doi.org/10.1287/trsc.32.1.12 schema:sameAs https://app.dimensions.ai/details/publication/pub.1064735452
    133 rdf:type schema:CreativeWork
    134 https://www.grid.ac/institutes/grid.412037.3 schema:alternateName Université d'Abomey-Calavi
    135 schema:name Institut de Formation et de Recherche en Informatique (IFRI), Université d’Abomey-Calavi (UAC), Abomey-Calavi, Benin
    136 rdf:type schema:Organization
    137 https://www.grid.ac/institutes/grid.7942.8 schema:alternateName Université Catholique de Louvain
    138 schema:name Institute for Multidisciplinary Research in Quantitative Modelling and Analysis (IMMAQ), Université catholique de Louvain (UCL), Louvain la Neuve, Belgium
    139 Institute of Information and Communication Technologies, Electronics and Applied Mathematics (ICTEAM), Université catholique de Louvain (UCL), Louvain la Neuve, Belgium
    140 rdf:type schema:Organization
     




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


    ...