Suchergebnisse - "implicit-enumeration algorithm"

  • Treffer 1 - 9 von 9
Treffer weiter einschränken
  1. 1

    Polynomial-time algorithms to solve the single-item capacitated lot sizing problem with a 1-breakpoint all-units quantity discount von Malekian, Yaser, Mirmohammadi, S. Hamid, Bijari, Mehdi

    ISSN: 0305-0548, 1873-765X, 0305-0548
    Veröffentlicht: New York Elsevier Ltd 01.10.2021
    Veröffentlicht in Computers & operations research (01.10.2021)
    “… •We investigated a single item capacitated lot sizing problem with quantity discount.•We defined the concept of irregular orders in the optimal solution of the …”
    Volltext
    Journal Article
  2. 2

    Travel itinerary problem von Li, Xiang, Zhou, Jiandong, Zhao, Xiande

    ISSN: 0191-2615, 1879-2367
    Veröffentlicht: Elsevier Ltd 01.09.2016
    Veröffentlicht in Transportation research. Part B: methodological (01.09.2016)
    “… •An itinerary optimization problem is proposed to search itineraries with the lowest cost.•It is decomposed into a tour selection process and a number …”
    Volltext
    Journal Article
  3. 3

    An integral constrained generalized hub-and-spoke network design problem von Lin, Cheng-Chang, Chen, Sheu-Hua

    ISSN: 1366-5545, 1878-5794
    Veröffentlicht: Exeter Elsevier India Pvt Ltd 01.11.2008
    “… The hub-and-spoke network design problem determines the smallest fleet size with their routes and freight paths to minimize operating costs. We proposed a …”
    Volltext
    Journal Article
  4. 4

    Optimal Unit Commitment with Smart Metering Sensors on Short-term Ramp Rate for an Independent Power Grid von Lu, Shiue-Der, Wang, Meng-Hui

    ISSN: 0914-4935
    Veröffentlicht: Tokyo MYU Scientific Publishing Division 2018
    Veröffentlicht in Sensors and materials (2018)
    “… In this study, we considered the flexible dispatch of thermoelectric and hydroelectric units in a smart power grid that includes a considerable amount of wind …”
    Volltext
    Journal Article
  5. 5

    The hierarchical network design problem for time-definite express common carriers von Lin, Cheng-Chang, Chen, Sheu-Hua

    ISSN: 0191-2615, 1879-2367
    Veröffentlicht: Kidlington Elsevier Ltd 01.03.2004
    Veröffentlicht in Transportation research. Part B: methodological (01.03.2004)
    “… Time-definite express common carriers provide time guaranteed door-to-door express service for small parcel shipments. Centers pick up and deliver parcels, …”
    Volltext
    Journal Article
  6. 6

    The freight routing problem of time-definite freight delivery common carriers von Lin, Cheng-Chang

    ISSN: 0191-2615, 1879-2367
    Veröffentlicht: Kidlington Elsevier Ltd 01.07.2001
    Veröffentlicht in Transportation research. Part B: methodological (01.07.2001)
    “… The freight routing problem of time-definite common carriers is to minimize the sum of handling and transportation costs, while meeting service commitments and …”
    Volltext
    Journal Article
  7. 7

    Cluster label aligning algorithm based on programming model von Fan Haixiong, Liu Fuxian, Xia Lu

    ISBN: 9781457720734, 1457720736
    ISSN: 1948-9439
    Veröffentlicht: IEEE 01.05.2012
    “… Cluster ensembles can improve single clusters performance effectively, but the cluster labels are not fused directly due to lack of prior information …”
    Volltext
    Tagungsbericht
  8. 8
  9. 9

    Selection of variables in linear regression: a pragmatic approach von Narula, Subhash C., Wellington, John F.

    ISSN: 0094-9655, 1563-5163
    Veröffentlicht: Abingdon Gordon and Breach Science Publishers 01.01.1983
    Veröffentlicht in Journal of statistical computation and simulation (01.01.1983)
    “… To find the best regression model of p predictor variablesp= l,...k, where k is the number of potential predictor variables, is an important problem. In this …”
    Volltext
    Journal Article