Mor, Baruch
Published in
Journal of Combinatorial Optimization

We study the well-known common due-date assignment and scheduling problem and focus on minmax objective functions with position-dependent processing times. In due-date assignment problems, the objective is to find simultaneously the optimal job sequence and due-date that minimize the total earliness, tardiness and due-date related costs. Based on t...

Chen, Chen Wei, Yu
Published in
Journal of Combinatorial Optimization

We consider Markowitz’s portfolio optimization problem that heavily suffers from uncertainties of input parameters. And based on set order relations, uncertain portfolio optimization problem at various extreme cases is modelled as robust multiobjective formulations. At first, borrowing set order relations, three concepts of set less ordered efficie...

Wang, Tao
Published in
Journal of Combinatorial Optimization

A total coloring of a graph G is an assignment of colors to the vertices and the edges of G such that every pair of adjacent/incident elements receive distinct colors. The total chromatic number of a graph G, denoted by χ′′(G)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepacka...

Liu, Bin Yan, Yuxia Fang, Qizhi Dong, Junyu Wu, Weili Wang, Huijuan
Published in
Journal of Combinatorial Optimization

Information propagation plays an important role in social network, which helps shaping consumer’s purchasing decisions. Most of existing works focus on maximizing the influence of one product. But in our reality life, the majority of the companies produce various products for meeting customer needs. So it is important to learn about how to distribu...

He, Xiaozhou Liu, Zhihui Su, Bing Xu, Yinfeng Zheng, Feifeng Zhu, Binhai
Published in
Journal of Combinatorial Optimization

Given the scheduling model of bike-sharing, we consider the problem of hitting a set of n axis-parallel line segments in R2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document...

Drugan, Madalina M.
Published in
Journal of Combinatorial Optimization

The efficiency of local search is proportional to the number and the distribution of basins of attraction. Often combinatorial optimisation problems have a large number of local optima, uncountable with available computational resources. Approximating the number of basins of attraction and the minimal number of samples for visiting all basins at le...

Weller, Mathias Chateau, Annie Giroudeau, Rodolphe König, Jean-Claude Pollet, Valentin
Published in
Journal of Combinatorial Optimization

The solution extension variant of a problem consists in, being given an instance and a partial solution, finding the best solution comprising the given partial solution. Many problems have been studied with a similar approach. For instance the Pre-Coloring Extension problem, the clustered variant of the Travelling Salesman problem, or the General R...

Choi, Ilkyoo Kim, Jinha Kim, Minki
Published in
Journal of Combinatorial Optimization

We consider the class of semi-transitively orientable graphs, which is a much larger class of graphs compared to transitively orientable graphs, in other words, comparability graphs. Ever since the concept of a semi-transitive orientation was defined as a crucial ingredient of the characterization of alternation graphs, also known as word-represent...

Chen, Ming Li, Yusheng Yang, Yiting
Published in
Journal of Combinatorial Optimization

For a graph G, let n(G), α(G)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\alpha (G)$$\end{document} and β(G)\documentclass[12pt]{minimal} \usepackage{amsmath} \usep...

Li, Zepeng Shao, Zehui Wu, Pu Zhao, Taiyin
Published in
Journal of Combinatorial Optimization

For a graph G, let f:V(G)→P({1,2}).\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$f:V(G)\rightarrow {\mathcal {P}}(\{1,2\}).$$\end{document} If for each vertex v∈V(G)\...