2011 Vol.15

    Please wait a minute...
    For Selected: Toggle Thumbnails
    An Integral Optimality Condition for Global Optimization
    ZHANG Li-Li, LI Jian-Yu, LI Xing-Si
    Operations Research Transactions    2011, 15 (1): 1-10.  
    Abstract3152)      PDF(pc) (206KB)(1647)       Save
    An integral optimality condition for global optimization problem is investigated by using a level set auxiliary function. The auxiliary function has one variant that represents an estimated optimal value of the objective function in primal optimization problem and one controlling parameter for accuracy. Necessary and sufficient condition for global optimality in terms of the behavior of the auxiliary function is derived. The integral global optimality condition is obtained via a limiting process of this auxiliary function. Furthermore, if the measure is the Lebesgue measure and the integral region takes a finite subset of the Natural Number set, then this integral global optimality condition divergences to the approximation scheme that used aggregate function to approximate the max-function in the finite minimax problem. So the integral global optimality condition is an extension of this approximation scheme in continuous maximum problem.
    Related Articles | Metrics | Comments0
    Optimization of Truss Vibration with Reduction  of Symmetric Semidefinite Programming
    ZHOU Yi-Kai, BAI Yan-Qin, SUN Yan
    Operations Research Transactions    2011, 15 (1): 11-24.  
    Abstract3290)      PDF(pc) (286KB)(1662)       Save
    A truss vibration optimization problem is to minimize the total weight of truss subject to a given fundamental vibration frequency. This paper focuses on the recent results of matrix algebraic approach to solve the truss vibration optimization problem expressed in terms of symmetric semidefinite programming problem. We derive two sufficient conditions on constructing the symmetric group representation to reduce the problems size. An example of eight-bar truss design problem is given to illustrate how to construct a group representation and to demonstrate its effectiveness.
    Related Articles | Metrics | Comments0
    A New Class of Penalty Functions and Penalty Algorithm
    ZHANG Yu-Huan, WANG Chang-Yu
    Operations Research Transactions    2011, 15 (1): 25-34.  
    Abstract2938)      PDF(pc) (170KB)(1387)       Save
    In this paper, we propose a new class of penalty functions for solving nonlinear programming problems with inequality constraints, a subclass of which smoothly approximates the $l_1$ penalty function. Based on the new class of penalty functions, we consider a penalty algorithm, the characteristic of which is at each iteration, an exact global optimal solution or an inexact global optimal solution is obtained. Under very weak conditions, the algorithm is always applicable. We present the global convergence without any constraint qualification. Finally, numerical experiments are given.
    Related Articles | Metrics | Comments0
    A Generalization for Directed Scale-Free Graphs
    YAN Yun-Zhi, WANG Han-Xing
    Operations Research Transactions    2011, 15 (1): 35-45.  
    Abstract2402)      PDF(pc) (178KB)(1331)       Save
    We study a dynamically evolving directed random graph which randomly adds vertices and directed edges using preferential attachment and prove that its vertice degree obey power law and has elaborate power law exponents.
    Related Articles | Metrics | Comments0
    A New Filter Method
    PU Ding-Guo, SHAO Wen-Qiong, LIU Mei-Ling, LIU Ci-Wen
    Operations Research Transactions    2011, 15 (1): 46-58.  
    Abstract2801)      PDF(pc) (198KB)(1512)       Save
    In this paper, we define a new filter  and propose a filter QP-free infeasible method with some piecewise linear relational NCP function   for constrained nonlinear optimization  problems. This iterative method is  based on the solution of nonsmooth equations which  are obtained by the multipliers and the NCP function for the KKT first-order optimality conditions.  Locally, each iteration of this method can be viewed as a perturbation of a mixed Newton-quasi Newton iteration on both the primal and dual variables for the solution of the KKT optimality conditions. We also use the filter on line searches.  This method is  implementable and globally convergent. We also prove that the method has superlinear convergence rate under some mild conditions.
    Related Articles | Metrics | Comments0
    Block-Iterative Subgradient Projection Algorithms  for the Convex Feasibility problem
    DANG Ya-Zheng, GAO Yan, ZHI Li-Ping
    Operations Research Transactions    2011, 15 (1): 59-70.  
    Abstract3137)      PDF(pc) (181KB)(1517)       Save
    In this paper,   sequential block-iterative subgradient projection algorithm and parallel block-iterative subgradient projection algorithm for solving the convex feasibility problem expressed by  the system of inequalities are presented. Each step in these methods consists of finding the approximation projection of the current point on the subsystem which is constructed  through  parting  the system of inequalities into several blocks.  The convergence for both of sequential block-iterative subgradient projection algorithm and parallel block-iterative subgradient projection algorithm are obtained under some weak conditions.
    Related Articles | Metrics | Comments0
    New SDP Relaxations  for Unconstrained  0-1 Polynomial Problems 
    JI Shu-Hui
    Operations Research Transactions    2011, 15 (1): 71-84.  
    Abstract3087)      PDF(pc) (188KB)(1493)       Save
    In this paper, we present new semidefinite programming (SDP) relaxation schemes for 0-1 unconstrained polynomial programming (0-1UPP) problems. We first construct an SDP relaxation based on matrix cone decomposition and (piecewise) linear approximation for (0-1UPP).  It is shown that this SDP bound is tighter than the standard linear form (SLF). We then use Lagrangian dual and sum of squares (SOS) relaxation to obtain SDP relaxations which are equivalent to Lasserre's SDP relaxations for (0-1UPP). This provides a new way to derive Lasserre's hierarchy of SDP relaxations for (0-1UPP).
    Related Articles | Metrics | Comments0
    Global Convergence of HZ's Conjugate Gradient  Method with Armijo-type Line Search
    WEI Jing-Guang, ZHANG Jian-Jun
    Operations Research Transactions    2011, 15 (1): 85-94.  
    Abstract3074)      PDF(pc) (164KB)(1364)       Save
    HZ's  conjugate gradient method (proposed by William W. Hager and Hongchao  Zhang)  has been proved to be an efficient method. In this paper, we prove the global convergence of  HZ's method with Armijo-type line search.  Our numerical experiments show that the new algorithm are more efficient and competitive with HZ's method with Wolfe line search in most cases.
    Related Articles | Metrics | Comments0
    Second Order Sufficient Conditions for Mathematical Programs Governed by Second-Order   Cone Constrained  Generalized Equations 
    WU Jia, ZHANG Li-Wei
    Operations Research Transactions    2011, 15 (1): 95-103.  
    Abstract2633)      PDF(pc) (173KB)(1421)       Save
     In this paper, we consider a class of mathematical programs governed by second-order cone constrained generalized equations. We define the critical cone  in terms of the directional derivative of a nonsmooth  mapping and derive its equivalent characterization at a feasible point.  With the help of the critical cone,  we propose a set of second order sufficient conditions for the mathematical program governed by second-order cone constrained generalized equations. We demonstrate, under some conditions, that the set of second order sufficient conditions is sufficient for the second order growth of an M-stationary point.
    Related Articles | Metrics | Comments0
    The Global Optimum Conditions of a New Class   of Level-value Estimation Methods
    LI Feng, LOU Ye
    Operations Research Transactions    2011, 15 (1): 104-112.  
    Abstract2431)      PDF(pc) (329KB)(1123)       Save
     In this paper, we propose global optimum conditions of a new class of level-value estimate methods for global optimization. Through researching into the equivalence between the root of variance or the $\nu$-variance function and the optimal value of the original problem, we get the corresponding optimum conditions.
    Related Articles | Metrics | Comments0
    Global  Convergence Results of BFGS Methods with New Nonmonotone Step Size Rule (Chinese)
    GUO Yuan-Bao, HUANG Bing-Jia
    Operations Research Transactions    2011, 15 (1): 113-121.  
    Abstract2702)      PDF(pc) (279KB)(1356)       Save
    We propose a new nonmonotone step size rule and analyze the global convergence of new BFGS quasi-Newton method. The new step size rule is similar to Zhang H.C. nonmonotone step size rule and contains it as a special case. Numerical experiments have been conducted which show that the proposed algorithm is encouraging.  
    Related Articles | Metrics | Comments0
     Constructing Integral Spectra Graphs by the  Super Generalized Line Graph Methods
    ZHANG Hong-Rui, WANG Li-Gong
    Operations Research Transactions    2011, 15 (1): 122-128.  
    Abstract2509)      PDF(pc) (269KB)(1197)       Save
     Line graph plays an important role in spectral graph theory. In this article, we gain a new method by reaching on the sufficient conditions under which the super generlized line graph is the integral graph. And using this method we can construct infinite new integral graphs.
    Related Articles | Metrics | Comments0
    Duality for Minmax Fractional Problems Involving Generalized Arcwise Connected Type I
    JIA Ji-Hong, LI Ze-Min
    Operations Research Transactions    2011, 15 (2): 1-10.  
    Abstract2390)      PDF(pc) (153KB)(1163)       Save
    This paper deals with  a minmax fractional problems in terms of the right derivative of the function with respect to an arc.  Under arcwise connected type I and
    generalized arcwise connected type I assumptions, a dual model is proposed for the minmax fractional problems. Furthermore, weak duality theorem, strong duality theorem and strict converse duality theorem are established.
    Related Articles | Metrics | Comments0
    Criteria for Generalized \alpha \eta -Monotonicities
    TANG Wan-Mei, Rong-Wei-Dong
    Operations Research Transactions    2011, 15 (2): 11-18.  
    Abstract2628)      PDF(pc) (141KB)(1197)       Save
    If  $\alpha ~{\rm and}~\eta $ are  affine in the first argument and skew instead of Condition C, the following results are obtained: (i) if the gradient of a function is (strictly) $\alpha \eta $-pseudomonotone,  the function is (strictly) pseudo $\alpha \eta $-invex;  (ii) if the gradient of a function is quasi $\alpha \eta $-monotone,  the  function is quasi $\alpha \eta $-invex.
    Related Articles | Metrics | Comments0
    Some New Families of Integral Trees of Diameter Four
    WANG Li-Gong, Zhang-Zheng
    Operations Research Transactions    2011, 15 (2): 19-27.  
    Abstract2127)      PDF(pc) (152KB)(1206)       Save
    An integral graph is a graph of which all the eigenvalues of its adjacency matrix are integers. This paper investigates itegral trees of diameter 4. Many new classes of such integral trees are cnstructed ifinitely by solving some certain Diophantine equations. These results generalize some results of Wang, Li
    and Zhang (see Families of integral trees with diameters 4, 6 and 8, Discrete Applied Mathematics, 2004, 136: 349-362).
    Related Articles | Metrics | Comments0
    A Norm-Relaxed Algorithm with Identification Function for General Constrained Optimization
    JIAN Jin-Bao, WEI Xiao-Peng, ZENG Han-Jun, PAN Hua-Qin
    Operations Research Transactions    2011, 15 (2): 28-44.  
    Abstract2600)      PDF(pc) (254KB)(1189)       Save
    In this paper, based on a semi-penalty function and an identification function used to yield a  ``working set'', as well as the norm-relaxed SQP idea, a new
    algorithm for solving a kind of optimization problems with nonlinear equality and inequality constraints is proposed. At each iteration, to yield the search directions the algorithm solves only one reduced quadratic program (QP) subproblem and a reduced system of linear equations. The proposed algorithm possesses global convergence and superlinear convergence under some mild assumptions without the strictly complementarity. Finally, some elementary numerical experiments are reported.
    Related Articles | Metrics | Comments0
    Cited: Baidu(21)
    Saddle-Point Equilibrium of Quadratic Differential Game for Singular Bilinear Systems
    ZHU Huai-Nian, ZHANG Cheng-Ke, BIN Ning
    Operations Research Transactions    2011, 15 (2): 45-52.  
    Abstract2566)      PDF(pc) (232KB)(1279)       Save
     This paper investigates  the saddle-point equilibrium of quadratic differential game for singular bilinear systems in the finite time. As it is complex to solve the problem, a reduced-order transformation is introduced in order to obtain the fast and slow subsystems, then, the optimal control is obtained by using the maximum principle. In the end, the simulation of a numerical example is presented to illustrate the correctness and effectiveness of the proposed algorithm.
    Related Articles | Metrics | Comments0
     A Newton Method for  a  Nonsmooth Nonlinear Complementarity Problem
    GAO Yan
    Operations Research Transactions    2011, 15 (2): 53-58.  
    Abstract2461)      PDF(pc) (105KB)(1330)       Save
    This paper is devoted to a nonlinear complementarity problem with nonsmooth data. The  nonlinear complementarity problem is reformulated as a system of nonsmooth equations. Then, a Newton method for solving the nonsmooth equations is proposed. In each iteration of the Newton method, an element of the B-differential of related functions, not nonlinear complementarity function, is required. The superlinear convergence is shown.
    Related Articles | Metrics | Comments0
    Two Models of Single Machine Scheduling with General Processing Time Functions
    WANG Cheng-Fei, ZHANG Yu-Zhong, MIAO Cui-Xia
    Operations Research Transactions    2011, 15 (2): 59-67.  
    Abstract2603)      PDF(pc) (152KB)(1290)       Save
    Two models of single machine scheduling  with general processing time functions are considered.  Job's processing time is assumed to be the sum of  basic processing time and a function of starting time or  a function of position.  For processing over starting time model, the makespan minimization problem and total completion time minimization problem are polynomially solvable under certain conditions, which have more generality compared with previous articles. For processing  over position  model, there are optimal schedules for makespan minimization problem and total completion time minimization problem.   A property of optimal schedule and a greedy algorithm for total weighted completion time minimization problem are presented.
    Related Articles | Metrics | Comments0
    Cited: Baidu(2)
    Branch-and-Bound  Method for Reverse Convex Programming
    Buheerdun, CHEN Guo-Qing, LIU Ju-Hong
    Operations Research Transactions    2011, 15 (2): 68-76.  
    Abstract2491)      PDF(pc) (340KB)(1099)       Save
    This paper considers a convex programming with an additional reverse convex constraint. A kind of conical branch and bound method is developed and onvergence conditions are obtained.
    Related Articles | Metrics | Comments0
    Fritz-John Condition for a Class   of Nondifferntiable Optimization
    PAN Shao-Rong, ZHANG Li-Wei
    Operations Research Transactions    2011, 15 (2): 77-84.  
    Abstract2350)      PDF(pc) (289KB)(1198)       Save
    Based on the properties of the space of star-shaped sets, a class of star-shaped differentiable functions,whose directional derivatives are representable as a difference of two nonnegative positively homogeneous continuous functions, is defined. The necessary optimality condition of Fritz-John type for an 
    optimization problem with star-shaped differentiable inequality constraints is given.
    Related Articles | Metrics | Comments0
    A Nonmonotone Feasible SQP Method for Nonlinear Complementarity Problem
    WANG Hua
    Operations Research Transactions    2011, 15 (2): 85-94.  
    Abstract2530)      PDF(pc) (336KB)(1108)       Save
    The nonlinear complementarity problem can be reformulated as a nonlinear programming. This paper proposes a feasible SQP method with nonmonotone line search, and obtains a feasible descent direction by  full use of the K-T point pair of a QP subproblem without other additional cost. A high-order direction is computed to overcome the Maratos effect. Instead of filter method,   a nonmonotone line search is used to obtain the step length. Under some suitable conditions, not including the strict complementary condition,  the global convergence of the algorithm is obtained. Some numerical results are also reported in this paper.
    Related Articles | Metrics | Comments0
    Cited: Baidu(1)
    An Inexact Smoothing Algorithm for Linear Second-Order Cone Complementarity Problems
    ZHANG Jie, XU Cheng-Xian, RUI Shao-Ping
    Operations Research Transactions    2011, 15 (2): 95-102.  
    Abstract2463)      PDF(pc) (304KB)(1212)       Save
    An inexact smoothing algorithm for second-order cone complementarity problems is proposed under the framework of smoothing methods. It is proved that the proposed algorithm has global convergence property. Numerical experiments demonstrate that the algorithm is effective for large-scale problems.
    Related Articles | Metrics | Comments0
    Cited: Baidu(1)
    Higher-Order Characterizations for Set-Valued Optimization on Strictly Maximal Efficient Solutions
    YANG Yang, XU Yi-Hong, XIONG Wei-Zhi
    Operations Research Transactions    2011, 15 (2): 103-109.  
    Abstract2121)      PDF(pc) (271KB)(1002)       Save
    The strict efficiency of set-valued optimization is considered in real normed spaces. By applying the properties of higher-order derivatives, higher-order type necessary optimality condition is established for a set-valued optimization problem whose constraint condition is determined by a fixed set to attain its strictly maximal efficient solution. When objective function is concave, with the properties of strictly maximal efficient point, sufficient optimality condition is also derived.
    Related Articles | Metrics | Comments0
    Cited: Baidu(1)
    Analysis for Stationary Queue Length of the M/T-SPH/1 Queue
    ZHANG Hong-Bo, FENG Ping-Hua
    Operations Research Transactions    2011, 15 (2): 110-118.  
    Abstract2274)      PDF(pc) (287KB)(1255)       Save
    The M/T-SPH/1 queueing model is studied, and the probability generating function for the stationary queue length of the model is given based on the quasi-birth-and-death process and operator-geometric method. Furthermore,  distribution of queue length is not a PH distribution, while the tail of the distribution has the characteristic of geometric decay under certain conditions.
    Related Articles | Metrics | Comments0
    Cited: Baidu(1)
    Identification for A Non-Smooth Distributed Parameter System and Its Optimality Conditions
    BAI Yi-La, LV Wei
    Operations Research Transactions    2011, 15 (2): 119-126.  
    Abstract2009)      PDF(pc) (389KB)(1088)       Save
    The parameter identification problem of the temperature field of the transformer is a piecewise smooth identification problem. Taking the flow velocity as the identification parameter,  consider a parameter identification problem of temperature field of the transformer, prove the existence of the optimal parameter and the necessary optimality conditions, and present a theoretical basis for the numerical simulation of temperature field of transformers.
    Related Articles | Metrics | Comments0
    Cited: Baidu(5)
    Efficiency for a Class of Multiobjective Optimization Problems
    ZHAO Ke-Quan, Yang Xin-Min
    Operations Research Transactions    2011, 15 (3): 1-8.  
    Abstract3061)      PDF(pc) (152KB)(1825)       Save
    In this paper, a class of multiobjective optimization problems in which involved inequality constraints is considered. Some necessary and sufficient conditions are established for an efficient solution. Moreover, the equivalence is established between efficiency and properly efficiency by linear scalarization method under some suitable conditions. Our results improves naturally and extends some previously known results.
    Related Articles | Metrics | Comments0
    Cited: Baidu(10)
    A class of limited memory BFGS-type algorithms for large-scale unconstrainedoptimization
    QIAN Xiao-Yan, SHI Qing-Sheng, LIU Hao, SHI Kui-Ran
    Operations Research Transactions    2011, 15 (3): 9-18.  
    Abstract4620)      PDF(pc) (187KB)(1735)       Save
    In this paper, objective function value information is exploited in limited memory BFGS-type algorithms. we first construct a new quadratic function satisfying some interpolation conditions to approximate the objective function, get a new weak secant equation. Combining the new weak secant equation and that obtained by Yuan\cite{yuan1991}, a class of limited memory BFGS--type algorithms including the classic LBFGS algorithm based on a new weak secant equation are proposed. The convergence of this class limited memory BFGS-type algorithms is proved. Numerical results for standard test problems from CUTE are reported, which indicate that all the algorithms in the proposed class perform quiet well.
    Related Articles | Metrics | Comments0
    The Q-spectral radii of connected graphs with given number of vertices and edges
    CHEN Lin- Huang-Qiong-Xiang
    Operations Research Transactions    2011, 15 (3): 19-28.  
    Abstract2335)      PDF(pc) (235KB)(1273)       Save
    The signless Laplacian matrix of a graph is defined to be the sum of its adjacency matrix and degree diagonal matrix, and its eigenvalues are denoted by $q_1\geq q_2\geq,\cdots ,\geq q_n$. Let $\mathscr{C}(n,m)$ be a set of connected graphs in which every graph has $n$ vertices and $m$ edges, where $1\leq n-1\leq\ m \leq\bigl(\begin{smallmatrix}n\\2\end{smallmatrix}\bigr)$. A graph $G^\star \in \mathscr{C}(n,m)$ is called maximum if $\ q_1(G^\star )\geq q_1(G)$ for any $G\in \mathscr{C}(n,m)$. In this paper, we proved that for any given positive integer $a=m-n+1$, $n-\frac{1}{2}+a+\frac{1}{2}\sqrt{1+12a+12a^2}$, which leads to $q_1(G)-\frac{1}{2}+a+\frac{1}{2}\sqrt{1+12a+12a^2}$.
    Related Articles | Metrics | Comments0
     List (d,1)-Total Labelling of Graphs Embedded in Surfaces
    YU Yong, ZHANG Xin, LIU Gui-Zhen
    Operations Research Transactions    2011, 15 (3): 29-37.  
    Abstract2398)      PDF(pc) (154KB)(1204)       Save
    The ($d$,1)-total labelling of graphs was introduced by Havet and
    Yu. In this paper, we consider the list version of ($d$,1)-total
    labelling of graphs. Let $G$ be a graph embedded in a surface with
    Euler characteristic $\varepsilon$ whose maximum degree $\Delta(G)$
    is sufficiently large. We prove that the list ($d$,1)-total labelling number
    $Ch_{d,1}^{\rm T}(G)$ of $G$ is at most $\Delta(G)+2d$.
    Related Articles | Metrics | Comments0
    On the Linear Arboricity of 1-Planar Graphs
    ZHANG Xin, LIU Gui-Zhen, WU Jian-Liang
    Operations Research Transactions    2011, 15 (3): 38-44.  
    Abstract2501)      PDF(pc) (132KB)(1357)       Save
    It is proved that the linear arboricity of every 1-planar graph with maximum
    degree $\Delta\geq 33$ is $\lceil\Delta/2\rceil$.
    Related Articles | Metrics | Comments0
    On the Spectral Radii of m-Starlike Tree
    WU Ting-Zeng, HU Sheng-Biao
    Operations Research Transactions    2011, 15 (3): 45-50.  
    Abstract2732)      PDF(pc) (156KB)(1276)       Save
    A tree is said to be starlike if exactly one of
    its vertices has degree larger than 2.  A
     m-starlike tree is obtained by appending a starlike tree to every
    one  terminus of  a starlike tree $S_{0}=S(m_{01}, m_{02}, ...
    ,m_{0\Delta_{0}})$. Gutman and L. Shi give a
     bound of the spectral radii  of starlike tree. In this
    paper, we give an another  short proof and further discussions about
    this result. Sometime, we give a new upper bound of the spectral
    radii of m-starlike tree.
    Related Articles | Metrics | Comments0
    Cited: Baidu(4)
    Properly Colored Paths and Cycles in Complete Graphs
    WANG Guang-Hui, ZHOU Shan
    Operations Research Transactions    2011, 15 (3): 51-56.  
    Abstract2279)      PDF(pc) (151KB)(1238)       Save
    Let $K_{n}^{c}$ denote a complete graph on $n$ vertices whose edges are
    colored in an arbitrary way. Let $\Delta^{mon}
    (K_{n}^{c})$ denote the maximum number of edges of the same color incident with a vertex of $K^c_{n}$. A properly colored cycle (path) in $K_{n}^{c}$ is a
    cycle (path) in which adjacent edges have distinct colors. B. Bollob\'{a}s and P. Erd\"{o}s (1976) proposed the following conjecture: If $\Delta^{{mon}}
    (K_{n}^{c})<\lfloor \frac{n}{2} \rfloor$, then $K_{n}^{c}$ contains a properly colored
    Hamiltonian cycle. This conjecture is still open. In this paper, we study properly colored paths and cycles under the condition mentioned in the above conjecture.  
    Related Articles | Metrics | Comments0
    The Number of Arcs of Strongly Connected Oriented Graphs with Two Noncritical Vertices
    LIN Shang-Wei, LI Chun-Fang, WANG Shi-Ying
    Operations Research Transactions    2011, 15 (3): 57-61.  
    Abstract2041)      PDF(pc) (149KB)(1114)       Save
    It is proved that a strongly
     connected oriented graph $D$ with $n\geq 4$ vertices and  at least ${n-1 \choose 2}+3$
     arcs has two distinct vertices $u^*, v^*$ such that both $D-u^*$ and $D-v^*$ are strongly connected. The examples
    show that the above lower bound on the number of arcs is sharp.
    Related Articles | Metrics | Comments0
    Two-Machine Flow Shop Problems with Availability Constraints
    YANG Ming, LU Xi-Wen
    Operations Research Transactions    2011, 15 (3): 62-69.  
    Abstract3160)      PDF(pc) (298KB)(1473)       Save
    We investigate the problems for two-machine flow shop scheduling with availability constraints. A resumable scenario is assumed, i.e., if a job cannot be finished before the interval it is continued after the machine becomes available again. The objective is to minimize the makespan. We first consider an approximate case of the problem with several availability constraints on both machines, present an algorithm with performance ratio of 3/2. Then we give an algorithm with competitive ratio of 3/2 for the semi-online problem with an availability constraint on the second machine.
    Related Articles | Metrics | Comments0
    Cited: Baidu(1)
    Statistical Learning Element of Support Vector Ordinal Regression Machine
    YANG Hong-Ying, YANG Zhi-Xia
    Operations Research Transactions    2011, 15 (3): 70-80.  
    Abstract2163)      PDF(pc) (343KB)(1316)       Save
    For support vector ordinal regression machine, its statistical learning element is studied in this paper.
    Using structural risk minimization principle, we reduce one of
    ordinal regression machine, which is called structural risk
    minimization ordinal regression machine. Furthermore, the relation
    of solution between structural risk minimization ordinal regression
    machine and support vector ordinal regression machine is proved.
    From the statistical point of view, support vector ordinal
    regression machine is a direct implementation of structural risk
    minimization principle.
    Related Articles | Metrics | Comments0
    Cited: Baidu(3)
    Supply Chain Scheduling with Multiple Transportation Modes
    WANG Lei, WANG Guo-Qing, YI Yu-Yin
    Operations Research Transactions    2011, 15 (3): 81-94.  
    Abstract2786)      PDF(pc) (396KB)(1464)       Save
    We consider a make-to-order production-distribution system with one manufacturer and multiple customers. A set of orders with deadlines needs to be processed by the manufacturer and delivered to the customers upon completion. The manufacturer adopts a commit-to-delivery business mode. The problem is to find a joint schedule of order processing at the manufacturer and order delivery from the manufacturer to the customers that minimize the total distribution cost with deadline constraint. We study the solvability of multiple cases of the problem by providing efficient algorithms.
    Related Articles | Metrics | Comments0
    Cited: Baidu(2)
    The crossing Number of Petersen graph P(4,1) with paths Pn
    YUAN Zi-Han- Huang-Yuan-Qiu
    Operations Research Transactions    2011, 15 (3): 95-106.  
    Abstract2559)      PDF(pc) (517KB)(1257)       Save
    The crossing Number of Petersen graph $P(m,1)$ with paths $P_n$ is NP-complete problem, Y.H. Peng and Y.C.Yiew have determined the crossing Number of $P(3,1)$ with paths $P_n$ is $4n$, we have proved the crossing Number of $P(4,1)$ with paths $P_n$ is $8n$.
    Related Articles | Metrics | Comments0
    Online Batch Scheduling with Linear Deterioration Effect
    WANG Cheng-Fei, ZHANG Yu-Zhong, MIAO Cui-Xia, BAI Qing-Guo
    Operations Research Transactions    2011, 15 (3): 107-114.  
    Abstract2660)      PDF(pc) (268KB)(1157)       Save
    An online batch scheduling with linear deterioration effect on single machine is considered. Jobs arrive over time. A batch processing machine can handle up to $B$ jobs simultaneously. The actual processing time $p_j$ of Job $J_j$ is assumed to be a linear function of its starting time $t$, i.e., $p_j=b_j+\alpha t$, where $\alpha >0$ is the deterioration ratio, $b_j$ is the basic processing time, which is unknown until it arrives. The processing time of a batch is given by the longest processing time of any job in the batch. For single machine with unbounded capacity to minimize makespan problem, we give an optimal online algorithm, which competitive ratio matches the lower bound of the problem.
    Related Articles | Metrics | Comments0
    A vector graph model for interconnection networks
    SHI Hai-Zhong, NIU Pan-Feng, MA Ji-Yong, HOU Fei-Fei
    Operations Research Transactions    2011, 15 (3): 115-123.  
    Abstract3234)      PDF(pc) (345KB)(1326)       Save
    the n-cube, the ring network, the k-ary-n-cube, the star network, the pancake network, the bubble sort network, the Cayley graph of transposition tree, the De Bruijn network, the Kautz network, the consecutive-d digraph, the ILLIAC network, the circulant digraph, the circulant undirected graph, the ring digraph, etc have been widely used as processor/communication networks. The performance of such networks is often measured through an analysis of their degree, diameter, connectivity, fault tolerance, routing algorithm, etc. In this paper, at first, we proposed the concepts --- vector digraph and vector graph. Second, we developed vector digraph model and vector graph model for interconnection networks for designing, analyzing, and improving above networks. Furthermore, we shew that the networkd mentioned above can be concisely represented in the two models. More importantly, we shew that the two models enabled us to design new networks --- double star network and triangle network based on vector graphs.
    Related Articles | Metrics | Comments0