样式: 排序: IF: - GO 导出 标记为已读
-
Maximum size of a triangle-free graph with bounded maximum degree and matching number J. Comb. Optim. (IF 1.0) Pub Date : 2024-04-16 Milad Ahanjideh, Tınaz Ekim, Mehmet Akif Yıldız
-
Computational complexity and algorithms for two scheduling problems under linear constraints J. Comb. Optim. (IF 1.0) Pub Date : 2024-04-14 Kameng Nip, Peng Xie
-
Branch-and-cut-and-price algorithm for the constrained-routing and spectrum assignment problem J. Comb. Optim. (IF 1.0) Pub Date : 2024-04-14 Ibrahima Diarrassouba, Youssouf Hadhbi, A. Ridha Mahjoub
-
A tight max-flow min-cut duality theorem for nonlinear multicommodity flows J. Comb. Optim. (IF 1.0) Pub Date : 2024-04-11 Matthew Broussard, Bala Krishnamoorthy
-
Minimizing the expense transmission time from the source node to demand nodes J. Comb. Optim. (IF 1.0) Pub Date : 2024-04-06 Mehdi Ghiyasvand, Iman Keshtkar
-
n-fold L(2, 1)-labelings of Cartesian product of paths and cycles J. Comb. Optim. (IF 1.0) Pub Date : 2024-04-06 Fei-Huang Chang, Ma-Lian Chia, Shih-Ang Jiang, David Kuo, Jing-Ho Yan
-
The average size of maximal matchings in graphs J. Comb. Optim. (IF 1.0) Pub Date : 2024-04-04 Alain Hertz, Sébastien Bonte, Gauvain Devillez, Hadrien Mélot
-
An exact borderline between the NP-hard and polynomial-time solvable cases of flow shop scheduling with job-dependent storage requirements J. Comb. Optim. (IF 1.0) Pub Date : 2024-04-04 Alexander Kononov, Marina Pakulich
We consider two versions of two-machine flow shop scheduling problems, where each job requires an additional resource from the start of its first operation till the end of its second operation. We refer to this resource as storage space. The storage requirement of each job is determined by the processing time of its first operation. The two problems differ from each other in the way resources are allocated
-
Randomized approximation schemes for minimizing the weighted makespan on identical parallel machines J. Comb. Optim. (IF 1.0) Pub Date : 2024-03-31 Ruiqing Sun
In this paper, we discuss scheduling problems with m identical machines and n jobs where each job has to be assigned to some machine. The objective is to minimize the weighted makespan of jobs, i.e., the maximum weighted completion time of jobs. This scheduling problem is a generalization of minimizing the makespan on parallel machine scheduling problem. We present a (\(2-\frac{1}{m}\))-approximation
-
Selecting intervals to optimize the design of observational studies subject to fine balance constraints J. Comb. Optim. (IF 1.0) Pub Date : 2024-03-31
Abstract Motivated by designing observational studies using matching methods subject to fine balance constraints, we introduce a new optimization problem. This problem consists of two phases. In the first phase, the goal is to cluster the values of a continuous covariate into a limited number of intervals. In the second phase, we find the optimal matching subject to fine balance constraints with respect
-
Online car-sharing problem with variable booking times J. Comb. Optim. (IF 1.0) Pub Date : 2024-03-30 Haodong Liu, Kelin Luo, Yinfeng Xu, Huili Zhang
In this paper, we address the problem of online car-sharing with variable booking times (CSV for short). In this scenario, customers submit ride requests, each specifying two important time parameters: the booking time and the pick-up time (start time), as well as two location parameters—the pick-up location and the drop-off location within a graph. For each request, it’s important to note that it
-
Star covers and star partitions of double-split graphs J. Comb. Optim. (IF 1.0) Pub Date : 2024-03-22 Joyashree Mondal, S. Vijayakumar
-
On list (p, 1)-total labellings of special planar graphs and 1-planar graphs J. Comb. Optim. (IF 1.0) Pub Date : 2024-03-13 Lin Sun, Guanglong Yu, Jianliang Wu
-
Approximation algorithms for the fault-tolerant facility location problem with submodular penalties J. Comb. Optim. (IF 1.0) Pub Date : 2024-02-26 Yingying Guo, Qiaoliang Li
This work is to discuss the fault-tolerant facility location problem with submodular penalties. We propose an LP-rounding 2.27-approximation algorithm, where every demand point j has a requirement that \(t_{j}\) distinct facilities serve it. This is the first constant performance guarantee known for this problem. In addition, we give an LP-rounding 2-approximation algorithm for the case where all requirements
-
A linear ordering problem with weighted rank J. Comb. Optim. (IF 1.0) Pub Date : 2024-02-26 Manuel V. C. Vieira
-
On sufficient conditions for Hamiltonicity of graphs, and beyond J. Comb. Optim. (IF 1.0) Pub Date : 2024-02-23 Hechao Liu, Lihua You, Yufei Huang, Zenan Du
Identifying certain conditions that ensure the Hamiltonicity of graphs is highly important and valuable due to the fact that determining whether a graph is Hamiltonian is an NP-complete problem.For a graph G with vertex set V(G) and edge set E(G), the first Zagreb index (\(M_{1}\)) and second Zagreb index (\(M_{2}\)) are defined as \(M_{1}(G)=\sum \limits _{v_{i}v_{j}\in E(G)}(d_{G}(v_{i})+d_{G}(v_{j}))\)
-
On scheduling multiple parallel two-stage flowshops with Johnson’s Rule J. Comb. Optim. (IF 1.0) Pub Date : 2024-02-23 Guangwei Wu, Fu Zuo, Feng Shi, Jianxin Wang
-
EPTAS for parallel identical machine scheduling with time restrictions J. Comb. Optim. (IF 1.0) Pub Date : 2024-02-22 G. Jaykrishnan, Asaf Levin
We consider the non-preemptive scheduling problem on identical machines where there is a parameter B and each machine in every unit length time interval can process up to B different jobs. The goal function we consider is the makespan minimization and we develop an EPTAS for this problem. Prior to our work a PTAS was known only for the case of one machine and constant values of B, and even the case
-
On the packing number of antibalanced signed simple planar graphs of negative girth at least 5 J. Comb. Optim. (IF 1.0) Pub Date : 2024-02-12 Reza Naserasr, Weiqiang Yu
-
On convexity in split graphs: complexity of Steiner tree and domination J. Comb. Optim. (IF 1.0) Pub Date : 2024-02-12 A. Mohanapriya, P. Renjith, N. Sadagopan
-
An extension of the Christofides heuristic for a single-depot multiple Hamiltonian path problem J. Comb. Optim. (IF 1.0) Pub Date : 2024-02-12 Jun Wu, Zhen Yang, Guiqing Zhang, Yongxi Cheng
-
Improved shuffled Frog leaping algorithm with unsupervised population partitioning strategies for complex optimization problems J. Comb. Optim. (IF 1.0) Pub Date : 2024-02-11 Shikha Mehta
-
The prediction model of water level in front of the check gate of the LSTM neural network based on AIW-CLPSO J. Comb. Optim. (IF 1.0) Pub Date : 2024-01-28 Linqing Gao, Dengzhe Ha, Litao Ma, Jiqiang Chen
-
A branch-and-cut algorithm for the balanced traveling salesman problem J. Comb. Optim. (IF 1.0) Pub Date : 2024-01-28 Thi Quynh Trang Vo, Mourad Baiou, Viet Hung Nguyen
-
Integrating supplier selection decisions into an inventory location problem for designing the supply chain network J. Comb. Optim. (IF 1.0) Pub Date : 2024-01-24
Abstract This paper proposes a novel Inventory-Location problem that integrates supplier selection decisions to design a three-echelon supply chain network, under a continuous (s,Q) inventory control policy at the warehouses. In this problem, a set of warehouses must be selected within a set of potential locations to serve several customers or demand zones, additionally involving the selection of the
-
Concentration behavior: 50 percent of h-extra edge connectivity of pentanary n-cube with exponential faulty edges J. Comb. Optim. (IF 1.0) Pub Date : 2024-01-24 Tengteng Liang, Mingzu Zhang, Sufang Liu
-
On the Alon–Tarsi number of semi-strong product of graphs J. Comb. Optim. (IF 1.0) Pub Date : 2024-01-05 Lin Niu, Xiangwen Li
The Alon–Tarsi number was defined by Jensen and Toft (Graph coloring problems, Wiley, New York, 1995). The Alon–Tarsi number AT(G) of a graph G is the smallest integer k such that G has an orientation D with maximum outdegree \(k-1\) and the number of even circulation is not equal to that of odd circulations in D. It is known that \(\chi (G)\le \chi _l(G)\le AT(G)\) for any graph G, where \(\chi (G)\)
-
Optimal investment decision for photovoltaic projects in China: a real options method J. Comb. Optim. (IF 1.0) Pub Date : 2023-11-24 Xing Zhu, Baoyu Liao
-
Capacity decisions and revenue sharing in a telemedicine healthcare system J. Comb. Optim. (IF 1.0) Pub Date : 2023-11-24 Liangliang Sun, Miao Yu, Fenghao Wang
-
Methods for determining cycles of a specific length in undirected graphs with edge weights J. Comb. Optim. (IF 1.0) Pub Date : 2023-11-19 R. Lewis, P. Corcoran, A. Gagarin
-
Algorithmic and complexity aspects of problems related to total restrained domination for graphs J. Comb. Optim. (IF 1.0) Pub Date : 2023-11-17 Yu Yang, Cai-Xia Wang, Shou-Jun Xu
-
Partial inverse min–max spanning tree problem under the weighted bottleneck hamming distance J. Comb. Optim. (IF 1.0) Pub Date : 2023-11-16 Qingzhen Dong, Xianyue Li, Yu Yang
-
On decreasing the orders of $$(k,g)$$ -graphs J. Comb. Optim. (IF 1.0) Pub Date : 2023-11-16 Geoffrey Exoo, Robert Jajcay, Tom Raiman
-
Bounding the total forcing number of graphs J. Comb. Optim. (IF 1.0) Pub Date : 2023-11-16 Shengjin Ji, Mengya He, Guang Li, Yingui Pan, Wenqian Zhang
-
Dominated coloring in product graphs J. Comb. Optim. (IF 1.0) Pub Date : 2023-11-10 Minhui Li, Shumin Zhang, Chengfu Ye
The dominated coloring (dom-coloring) of a graph G is a proper coloring such that each color class is dominated by at least one vertex. The dominated chromatic number (dom-chromatic number) of G is the minimum number of color classes among all dominated colorings of G, denoted by \(\chi _{\text {dom}}(G)\). In this paper, we study the dominated coloring of Cartesian product, direct product, lexicographic
-
Minmax for facility location game with optional preference under minimum distance requirement J. Comb. Optim. (IF 1.0) Pub Date : 2023-11-01 Xinping Xu, Jingwen Zhang, Lihua Xie
In this paper, we study the optional preference model for the facility location game with two heterogeneous facilities on a line interval [0, 1], by further enforcing the requirement of a minimum distance \(0\le d\le 1\) between the two facilities. Each agent has one of three favorable preferences towards the two facilities, i.e., facility 1, facility 2, or optional preference. Here, we consider two
-
On the chromatic number of $$P_5$$ -free graphs with no large intersecting cliques J. Comb. Optim. (IF 1.0) Pub Date : 2023-10-15 Weilun Xu, Xia Zhang
-
Semi-online early work maximization problems on two hierarchical uniform machines with partial information of processing time J. Comb. Optim. (IF 1.0) Pub Date : 2023-10-15 Man Xiao, Xiaoqiao Liu, Weidong Li
-
Derivations of large classes of facet defining inequalities of the weak order polytope using ranking structures J. Comb. Optim. (IF 1.0) Pub Date : 2023-09-27 Adolfo R. Escobedo, Romena Yasmin
-
Research on sensitive text classification detection and classification based on improved artificial neural network J. Comb. Optim. (IF 1.0) Pub Date : 2023-09-28 Haisheng Gu, Qing Li, Duanming Shen
-
Area, perimeter, height, and width of rectangle visibility graphs J. Comb. Optim. (IF 1.0) Pub Date : 2023-09-20 John S. Caughman, Charles L. Dunn, Joshua D. Laison, Nancy Ann Neudauer, Colin L. Starr
-
Discrete facility location games with different preferences J. Comb. Optim. (IF 1.0) Pub Date : 2023-09-13 Ling Gai, Mengpei Liang, Chenhao Wang
-
Signed rearrangement distances considering repeated genes, intergenic regions, and indels J. Comb. Optim. (IF 1.0) Pub Date : 2023-09-10 Gabriel Siqueira, Alexsandro Oliveira Alexandrino, Zanoni Dias
-
Online k-color spanning disk problems J. Comb. Optim. (IF 1.0) Pub Date : 2023-09-02 Yin Wang, Yinfeng Xu, Huili Zhang, Weitian Tong
-
On a generalization of the spectral Mantel’s theorem J. Comb. Optim. (IF 1.0) Pub Date : 2023-09-01 Chunmeng Liu, Changjiang Bu
Mantel’s theorem is a classical result in extremal graph theory which implies that the maximum number of edges of a triangle-free graph of order n. In 1970, Nosal obtained a spectral version of Mantel’s theorem which gave the maximum spectral radius of a triangle-free graph of order n. In this paper, the clique tensor of a graph G is proposed and the spectral Mantel’s theorem is extended via the clique
-
An improved online replenishment policy and its competitive ratio analysis for a purchase-to-order seller J. Comb. Optim. (IF 1.0) Pub Date : 2023-08-31 Guanqun Ni
For a purchase-to-order seller, there is no inventory and the seller has to purchase goods to fulfill orders already placed. For each purchase, there is a constant ordering cost. For each order, delay cost will be incurred if it is not fulfilled timely. Consequently, there is a tradeoff between the ordering cost and the delay cost for the seller to make replenishment decisions minimizing the total
-
Optimal design of garments for high-temperature operations based on the finite difference method J. Comb. Optim. (IF 1.0) Pub Date : 2023-08-26 Jiang-Hao Li, Hao Xu
-
Complete forcing numbers of complete and almost-complete multipartite graphs J. Comb. Optim. (IF 1.0) Pub Date : 2023-08-24 Xin He, Heping Zhang
-
Tight bounds for the price of anarchy and stability in sequential transportation games J. Comb. Optim. (IF 1.0) Pub Date : 2023-08-21 Francisco J. M. da Silva, Flávio K. Miyazawa, Ieremies V. F. Romero, Rafael C. S. Schouery
-
Scheduling problems with rejection to minimize the k-th power of the makespan plus the total rejection cost J. Comb. Optim. (IF 1.0) Pub Date : 2023-08-17 Lingfa Lu, Liqi Zhang
In this paper, we consider several scheduling problems with rejection on \(m\ge 1\) identical machines. Each job is either accepted and processed on the machines, or it is rejected by paying a certain rejection cost. The objective is to minimize the sum of the k-th power of the makespan of accepted jobs and the total rejection cost of rejected jobs, where \(k>0\) is a given constant. We also introduce
-
Maximum dissociation sets in subcubic trees J. Comb. Optim. (IF 1.0) Pub Date : 2023-08-14 Lei Zhang, Jianhua Tu, Chunlin Xin
-
International market risk, monetary policy stance, and corporate financing: China’s economic recovery in the post-pandemic era J. Comb. Optim. (IF 1.0) Pub Date : 2023-08-07 Cheng-Ben Wang, Qian Zhong
-
Alternating-direction-method-of-multipliers-based fast model predictive control for an aerial trees-pruning robot J. Comb. Optim. (IF 1.0) Pub Date : 2023-08-04 Changliang Xu, Hao Xu, Zhong Yang, Jiying Wu, Luwei Liao, Qiuyan Zhang
-
A combinatorial approximation algorithm for k-level facility location problem with submodular penalties J. Comb. Optim. (IF 1.0) Pub Date : 2023-08-04 Li Zhang, Jing Yuan, Zhizhen Xu, Qiaoliang Li
-
Robust optimization for minimizing energy consumption of multicast transmissions in coded wireless packet networks under distance uncertainty J. Comb. Optim. (IF 1.0) Pub Date : 2023-08-02 Mohammad Ali Raayatpanah, Thomas Weise, Jinsong Wu, Ming Tan, Panos M. Pardalos
-
Parallel solutions for ordinal scheduling with a small number of machines J. Comb. Optim. (IF 1.0) Pub Date : 2023-07-24 Leah Epstein
-
Maximum clique deleted from ramsey graphs of a graph and paths J. Comb. Optim. (IF 1.0) Pub Date : 2023-07-24 Yan Li, Yusheng Li, Ye Wang
-
New mixed integer linear programming models and an iterated local search for the clustered traveling salesman problem with relaxed priority rule J. Comb. Optim. (IF 1.0) Pub Date : 2023-07-24 Thanh Tan Doan, Nathalie Bostel, Minh Hoàng Hà, Vu Hoang Vuong Nguyen
-
Simultaneous eating algorithm and greedy algorithm in assignment problems J. Comb. Optim. (IF 1.0) Pub Date : 2023-07-17 Ping Zhan
-
Combinatorial optimization analysis of the production process of C4 olefins from ethanol based on the PSO–BP algorithm J. Comb. Optim. (IF 1.0) Pub Date : 2023-07-14 Ze-Hua He