default search action
Journal of Combinatorial Optimization, Volume 44
Volume 44, Number 1, August 2022
- Weidong Chen, Hao Zhong
, Lidong Wu, Ding-Zhu Du:
A general greedy approximation algorithm for finding minimum positive influence dominating sets in social networks. 1-20 - Fatemeh Keshavarz-Ghorbani, Seyed Hamid Reza Pasandideh
Modeling and optimizing an agro-supply chain considering different quality grades and storage systems for fresh products: a Benders decomposition solution approach. 21-50 - Tianyu Wang, Igor Averbakh
Network construction/restoration problems: cycles and complexity. 51-73 - Qiao Zhang, Xiucui Guan
The sum of root-leaf distance interdiction problem by upgrading edges/nodes on trees. 74-93 - Shengxin Liu, Chung Keung Poon
Greedy algorithms for the profit-aware social team formation problem. 94-118 - Celina M. H. de Figueiredo, Caroline Reis Patrão, Diana Sasaki, Mario Valencia-Pabon:
On total and edge coloring some Kneser graphs. 119-135 - Ping Li
Monochromatic disconnection: Erdős-Gallai-type problems and product graphs. 136-153 - Jie Hu, Hao Li, Shun-ichi Maezawa
Maximum properly colored trees in edge-colored graphs. 154-171 - Md. Jakirul Islam
A speciation-based bilevel niching method for multimodal truss design problems. 172-206 - Bartlomiej Przybylski
Parallel-machine scheduling of jobs with mixed job-, machine- and position-dependent processing times. 207-222 - Xing Ji, Baoyu Liao
A variable neighborhood search algorithm for human resource selection and optimization problem in the home appliance manufacturing industry. 223-241 - Mohammad Ali Raayatpanah
A novel approach to subgraph selection with multiple weights on arcs. 242-268 - Ching-Chi Lin, Cheng-Yu Hsieh, Ta-Yu Mu:
A linear-time algorithm for weighted paired-domination on block graphs. 269-286 - Dávid Szeszlér
Sufficient conditions for the optimality of the greedy algorithm in greedoids. 287-302 - Subhabrata Paul, Keshav Ranjan
Results on vertex-edge and independent vertex-edge domination. 303-330 - Meiqin Wei, Jun Yue, Lily Chen:
The effect of vertex and edge deletion on the edge metric dimension of graphs. 331-342 - Hongye Zheng, Suogang Gao, Wen Liu, Weili Wu, Ding-Zhu Du, Bo Hou:
Approximation algorithm for the parallel-machine scheduling problem with release dates and submodular rejection penalties. 343-353 - Tien Thanh Dam, Thuy Anh Ta
Joint chance-constrained staffing optimization in multi-skill call centers. 354-378 - Alexandre Salles da Cunha:
Improved formulations and branch-and-cut algorithms for the angular constrained minimum spanning tree problem. 379-413 - Yinfeng Xu, Rongteng Zhi
Competitive algorithm for scheduling of sharing machines with rental discount. 414-434 - Jia-Xiong Dan, Zhi-Bo Zhu, Xin-Kui Yang, Ru-Yi Li, Wei-Jie Zhao, Xiang-Jun Li
The signed edge-domatic number of nearly cubic graphs. 435-445 - Min Ji, Yingchun Zhang, Yuan Zhang, T. C. E. Cheng, Yiwei Jiang:
Single-machine multitasking scheduling with job efficiency promotion. 446-479 - Baruch Mor
Single machine scheduling with non-availability interval and optional job rejection. 480-497 - Richard J. Forrester
Strengthening a linear reformulation of the 0-1 cubic knapsack problem via variable reordering. 498-517 - Wenming Zhang, Ye Zhang, Yongxi Cheng
An online trading problem with an increasing number of available products. 518-531 - Ying Liu, Xiuqing Yang, Yong Xiang, Yi Chen, Gang Mao, Xinzhi Zhou:
Allocation and optimization of shared self-service check-in system based on integer programming model. 532-556 - Mateus Martin
Pattern-based ILP models for the one-dimensional cutting stock problem with setup cost. 557-582 - S. M. Mirhadi, S. A. MirHassani
A solution approach for cardinality minimization problem based on fractional programming. 583-602 - Yanhong Gao, Ping Li
Further results on the total monochromatic connectivity of graphs. 603-616 - Felix Bock
Hierarchy cost of hierarchical clusterings. 617-634 - Mohammad Abouei Mehrizi, Federico Corò
Election control through social influence with voters' uncertainty. 635-669 - Yong Zhang, Jingting Wu
Competitive analysis for two-option online leasing problem under sharing economy. 670-689 - Wenchang Luo, Rylan Chin, Alexander Cai, Guohui Lin
A tardiness-augmented approximation scheme for rejection-allowed multiprocessor rescheduling. 690-722 - Canh V. Pham, Quang C. Vu, Dung K. Ha, Tai T. Nguyen, Nguyen D. Le:
Maximizing k-submodular functions under budget constraint: applications and streaming algorithms. 723-751 - Lihe Guan
A heuristic approximation algorithm of minimum dominating set based on rough set theory. 752-769 - Pelin Ayranci
OnML: an ontology-based approach for interpretable machine learning. 770-793 - Alireza Falahiazar
An efficient spread-based evolutionary algorithm for solving dynamic multi-objective optimization problems. 794-849 - Mohd Fadzil Faisae Ab Rashid
Multi-objective multi-verse optimiser for integrated two-sided assembly sequence planning and line balancing. 850-876 - Mingyang Gong
Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing. 877-893 - Gholam Hassan Shirdel
Finding a minimal spanning hypertree of a weighted hypergraph. 894-904
Volume 44, Number 2, September 2022
- Wei Ding
A sifting-edges algorithm for accelerating the computation of absolute 1-center in graphs. 905-920 - Magda Dettlaff, Didem Gözüpek, Joanna Raczek
Paired domination versus domination and packing number in graphs. 921-933 - Cristina G. Fernandes, Carla Negri Lintzmayer
Leafy spanning k-forests. 934-946 - Imen Hamdi
Particle swarm optimization based-algorithms to solve the two-machine cross-docking flow shop problem: just in time scheduling. 947-969 - Han Dai, Bin Deng, Weidong Li
A note on the minimum power partial cover problem on the plane. 970-978 - Chandra Chekuri, Tanmay Inamdar
Algorithms for covering multiple submodular constraints and applications. 979-1010 - Nasreddine Ouertani
A vector evaluated evolutionary algorithm with exploitation reinforcement for the dynamic pollution routing problem. 1011-1038 - Davood Shiri
Online routing and searching on graphs with blocked edges. 1039-1059 - Feifeng Zheng
Competitive analysis of online machine rental and online parallel machine scheduling problems with workload fence. 1060-1076 - Vicente P. Soloviev
Estimation of distribution algorithms using Gaussian Bayesian networks to solve industrial optimization problems constrained by environment variables. 1077-1098 - Tongli Zhang, Yong Xia
Comment on "Approximation algorithms for quadratic programming". 1099-1103 - Rong Yang
An efficient approach for searching optimal multi-keywords coverage routes. 1104-1133 - Zhizhu Lai
The min-p robust optimization approach for facility location problem under uncertainty. 1134-1160 - Qiming Fang
Sharp upper bound of injective coloring of planar graphs with girth at least 5. 1161-1198 - Wanping Zhang, Jixiang Meng, Baoyindureng Wu:
The upper bounds on the Steiner k-Wiener index in terms of minimum and maximum degrees. 1199-1220 - Aneesh D. H, A. Mohanapriya
Steiner tree in k-star caterpillar convex bipartite graphs: a dichotomy. 1221-1247 - Yong Zhang, Jiahao Li
Lease or financial lease? Deterministic strategies for on-line financial lease problem with the second-hand transaction. 1248-1264 - Amnon Rosenmann
Computing the sequence of k-cardinality assignments. 1265-1283 - Dalila B. M. M. Fontes
Job-shop scheduling-joint consideration of production, transport, and storage/retrieval systems. 1284-1322 - Yu Luan, Mei Lu, Yi Zhang:
The fractional matching preclusion number of complete n-balanced k-partite graphs. 1323-1329 - Shi-Sheng Li
Minimizing total weighted late work on a single-machine with non-availability intervals. 1330-1355 - Hoang La, Mickaël Montassier:
2-Distance list (Δ +2)-coloring of planar graphs with girth at least 10. 1356-1375
Volume 44, Number 3, October 2022
- Junli Liu, Wei Jiang, Xuedong Zhang:
Error-correcting codes based on partial linear maps of finite-dimensional vector spaces. 1377-1386 - Parisa Rafigh, Ali Akbar Akbari
A sustainable supply chain network considering lot sizing with quantity discounts under disruption risks: centralized and decentralized models. 1387-1432 - Sunny Kumar Sharma
On metric dimension of plane graphs with $\frac{m}{2}$ number of 10 sided faces. 1433-1458 - Stephan Helfrich
An approximation algorithm for a general class of multi-parametric optimization problems. 1459-1494 - Yu-Hsuan Chang, Ro-Yu Wu, Ruay-Shiung Chang, Jou-Ming Chang
Improved algorithms for ranking and unranking (k, m)-ary trees in B-order. 1495-1510 - Cheng Lu, Zhibin Deng
Fast computation of global solutions to the single-period unit commitment problem. 1511-1536 - Catalina Aranzazu Suescun, Mihaela Cardei
Energy-efficient weak-barrier coverage with adaptive sensor rotation. 1537-1555 - Ananya Christman
Robustly assigning unstable items. 1556-1577 - Chenhao Zhang, Guochuan Zhang
From packing rules to cost-sharing mechanisms. 1578-1593 - Tameem Choudhury, R. Inkulu:
Computing an L1 shortest path among splinegonal obstacles in the plane. 1594-1614 - Alexandre M. Bayen, Jesse Goodman
On the approximability of Time Disjoint Walks. 1615-1636 - Meng Han
A balm: defend the clique-based attack from a fundamental aspect. 1637-1658 - Mark Velednitsky
Isolation branching: a branch and bound algorithm for the k-terminal cut problem. 1659-1679 - Chenchen Wu, Donglei Du, Yue Kang:
An approximation algorithm for stochastic multi-level facility location problem with soft capacities. 1680-1692 - Min Li
The bi-criteria seeding algorithms for two variants of k-means problem. 1693-1704 - Xujin Chen, Zhuo Diao
On weak Pareto optimality of nonatomic routing networks. 1705-1723 - Siyun Zhang, Kameng Nip, Zhenbo Wang
Related machine scheduling with machine speeds satisfying linear constraints. 1724-1740 - Yuefang Sun, Chenchen Wu, Xiaoyan Zhang
Computation and algorithm for the minimum k-edge-connectivity of graphs. 1741-1752 - Guangting Chen, Yong Chen, Zhi-Zhong Chen, Guohui Lin
Approximation algorithms for the maximally balanced connected graph tripartition problem. 1753-1773 - Junran Lichen, Jianping Li
Approximation algorithms for constructing required subgraphs using stock pieces of fixed length. 1774-1795 - Xiaoyan Zhang, Ran Ma, Jian Sun, Zan-Bo Zhang:
Randomized selection algorithm for online stochastic unrelated machines scheduling. 1796-1811 - Lu Han, Dachuan Xu
An approximation algorithm for the uniform capacitated k-means problem. 1812-1823 - Tetsuya Araki, Shin-Ichi Nakano
Max-min dispersion on a line. 1824-1830 - Ivan Avramovic
Analysis of consensus sorting via the cycle metric. 1831-1847 - Xiayan Cheng, Rongheng Li
Tighter price of anarchy for selfish task allocation on selfish machines. 1848-1879 - Cristina Bazgan, Paul Beaujean
An approximation algorithm for the maximum spectral subgraph problem. 1880-1899 - Xing Chai, Wenhua Li, Hang Yuan, Libo Wang:
Online scheduling on a single machine with linear deteriorating processing times and delivery times. 1900-1912 - Menghong Li, Yingli Ran, Zhao Zhang
A primal-dual algorithm for the minimum power partial cover problem. 1913-1923 - Wenxing Zhu, Huating Huang, Lanfan Jiang, Jianli Chen:
Weighted thresholding homotopy method for sparsity constrained optimization. 1924-1952 - Yuanxiao Wu, Xiwen Lu
Capacitated vehicle routing problem on line with unsplittable demands. 1953-1963 - Xiaofei Liu
Combinatorial approximation algorithms for the submodular multicut problem in trees with submodular penalties. 1964-1976 - Sai Ji, Dachuan Xu
The seeding algorithm for spherical k-means clustering with penalties. 1977-1994 - Kelly B. Yancey, Matthew P. Yancey:
Bipartite communities via spectral partitioning. 1995-2028 - Changhong Lu, Qingjie Ye
Algorithmic aspect on the minimum (weighted) doubly resolving set problem of graphs. 2029-2039 - Qin Wang, Tianyu Yang, Longshu Wu:
General restricted inverse assignment problems under l1 and l∞ norms. 2040-2055 - Rahul Swamy
Computing equilibrium in network utility-sharing and discrete election games. 2056-2084 - Pei Yao, Longkun Guo
Exact algorithms for finding constrained minimum spanning trees. 2085-2103 - Yubai Zhang, Zhao Zhang
The price of fairness for a two-agent scheduling game minimizing total completion time. 2104-2122 - Chenlan Wang
Atomic congestion games with random players: network equilibrium and the price of anarchy. 2123-2142 - Tengyu Wu
Online traveling salesman problem with time cost and non-zealous server. 2143-2166
Volume 44, Number 4, November 2022
- Long Zhang, Yuzhong Zhang, Qingguo Bai:
An approximation algorithm for a supply-chain scheduling problem with an assignable common due window and holding time. 2167-2179 - E. Zhang, Feng Chu
Approximation approach for robust vessel fleet deployment problem with ambiguous demands. 2180-2194 - Yinling Wang, Yan Lan, Xin Chen, Xin Han, Yong Piao:
A tight approximation algorithm for problem $P2\rightarrow D|v=1, c=1|C_{\max }$. 2195-2206 - Yongjian Yang
Due date assignment and two-agent scheduling under multitasking environment. 2207-2223 - Deshi Ye
Truthful mechanism design for bin packing with applications on cloud computing. 2224-2245 - Wenqiang Dai, Meng Zheng, Xu Chen
Online economic ordering problem for deteriorating items with limited price information. 2246-2268 - Mingyu Xiao
Parameterized algorithms and complexity for the traveling purchaser problem and its variants. 2269-2285 - Guichen Gao, Xinxin Han, Li Ning, Hing-Fung Ting, Yong Zhang
Principal-agent problem under the linear contract. 2286-2301 - Boris Brimkov, Jesse Geneson
Intersections and circuits in sets of line segments. 2302-2323 - Marina Marceta, Tibor Lukic:
Regularized graph cuts based discrete tomography reconstruction methods. 2324-2346 - Claudia Landi
Relative-perfectness of discrete gradient vector fields and multi-parameter persistent homology. 2347-2374 - Xiaoyun Tian, Dachuan Xu
The spherical k-means++ algorithm via local search scheme. 2375-2394 - Kálmán Palágyi
1-Attempt parallel thinning. 2395-2409 - Yishui Wang, Chenchen Wu, Dongmei Zhang
An approximation algorithm for the spherical k-means problem with outliers by local search. 2410-2422 - Paolo Dulio, Andrea Frosini, Simone Rinaldi
Further steps on the reconstruction of convex polyominoes from orthogonal projections. 2423-2442 - Hongjie Guo, Jianzhong Li, Hong Gao:
Data source selection for approximate query. 2443-2459 - Jacques Carlier, Antoine Jouglet, Eric Pinson, Abderrahim Sahli
A data structure for efficiently managing a set of energy functions. 2460-2481 - Jasine Babu, Veena Prabhakaran
A new lower bound for the eternal vertex cover number of graphs. 2482-2498 - Xiaoyan Zhang, Donglei Du, Gregory Z. Gutin, Qiaoxia Ming, Jian Sun
Approximation algorithms with constant ratio for general cluster routing problems. 2499-2514 - He Huang, Po-Chou Shih, Yuelan Zhu, Wei Gao:
An integrated model for medical expense system optimization during diagnosis process based on artificial intelligence algorithm. 2515-2532 - Xiaoyun Tian, Dachuan Xu
Improved local search algorithms for Bregman k-means and its variants. 2533-2550 - Lingyue Li
The enforcement of ECA regulations: inspection strategy for on-board fuel sampling. 2551-2576 - Gengjun Gao, Zhen Wu, Shuyun Wang:
Study on the incentive and coordination mechanism of tumor healthcare alliance based on evolutionary game. 2577-2597 - Liman Du, Shengminjie Chen
Nonsubmodular constrained profit maximization from increment perspective. 2598-2625 - Jian Sun, Haiyun Sheng, Yuefang Sun, Donglei Du, Xiaoyan Zhang
Approximation algorithms for stochastic set cover and single sink rent-or-buy with submodular penalty. 2626-2641 - Milutin Brankovic, Joachim Gudmundsson, André van Renssen:
Local routing in a tree metric 1-spanner. 2642-2660 - Rocío González-Díaz, Darshan Batavia, Rocío M. Casablanca, Walter G. Kropatsch:
Characterizing slope regions. 2661-2680 - Hans L. Bodlaender
Constructing tree decompositions of graphs with bounded gonality. 2681-2699 - Ashutosh Soni, Partha Bhowmick
Uniform Voronoi tessellation of digital manifolds: a GPU-based algorithm with applications to remeshing. 2700-2728 - Somrita Saha
Surface polygonization of 3D objects using norm similarity. 2729-2747 - Haiyang Zhu, Junlei Zhu
Optimal frequency assignment and planar list L(2, 1)-labeling. 2748-2761 - Johannes Blum
W[1]-hardness of the k-center problem parameterized by the skeleton dimension. 2762-2781 - Ling Gai, Ying Jin, Binyuan Zhang:
An integrated method for hybrid distribution with estimation of demand matching degree. 2782-2808 - Sahar Bakhtar
A new metric to compare local community detection algorithms in social networks using geodesic distance. 2809-2831 - Jianping Li
1-line minimum rectilinear steiner trees and related problems. 2832-2852 - Akrati Saxena
HM-EIICT: Fairness-aware link prediction in complex networks using community information. 2853-2870 - Naveed Ahmed Azam
On the enumeration of minimal non-pairwise compatibility graphs. 2871-2892 - Prosenjit Bose, Anthony D'Angelo, Stephane Durocher:
On the restricted k-Steiner tree problem. 2893-2918 - Quan M. Tran
Measuring the influence and amplification of users on social network with unsupervised behaviors learning and efficient interaction-based knowledge graph. 2919-2945 - Yijing Wang, Dachuan Xu
Bicriteria streaming algorithms to balance gain and cost with cardinality constraint. 2946-2962 - Marcin Jurkiewicz
On zero-error codes produced by greedy algorithms. 2963-2980 - Péter Kardos
Topology preservation on the BCC grid. 2981-2995 - Xuhong Cai, Li Jiang, Songhu Guo, Hejiao Huang, Hongwei Du:
TLHSA and SACA: two heuristic algorithms for two variant VRP models. 2996-3022 - Lydie Richaume, Eric Andres, Gaëlle Largeteau-Skapin
Unfolding H-convex Manhattan Towers. 3023-3037 - Nicolas Boutry, Rocío González-Díaz, María José Jiménez, Eduardo Paluzo-Hidalgo
Strong Euler well-composedness. 3038-3055 - Sanjana Agrawal, R. Inkulu:
Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane. 3056-3082 - Lily Schleider, Eduardo L. Pasiliao, Zhecheng Qiang, Qipeng P. Zheng
A study of feature representation via neural network feature extraction and weighted distance for clustering. 3083-3105 - Nicolas Grelier:
Computing a maximum clique in geometric superclasses of disk graphs. 3106-3135 - Xiaoxin Wang
The optimization of self-interference in wideband full-duplex phased array with joint transmit and receive beamforming. 3136-3152 - Zhongzheng Tang, Zhuo Diao
Triangle packing and covering in dense random graphs. 3153-3164
Volume 44, Number 5, December 2022
- Hoai An Le Thi, Thi Tuyet Trinh Nguyen, Hoang Phuc Hau Luu
A DC programming approach for solving a centralized group key management problem. 3165-3193 - Yu-Han Chen, Kung-Jui Pai, Hsin-Jung Lin, Jou-Ming Chang
Constructing tri-CISTs in shuffle-cubes. 3194-3211 - Xin Sun, Gaidi Li, Yapu Zhang
Private non-monotone submodular maximization. 3212-3232 - Demetrius E. Davos, Ioannis C. Demetriou
Convex-Concave fitting to successively updated data and its application to covid-19 analysis. 3233-3262 - Nai-Wen Chang, Hsuan-Jung Wu, Sun-Yuan Hsieh:
Pancake graphs: Structural properties and conditional diagnosability. 3263-3293 - Rui Mao, Hongwei Du
DPMA: a distributed profit-based placement scheme for multi-sp mobile edge computing. 3294-3309 - Zhongzheng Tang, Yucong Tang, Zhuo Diao
Characterizing 3-uniform linear extremal hypergraphs on feedback vertex number. 3310-3330 - Xianyue Li
Partial inverse maximum spanning tree problem under the Chebyshev norm. 3331-3350 - Xinxin Han
Online data caching in edge-cloud collaborative system with the data center. 3351-3363 - Songhua Li
Online algorithms for the maximum k-interval coverage problem. 3364-3404 - Olivier Ploton
Exponential-time algorithms for parallel machine scheduling problems. 3405-3418 - Gopika Sharma, Arti Pandey, Michael C. Wigal:
Algorithms for maximum internal spanning tree problem for some graph classes. 3419-3445 - Shaowen Lan, Wenjuan Fan, Kaining Shao, Shanlin Yang, Panos M. Pardalos:
A column-generation-based approach for an integrated service planning and physician scheduling problem considering re-consultation. 3446-3476 - (Withdrawn) Capacitance pin defect detection based on deep learning. 3477-3494
- Alain Quilliot, Djamal Rebaine:
Linear time algorithms on mirror trees. 3495-3519 - Xin Chen, Wenjing Liu
Bounding quality of pure Nash equilibria in dual-role facility location games. 3520-3534 - Islam Akaria, Leah Epstein
Online scheduling with migration on two hierarchical machines. 3535-3548 - Xiaojuan Zhang, Qian Liu, Min Li, Yang Zhou
Fast algorithms for supermodular and non-supermodular minimization via bi-criteria strategy. 3549-3574 - Peng Zou, Letu Qingge
Computing a consensus trajectory in a vehicular network. 3575-3594 - Yong Chen, Randy Goebel, Guohui Lin
A local search 4/3-approximation algorithm for the minimum 3-path partition problem. 3595-3610 - Huili Zhang, Rui Du, Kelin Luo
Learn from history for online bipartite matching. 3611-3640 - Changxiang He, Jiayuan Zeng, Guang Zhang, Shuting Liu:
Generalized opinion dynamics model for social trust networks. 3641-3662 - Jing-Yu Ma
Optimal dynamic mining policy of blockchain selfish mining through sensitivity-based optimization. 3663-3700 - Dekel Tsur
Faster deterministic algorithms for Co-path Packing and Co-path/cycle Packing. 3701-3710 - Daniel Berend, Shahar Golan
Using the method of conditional expectations to supply an improved starting point for CCLS. 3711-3734 - (Withdrawn) Industrial structure optimization, economic development factors and regional economic risk prevention in post COVID-19 period: empirical analysis based on panel data of Guangdong regional economy. 3735-3777
- He Huang, Liwei Zhong
Performance prediction and optimization for healthcare enterprises in the context of the COVID-19 pandemic: an intelligent DEA-SVM model. 3778-3791
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-14 22:26 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: