<link rel="stylesheet" href="styles.cf390c6bfbe7555f.css">

學術出版;;Publications

Permanent URI for this communityhdl:11536/1

收集所有交通大學研究人員與學生個人或團體所發表之各項學術著作，涵蓋期刊論文、教師專書、學位論文等項。;;Collections of Publications of NCTU Researchers and Students Like Journal Papers and Thesis.

Browse

Filters

1998 - 199912000 - 20022

Settings

🏛️國立陽明交通大學機構典藏

Author: search.filters.author.Li, HLSubject: search.filters.subject.assortment

Search Results

Now showing 1 - 3 of 3
  • Thumbnail Image
    Item type:Item,
    An approximately global optimization method for assortment problems
    (1998-03-16)
    Li, HL
    ;
    Chang, CT
    ;
    資訊管理與財務金融系 註：原資管所+財金所
    ;
    Department of Information Management and Finance
    Assortment problems occur when we want to cut a number of small rectangular pieces from a large rectangle to get the minimum area within the rectangle. Recently, Chen et al. proposed a useful model for assortment problems. Although Chen et al.'s model is quite promising to find solutions, there are two inadequacies in their model: firstly, the objective function in their model is a polynomial term, which may not lead to a globally optimal solution; secondly, too many 0-1 variables are used to formulate the non-overlapping constraints. We propose a new method to reformulate an assortment model. Our model is not only able to find the approximately global optimal solution, but involves less 0-1 variables for formulating non-overlapping constraints. (C) 1998 Elsvier Science B.V.
  • Thumbnail Image
    Item type:Item,
    A fast algorithm for assortment optimization problems
    (2001-10-01)
    Li, HL
    ;
    Tsai, JF
    ;
    資訊管理與財務金融系 註：原資管所+財金所
    ;
    Department of Information Management and Finance
    Assortment optimization problems intend to seek the best way of placing a given set of rectangles within a minimum-area rectangle. Such problems are often formulated as a quadratic mixed 0-1 program. Many current methods for assortment problems are either unable to find an optimal solution or being computationally inefficient for reaching an optimal solution. This paper proposes a new method which finds the optimum of assortment problem by solving few linear mixed 0-1 programs. Numerical examples show that the proposed method is more computationally efficient than current methods.
  • Thumbnail Image
    Item type:Item,
    Approximately global optimization for assortment problems using piecewise linearization techniques
    (2002-08-01)
    Li, HL
    ;
    Chang, CT
    ;
    Tsai, JF
    ;
    資訊管理與財務金融系 註：原資管所+財金所
    ;
    Department of Information Management and Finance
    Recently, Li and Chang proposed an approximate model for assortment problems. Although their model is quite promising to find approximately global solution, too many 0-1 variables are required in their solution process. This paper proposes another way for solving the same problem. The proposed method uses iteratively a technique of piecewise linearization of the quadratic objective function. Numerical examples demonstrate that the proposed method is computationally more efficient than the Li and Chang method. (C) 2002 Elsevier Science B.V. All rights reserved.