# Search results for: Yixun Lin

Discussiones Mathematicae Graph Theory > 2017 > 38 > 1 > 189-201

Graphs and Combinatorics > 2015 > 31 > 1 > 149-167

*G*with order

*n*and bandwidth

*B*, denoted by

*m*(

*n*,

*B*). The results of

*m*(

*n*,

*n*− 1) and

*m*(

*n*,

*n*− 2) have been known in the literature. This paper studies

*m*(

*n*,

*n*− 3) as well as the extremal graphs. In particular, we concentrate on a relation between...

Discrete Mathematics > 2014 > 331 > Complete > 89-92

Information Processing Letters > 2013 > 113 > 8 > 280-284

Discrete Mathematics > 2013 > 313 > 6 > 772-783

Central European Journal of Operations Research > 2013 > 21 > 1 > 177-186

*n*jobs on a serial-batching machine to minimize maximum cost and makespan simultaneously. A serial-batching machine is a machine that can handle up to

*b*jobs in a batch and jobs in a batch start and complete respectively at the same time and the processing time of a batch is equal to the sum of the processing times of jobs in the batch. When...

Information Processing Letters > 2010 > 110 > 11 > 469-473

European Journal of Operational Research > 2010 > 201 > 3 > 966-970

Information Processing Letters > 2009 > 109 > 12 > 603-607

Journal of Combinatorial Optimization > 2009 > 18 > 1 > 38-50

*n*-node undirected ring network. Each of its links is associated with a weight. Traffic demands are given for each pair of nodes in the ring. The load of a link is the sum of the flows routed through the link, and the weighted load of a link is the product of its weight and the smallest integer not less than its load. The objective of the problem...

Discrete Mathematics > 2008 > 308 > 23 > 5334-5341

Theoretical Computer Science > 2007 > 381 > 1-3 > 234-240

Theoretical Computer Science > 2007 > 374 > 1-3 > 196-202

European Journal of Operational Research > 2007 > 176 > 2 > 809-818

Journal of Combinatorial Optimization > 2007 > 14 > 4 > 475-480

European Journal of Operational Research > 2005 > 164 > 3 > 851-855

European Journal of Operational Research > 2004 > 156 > 1 > 261-266

_{j}of machines. For the problem P|p

_{j}=1,M

_{j}|C

_{m}

_{a}

_{x}where the subset family {M

_{j}} is nested, Pinedo [Scheduling: Theory, Algorithms, and Systems, Prentice-Hall, Englewood Cliffs, NJ, 1995]...

European Journal of Operational Research > 2004 > 153 > 1 > 191-199

^{+}and a cost c:E->R

^{+}. For each e E, c(e) stands for the cost of reducing weight w(e) by one unit. For each subset F F, the bottleneck weight of F is w(F)=min

_{e}

_{F}w(e). The weight of the...

Discrete Mathematics > 2004 > 275 > 1-3 > 339-346

Applied Mathematics-A Journal of Chinese Universities > 2003 > 18 > 3 > 361-369

*G*is to embed

*G*into a path

*P*

_{ n }such that the maximum number of overlap edges (i.e., the congestion) is minimized. It is known that the problem for general graphs is NP-hard while it is polynomially solvable for trees. This paper presents an exact formula for the cutwidth of trees with diameter at most 4. A relation with the bandwidth is discussed as well.