样式: 排序: IF: - GO 导出 标记为已读
-
Embedding and the first Laplace eigenvalue of a finite graph J. Comb. Optim. (IF 0.9) Pub Date : 2024-07-16 Takumi Gomyou, Toshimasa Kobayashi, Takefumi Kondo, Shin Nayatani
Göring–Helmberg–Wappler introduced optimization problems regarding embeddings of a graph into a Euclidean space and the first nonzero eigenvalue of the Laplacian of a graph, which are dual to each other in the framework of semidefinite programming. In this paper, we introduce a new graph-embedding optimization problem, and discuss its relation to Göring–Helmberg–Wappler’s problems. We also identify
-
A hybrid grey wolf optimizer for engineering design problems J. Comb. Optim. (IF 0.9) Pub Date : 2024-07-03 Shuilin Chen, Jianguo Zheng
-
Injective edge-coloring of claw-free subcubic graphs J. Comb. Optim. (IF 0.9) Pub Date : 2024-07-03 Qing Cui, Zhenmeng Han
-
Approximation algorithms for two clustered arc routing problems J. Comb. Optim. (IF 0.9) Pub Date : 2024-07-03 Xiaoguang Bao, Xinhao Ni
-
Finding a second Hamiltonian decomposition of a 4-regular multigraph by integer linear programming J. Comb. Optim. (IF 0.9) Pub Date : 2024-07-03 Andrei V. Nikolaev, Egor V. Klimov
-
Improved kernelization and fixed-parameter algorithms for bicluster editing J. Comb. Optim. (IF 0.9) Pub Date : 2024-07-03 Manuel Lafond
-
On ABC spectral radius of uniform hypergraphs J. Comb. Optim. (IF 0.9) Pub Date : 2024-06-28 Hongying Lin, Bo Zhou
Let G be a k-uniform hypergraph with vertex set [n] and edge set E(G), where \(k\ge 2\). For \(i\in [n]\), \(d_i\) denotes the degree of vertex i in G. The ABC spectral radius of G is $$\begin{aligned} \max \left\{ k\sum _{e\in E(G)}\root k \of {\dfrac{\sum _{i\in e}d_{i} -k}{\prod _{i\in e}d_{i}}}\prod _{i\in e}x_i: \textbf{x}\in {\mathbb {R}}_+^n, \sum _{i=1}^nx_i^k=1\right\} . \end{aligned}$$ We
-
A neural network accelerated optimization method for FPGA J. Comb. Optim. (IF 0.9) Pub Date : 2024-06-25 Zhengwei Hu, Sijie Zhu, Leilei Wang, Wangbin Cao, Zhiyuan Xie
-
New efficient algorithms for the two-machine no-wait chain-reentrant shop problem J. Comb. Optim. (IF 0.9) Pub Date : 2024-06-16 Nazim Sami, Karim Amrouche, Mourad Boudhar
-
On the SVP for low-dimensional circulant lattices J. Comb. Optim. (IF 0.9) Pub Date : 2024-06-01 Gengran Hu, Yanbin Pan, Renzhang Liu
-
Phylogenetic network-assisted rooting of unrooted gene trees J. Comb. Optim. (IF 0.9) Pub Date : 2024-06-01 Jerzy Tiuryn, Natalia Rutecka, Paweł Górecki
-
Diabetic prediction and classification of risk level using ODDTADC method in big data analytics J. Comb. Optim. (IF 0.9) Pub Date : 2024-05-21 G. Geo Jenefer, A. J. Deepa, M. Mary Linda
-
The frustum network model based on clique extension J. Comb. Optim. (IF 0.9) Pub Date : 2024-05-20 Anthony Bonato, Ryan Cushman, Trent G. Marbach, Zhiyuan Zhang
-
On the oriented diameter of planar triangulations J. Comb. Optim. (IF 0.9) Pub Date : 2024-05-20 Debajyoti Mondal, N. Parthiban, Indra Rajasingh
-
The maximum 3-star packing problem in claw-free cubic graphs J. Comb. Optim. (IF 0.9) Pub Date : 2024-05-18 Wenying Xi, Wensong Lin
-
The critical node game J. Comb. Optim. (IF 0.9) Pub Date : 2024-05-18 Gabriele Dragotto, Amine Boukhtouta, Andrea Lodi, Mehdi Taobane
-
Scheduling of elective operations with coordinated utilization of hospital beds and operating rooms J. Comb. Optim. (IF 0.9) Pub Date : 2024-05-18 Zhaohui Li, Haiyue Yu, Zhaowei Zhou
-
Online learning under one sided $$\sigma $$ -smooth function J. Comb. Optim. (IF 0.9) Pub Date : 2024-05-18 Hongxiang Zhang, Dachuan Xu, Ling Gai, Zhenning Zhang
-
An intensification approach based on fitness landscape characteristics for job shop scheduling problem J. Comb. Optim. (IF 0.9) Pub Date : 2024-05-18 Aparecida de Fátima Castello Rosa, Fabio Henrique Pereira
-
A novel local search approach with connected dominating degree-based incremental neighborhood evaluation for the minimum 2-connected dominating set problem J. Comb. Optim. (IF 0.9) Pub Date : 2024-05-14 Mao Luo, Huigang Qin, Xinyun Wu, Caiquan Xiong
-
Multiple shooting approach for finding approximately shortest paths for autonomous robots in unknown environments in 2D J. Comb. Optim. (IF 0.9) Pub Date : 2024-05-11 Phan Thanh An, Nguyen Thi Le
-
The doubly metric dimensions of cactus graphs and block graphs J. Comb. Optim. (IF 0.9) Pub Date : 2024-05-05 Kairui Nie, Kexiang Xu
-
Some results on 2-distance coloring of planar graphs with girth five J. Comb. Optim. (IF 0.9) Pub Date : 2024-05-05 Zakir Deniz
-
Verifying the first nonzero term: physical ZKPs for ABC End View, Goishi Hiroi, and Toichika J. Comb. Optim. (IF 0.9) Pub Date : 2024-05-05 Suthee Ruangwises
-
Proper colorability of segment intersection graphs J. Comb. Optim. (IF 0.9) Pub Date : 2024-05-05 Robert D. Barish, Tetsuo Shibuya
-
Constrained heterogeneous two-facility location games with sum-variant J. Comb. Optim. (IF 0.9) Pub Date : 2024-04-27 Qi Zhao, Wenjing Liu, Qingqin Nong, Qizhi Fang
We study deterministic mechanism design for constrained heterogeneous two-facility location games. The constraint here means that the feasible locations of facilities are specified and the number of facilities that can be built at each feasible location is limited. Given that a set of agents can strategically report their locations on the real line, the authority wants to design strategyproof mechanisms
-
Hybrid optimized deep recurrent neural network for atmospheric and oceanic parameters prediction by feature fusion and data augmentation model J. Comb. Optim. (IF 0.9) Pub Date : 2024-04-27 Sundeep Raj, Sandesh Tripathi, K. C. Tripathi, Rajendra Kumar Bharti
-
Planar graphs are acyclically edge $$(\Delta + 5)$$ -colorable J. Comb. Optim. (IF 0.9) Pub Date : 2024-04-27 Qiaojun Shu, Guohui Lin
-
Approximation algorithm for the minimum partial connected Roman dominating set problem J. Comb. Optim. (IF 0.9) Pub Date : 2024-04-26 Yaoyao Zhang, Zhao Zhang, Ding-Zhu Du
-
Spread of influence with incentives in edge-weighted graphs with emphasis on some families of graphs J. Comb. Optim. (IF 0.9) Pub Date : 2024-04-25 Siavash Askari, Manouchehr Zaker
Let \(G=(V, E)\) be a graph that represents an underlying network. Let \(\tau \) (resp. \({\textbf{p}}\)) be an assignment of non-negative integers as thresholds (resp. incentives) to the vertices of G. The discrete time activation process with incentives corresponding to \((G, \tau , {\textbf{p}})\) is the following. First, all vertices u with \({\textbf{p}}(u)\ge \tau (u)\) are activated. Then at
-
Approximation algorithms for maximum weighted target cover problem with distance limitations J. Comb. Optim. (IF 0.9) Pub Date : 2024-04-22 Jianhong Jin, Yingli Ran, Zhao Zhang
-
Cooperation models in automotive supply chain under low-carbon emission reduction policies J. Comb. Optim. (IF 0.9) Pub Date : 2024-04-21 Yukun Cheng, Zhanghao Yao, Tingting Meng
-
Differentially private submodular maximization with a cardinality constraint over the integer lattice J. Comb. Optim. (IF 0.9) Pub Date : 2024-04-19 Jiaming Hu, Dachuan Xu, Donglei Du, Cuixia Miao
-
Maximum size of a triangle-free graph with bounded maximum degree and matching number J. Comb. Optim. (IF 0.9) 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 0.9) 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 0.9) 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 0.9) 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 0.9) 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 0.9) 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 0.9) 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 0.9) Pub Date : 2024-04-04 Alexander Kononov, Marina Pakulich
-
Randomized approximation schemes for minimizing the weighted makespan on identical parallel machines J. Comb. Optim. (IF 0.9) Pub Date : 2024-03-31 Ruiqing Sun
-
Selecting intervals to optimize the design of observational studies subject to fine balance constraints J. Comb. Optim. (IF 0.9) Pub Date : 2024-03-31 Asaf Levin
-
Online car-sharing problem with variable booking times J. Comb. Optim. (IF 0.9) Pub Date : 2024-03-30 Haodong Liu, Kelin Luo, Yinfeng Xu, Huili Zhang
-
Star covers and star partitions of double-split graphs J. Comb. Optim. (IF 0.9) 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 0.9) 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 0.9) 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 0.9) Pub Date : 2024-02-26 Manuel V. C. Vieira
-
On sufficient conditions for Hamiltonicity of graphs, and beyond J. Comb. Optim. (IF 0.9) 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 0.9) 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 0.9) 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 0.9) Pub Date : 2024-02-12 Reza Naserasr, Weiqiang Yu
-
On convexity in split graphs: complexity of Steiner tree and domination J. Comb. Optim. (IF 0.9) 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 0.9) 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 0.9) 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 0.9) 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 0.9) 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 0.9) 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 0.9) 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 0.9) 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)\)