Journal of Combinatorial Optimization

Papers
(The median citation count of Journal of Combinatorial Optimization is 0. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2021-02-01 to 2025-02-01.)
ArticleCitations
An approximation algorithm for a general class of multi-parametric optimization problems37
Further steps on the reconstruction of convex polyominoes from orthogonal projections18
RETRACTED ARTICLE: Optimization design and implementation of shared information management system for industrial design network platform18
Target set selection in social networks with tiered influence and activation thresholds16
An improved PTAS for covering targets with mobile sensors14
An extension of the Christofides heuristic for a single-depot multiple Hamiltonian path problem14
Lollipop and cubic weight functions for graph pebbling14
Degree and betweenness-based label propagation for community detection13
Recognizing integrality of weighted rectangles partitions13
An efficient approach for searching optimal multi-keywords coverage routes12
Social media actors: perception and optimization of influence across different types12
Tight bounds for the price of anarchy and stability in sequential transportation games11
Distance magic labeling of the halved folded n-cube10
Tree-optimized labeled directed graphs10
Declawing a graph: polyhedra and Branch-and-Cut algorithms9
Lease or financial lease? Deterministic strategies for on-line financial lease problem with the second-hand transaction8
Minmax for facility location game with optional preference under minimum distance requirement8
Lower bounds for batched bin packing8
Bounding the total forcing number of graphs8
Multi-objective outpatient scheduling in health centers considering resource constraints and service quality: a robust optimization approach8
On decreasing the orders of $$(k,g)$$-graphs8
Approximation algorithms for some min–max and minimum stacker crane cover problems7
The prize-collecting single machine scheduling with bounds and penalties7
On the computational complexity of finding a sparse Wasserstein barycenter7
Algorithmic and complexity aspects of problems related to total restrained domination for graphs7
Robust optimization for minimizing energy consumption of multicast transmissions in coded wireless packet networks under distance uncertainty7
On the residual closeness of graphs with cut vertices7
On total and edge coloring some Kneser graphs6
Improved stretch factor of Delaunay triangulations of points in convex position6
Non-resumable scheduling on a single bounded parallel-batch machine with periodic maintenance6
Meta-heuristic-based hybrid deep learning model for vulnerability detection and prevention in software system6
Single-machine multitasking scheduling with job efficiency promotion6
Streaming submodular maximization under d-knapsack constraints6
A simple optimal algorithm for k-tuple dominating problem in interval graphs6
Online bottleneck matching on a line6
Finding a minimal spanning hypertree of a weighted hypergraph6
Above guarantee parameterization for vertex cover on graphs with maximum degree 46
Heuristics for cross-docking scheduling of truck arrivals, truck departures and shop-floor operations5
Cooperation models in automotive supply chain under low-carbon emission reduction policies5
A DC programming approach for solving a centralized group key management problem5
Intersections and circuits in sets of line segments5
DPMA: a distributed profit-based placement scheme for multi-sp mobile edge computing5
Approximation algorithm for the minimum partial connected Roman dominating set problem5
A 3/2-approximation for big two-bar charts packing5
On streaming algorithms for maximizing a supermodular function plus a MDR-submodular function on the integer lattice5
Characterizing slope regions5
Adjacent vertex distinguishing edge coloring of IC-planar graphs5
Sufficient conditions for the optimality of the greedy algorithm in greedoids5
Results on vertex-edge and independent vertex-edge domination5
k-Wiener index of a k-plex5
2-Distance coloring of planar graphs without adjacent 5-cycles5
Complexity results for two kinds of colored disconnections of graphs5
Retraction Note: AISAS model-based statistical analysis for intelligent eldercare products consumption research4
Simultaneous eating algorithm and greedy algorithm in assignment problems4
On the SVP for low-dimensional circulant lattices4
A common generalization of budget games and congestion games4
(Strong) Total proper connection of some digraphs4
Methods for determining cycles of a specific length in undirected graphs with edge weights4
On optimal due date assignment without restriction and resource allocation in group technology scheduling4
On list (p, 1)-total labellings of special planar graphs and 1-planar graphs4
Randomized approximation schemes for minimizing the weighted makespan on identical parallel machines4
Maximizing the amount of data collected from WSN based on solar-powered UAV in urban environment4
Online learning under one sided $$\sigma $$-smooth function4
Single-machine scheduling problems with general truncated sum-of-actual-processing-time-based learning effect4
Approximation algorithm for prize-collecting vertex cover with fairness constraints4
Efficient heuristics to compute minimal and stable feedback arc sets4
Complete-Subgraph-Transversal-Sets problem on bounded treewidth graphs4
A simple method for proving lower bounds in the zero-visibility cops and robber game4
The critical node game4
Retraction Note: Analysis of modern circulation industry development level using industrial structure mechanism4
An equilibrium analysis of the impact of real estate price volatility on macroeconomics based on ant colony algorithm4
Algorithms for single machine scheduling problem with release dates and submodular penalties4
Retraction Note: Research on shale gas productivity prediction method based on optimization algorithm4
Approximation algorithms for the capacitated correlation clustering problem with penalties4
A PTAS for non-resumable open shop scheduling with an availability constraint4
A MILP model for the connected multidimensional maximum bisection problem4
An improved upper bound for the online graph exploration problem on unicyclic graphs4
Explicit construction of mixed dominating sets in generalized Petersen graphs4
A green vehicle routing problem with multi-depot, multi-tour, heterogeneous fleet and split deliveries: a mathematical model and heuristic approach4
Retraction Note: AHI: a hybrid machine learning model for complex industrial information systems4
RETRACTED ARTICLE: Combinatorial optimization analysis of the production process of C4 olefins from ethanol based on the PSO–BP algorithm3
Faster algorithms for k-subset sum and variations3
Optimal dynamic mining policy of blockchain selfish mining through sensitivity-based optimization3
Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph3
Approximation algorithms for sorting by k-cuts on signed permutations3
Online k-color spanning disk problems3
Improved formulations and branch-and-cut algorithms for the angular constrained minimum spanning tree problem3
The signed edge-domatic number of nearly cubic graphs3
A complete algebraic solution to the optimal dynamic rationing policy in the stock-rationing queue with two demand classes3
An augmented Lagrangian approach with general constraints to solve nonlinear models of the large-scale reliable inventory systems3
A polyhedral approach to least cost influence maximization in social networks3
Matroid-rooted packing of arborescences3
An LP-based characterization of solvable QAP instances with chess-board and graded structures3
On the chromatic number of $$P_5$$-free graphs with no large intersecting cliques3
On metric dimension of plane graphs with $$\frac{m}{2}$$ number of 10 sided faces3
HM-EIICT: Fairness-aware link prediction in complex networks using community information3
Fast algorithms for maximizing monotone nonsubmodular functions3
An online joint replenishment problem combined with single machine scheduling3
Computing a consensus trajectory in a vehicular network3
On the complexity of minimum maximal acyclic matchings3
Advancing local search approximations for multiobjective combinatorial optimization problems3
Online scheduling with migration on two hierarchical machines3
A note on the single machine CON and CONW problems with lot scheduling3
RETRACTED ARTICLE: Research on shale gas productivity prediction method based on optimization algorithm3
Paired domination versus domination and packing number in graphs3
Computing densest k-subgraph with structural parameters3
Decomposability of a class of k-cutwidth critical graphs3
Envy-freeness and relaxed stability: hardness and approximation algorithms3
Approximation algorithms for stochastic set cover and single sink rent-or-buy with submodular penalty3
The enforcement of ECA regulations: inspection strategy for on-board fuel sampling3
Exact algorithms for solving the constrained parallel-machine scheduling problems with divisible processing times and penalties3
Competitive analysis for two-option online leasing problem under sharing economy3
The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation3
Retraction Note: Identifying vital nodes in hypernetwork based on local centrality2
Online car-sharing problem with variable booking times2
Algorithms for a two-machine no-wait flow shop scheduling problem with two competing agents2
Approximation algorithms for solving the heterogeneous Chinese postman problem2
Retraction Note: The Sachs theorem and its application on extended adjacency matrix of graphs2
Online scheduling on an unbounded parallel-batch machine to minimize the weighted makespan2
A hybrid grey wolf optimizer for engineering design problems2
Retraction Note: On Aα-spectrum of a unicyclic graph2
A study on $$k$$-$$walk$$ generation algorithm to prevent the tottering in graph edit distance heuristic algorithms2
Retraction Note: Spatial-temporal deep learning model based rumor source identification in social networks2
Approximation algorithms for the fault-tolerant facility location problem with submodular penalties2
Planar graphs are acyclically edge $$(\Delta + 5)$$-colorable2
The fractional matching preclusion number of complete n-balanced k-partite graphs2
Modeling the relationship between fairness concern and customer loyalty in dual distribution channel2
Further results on 2-distance coloring of graphs2
A new lower bound for the eternal vertex cover number of graphs2
Faster algorithms for evacuation problems in networks with a single sink of small degree and bounded capacitated edges2
RETRACTED ARTICLE: Dynamic analysis of structures installed hysteretic dampers with hardening post-yielding stiffness using connection element method2
Spanning tree of a multiple graph2
1-Attempt parallel thinning2
Sharp upper bound of injective coloring of planar graphs with girth at least 52
Online multiple one way non-preemptive time series search with interrelated prices2
An intensification approach based on fitness landscape characteristics for job shop scheduling problem2
Computational complexity and algorithms for two scheduling problems under linear constraints2
Generalized opinion dynamics model for social trust networks2
Maximum size of a triangle-free graph with bounded maximum degree and matching number2
Fast searching on cactus graphs2
Reconsidering the existence of stable solutions in three-sided matching problems with mixed preferences2
Approximation algorithms for the lower bounded correlation clustering problem2
Approximation algorithms for some extensions of the maximum profit routing problem2
An ant colony optimization approach for the proportionate multiprocessor open shop2
The k-th Roman domination problem is polynomial on interval graphs2
Determining the edge metric dimension of the generalized Petersen graph P(n, 3)2
The undirected optical indices of trees2
Star covers and star partitions of double-split graphs2
Cloud model for new energy vehicle supply chain management based on growth expectation2
Efficient branch-and-bound algorithms for finding triangle-constrained 2-clubs2
Optimal blocks for maximizing the transaction fee revenue of Bitcoin miners2
Retraction Note: Combinatorial optimization analysis of the production process of C4 olefins from ethanol based on the PSO–BP algorithm2
A tight max-flow min-cut duality theorem for nonlinear multicommodity flows2
Optimal dispatching of electric vehicles based on optimized deep learning in IoT2
Factors determining customers desire to analyse supply chain management in intelligent IoT2
Partial inverse min–max spanning tree problem under the weighted bottleneck hamming distance2
Scheduling problems with rejection to minimize the k-th power of the makespan plus the total rejection cost2
Randomly finding independent sets in locally sparse graphs2
RETRACTED ARTICLE: Smart logistics with IoT-based enterprise management system using global manufacturing2
Retraction Note: Sector-like optimization model of 5G base transceiver stations redeployment and the generalization1
Algorithms for maximizing monotone submodular function minus modular function under noise1
A linear ordering problem with weighted rank1
RETRACTED ARTICLE: Capacitance pin defect detection based on deep learning1
On the relation between Wiener index and eccentricity of a graph1
RETRACTED ARTICLE: Identifying vital nodes in hypernetwork based on local centrality1
On ABC spectral radius of uniform hypergraphs1
A solution approach for cardinality minimization problem based on fractional programming1
The maximum 3-star packing problem in claw-free cubic graphs1
Dynamic time window based full-view coverage maximization in CSNs1
RETRACTED ARTICLE: Enhanced post-quantum key escrow system for supervised data conflict of interest based on consortium blockchain1
Leafy spanning k-forests1
Models for two-dimensional bin packing problems with customer order spread1
Maximum clique deleted from ramsey graphs of a graph and paths1
Customer churn prediction using a novel meta-classifier: an investigation on transaction, Telecommunication and customer churn datasets1
Single-machine scheduling with periodic due dates to minimize the total earliness and tardy penalty1
Partial-monotone adaptive submodular maximization1
Retraction Note: Alternating-direction-method-of-multipliers-based fast model predictive control for an aerial trees-pruning robot1
Pattern-based ILP models for the one-dimensional cutting stock problem with setup cost1
Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint1
Retraction Note: ARX and ARMAX modelling of SBCNC-60 machine for surface roughness and MRR with optimization of system response using PSO1
On the complexity of minimum q-domination partization problems1
The optimization of self-interference in wideband full-duplex phased array with joint transmit and receive beamforming1
Linear-size universal discretization of geometric center-based problems in fixed dimensions1
Signed rearrangement distances considering repeated genes, intergenic regions, and indels1
Minimizing the expense transmission time from the source node to demand nodes1
Group fairness in non-monotone submodular maximization1
Minimum $$ s-t $$ hypercut in (s, t)-planar hypergraphs1
Retraction Note: Dynamic analysis of structures installed hysteretic dampers with hardening post-yielding stiffness using connection element method1
Analyzing the spatial association of household consumption carbon emission structure based on social network1
Integrating supplier selection decisions into an inventory location problem for designing the supply chain network1
Retraction Note: Sound absorption performance of EPDM-based textile composites investigated through the transfer matrix model1
Online scheduling of two-machine flowshop with lookahead and incompatible job families1
Capacity decisions and revenue sharing in a telemedicine healthcare system1
The maximum average connectivity among all orientations of a graph1
The hamiltonian path graph is connected for simple s, t paths in rectangular grid graphs1
The upper bounds on the Steiner k-Wiener index in terms of minimum and maximum degrees1
A green routing-location problem in a cold chain logistics network design within the Balanced Score Card pillars in fuzzy environment1
Designing emergency flood evacuation plans using robust optimization and artificial intelligence1
RETRACTED ARTICLE: Alternating-direction-method-of-multipliers-based fast model predictive control for an aerial trees-pruning robot1
Non-submodular maximization with a decomposable objective function1
Minimizing total weighted late work on a single-machine with non-availability intervals1
Generalized self-profit maximization and complementary-profit maximization in attribute networks1
The balanced maximally diverse grouping problem with integer attribute values1
RETRACTED ARTICLE: ARX and ARMAX modelling of SBCNC-60 machine for surface roughness and MRR with optimization of system response using PSO1
Online routing and searching on graphs with blocked edges1
Maximum properly colored trees in edge-colored graphs1
Approximation algorithm for the parallel-machine scheduling problem with release dates and submodular rejection penalties1
RETRACTED ARTICLE: AISAS model-based statistical analysis for intelligent eldercare products consumption research1
OnML: an ontology-based approach for interpretable machine learning1
On the oriented diameter of planar triangulations1
League competitions and fairness1
Uniform Voronoi tessellation of digital manifolds: a GPU-based algorithm with applications to remeshing1
A game theoretic approach for pricing and advertising of an integrated product family in a duopoly1
Near automorphisms of complement or square of a path1
An upper bound for neighbor-connectivity of graphs1
n-fold L(2, 1)-labelings of Cartesian product of paths and cycles1
Minimizing the maximum lateness for scheduling with release times and job rejection1
The sum of root-leaf distance interdiction problem with cardinality constraint by upgrading edges on trees1
Retraction Note: Algorithm research on the influence of financing structure and cash holding on enterprise innovation based on system GMM model function theory1
Beyond submodularity: a unified framework of randomized set selection with group fairness constraints1
2-Distance list $$(\Delta +2)$$-coloring of planar graphs with girth at least 101
Diversified-profit maximization in competitive social advertising1
Independent domination in subcubic graphs1
A novel cross docking system for distributing the perishable products considering preemption: a machine learning approach1
RETRACTED ARTICLE: Optimal design of garments for high-temperature operations based on the finite difference method1
An improved physical ZKP for nonogram and nonogram color1
The average size of maximal matchings in graphs1
Optimal investment decision for photovoltaic projects in China: a real options method1
An effective link prediction method in multiplex social networks using local random walk towards dependable pathways1
On the packing number of antibalanced signed simple planar graphs of negative girth at least 51
RETRACTED ARTICLE: AHI: a hybrid machine learning model for complex industrial information systems1
Minimum total coloring of planar graphs with maximum degree 81
Study on the incentive and coordination mechanism of tumor healthcare alliance based on evolutionary game1
An optimal streaming algorithm for non-submodular functions maximization on the integer lattice1
Maliciously roaming person's detection around hospital surface using intelligent cloud-edge based federated learning1
New efficient algorithms for the two-machine no-wait chain-reentrant shop problem1
A detailed introduction to a minimum-cost perfect matching algorithm based on linear programming1
Polynomial time algorithm for k-vertex-edge dominating problem in interval graphs1
An approximation algorithm for the spherical k-means problem with outliers by local search1
Vehicle scheduling problems with two agents on a line1
Complete forcing numbers of complete and almost-complete multipartite graphs1
Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane1
A note on maximum fractional matchings of graphs1
On maximizing monotone or non-monotone k-submodular functions with the intersection of knapsack and matroid constraints1
A new allocation rule for the housing market problem with ties1
Comment on “Approximation algorithms for quadratic programming”1
Concentration behavior: 50 percent of h-extra edge connectivity of pentanary n-cube with exponential faulty edges1
Retraction Note: A novel dynamic en-route and slot allocation method based on receding horizon control1
Competitive algorithm for scheduling of sharing machines with rental discount1
The sum of root-leaf distance interdiction problem by upgrading edges/nodes on trees1
0.10631394386292