Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Optimization, Volume 41
Volume 41, Number 1, January 2021
- Baruch Mor
, Gur Mosheiov, Dana Shapira:
Single machine lot scheduling with optional job-rejection. 1-11 - Yong Chen, Zhi-Zhong Chen, Guohui Lin, Lusheng Wang, An Zhang:
A randomized approximation algorithm for metric triangle packing. 12-27 - Anzhen Peng, Longcheng Liu, Weifeng Lin:
Improved approximation algorithms for two-stage flexible flow shop scheduling. 28-42 - Ruiqi Yang, Dachuan Xu, Longkun Guo, Dongmei Zhang:
Sequence submodular maximization meets streaming. 43-55 - Magda Dettlaff, Magdalena Lemanska, Juan A. Rodríguez-Velázquez:
Secure Italian domination in graphs. 56-72 - Jinn Lu, Hung-Lin Fu:
Quaternary splitting algorithm in group testing. 73-79 - Riccardo Dondi, Mohammad Mehdi Hosseinzadeh, Giancarlo Mauri, Italo Zoppis:
Top-k overlapping densest subgraphs: approximation algorithms and computational complexity. 80-104 - Xianliang Liu, Zishen Yang, Wei Wang:
The t-latency bounded strong target set selection problem in some kinds of special family of graphs. 105-117 - Xiaozhi Wang, Xianyue Li, Bo Hou, Wen Liu, Lidong Wu, Suogang Gao:
A greedy algorithm for the fault-tolerant outer-connected dominating set problem. 118-127 - Majun Shi, Zishen Yang, Donghyun Kim, Wei Wang:
Non-monotone submodular function maximization under k-system constraint. 128-142 - Mohammad Reza Hassani, Javad Behnamian:
A scenario-based robust optimization with a pessimistic approach for nurse rostering problem. 143-169 - Zishen Yang, Wei Wang, Donghyun Kim:
On multi-path routing for reliable communications in failure interdependent complex networks. 170-196 - Gang Wang, You Gao:
New construction of error-correcting pooling designs from singular linear spaces over finite fields. 197-212 - Qiufen Ni, Smita Ghosh, Chuanhe Huang, Weili Wu, Rong Jin:
Discount allocation for cost minimization in online social networks. 213-233 - Frank Gurski, Dominique Komander, Carolin Rehs:
On characterizations for subclasses of directed co-graphs. 234-266
Volume 41, Number 2, February 2021
- J. Rajalakshmi, S. Durairaj:
Application of multi-objective optimization algorithm for siting and sizing of distributed generations in distribution networks. 267-289 - Ji-Bo Wang, Bo Cui, Ping Ji, Weiwei Liu:
Research on single-machine scheduling with position-dependent weights and past-sequence-dependent delivery times. 290-303 - Abolfazl Poureidi, Mehrdad Ghaznavi, Jafar Fathali:
Algorithmic complexity of outer independent Roman domination and outer independent total Roman domination. 304-317 - Zaobo He, Akshita Maradapu Vera Venkata Sai, Yan Huang, Daehee Seo, Hanzhou Zhang, Qilong Han:
Differentially private approximate aggregation based on feature selection. 318-327 - Navdeep Bohra, Vishal Bhatnagar:
Group level social media popularity prediction by MRGB and Adam optimization. 328-347 - Qiufen Ni, Hongwei Du:
On strict submodularity of social influence. 348-356 - Luttiely Santos Oliveira, Ricardo Luiz Machado:
Application of optimization methods in the closed-loop supply chain: a literature review. 357-400 - Rangel Hernández-Ortiz, Luis Pedro Montejano, Juan Alberto Rodríguez-Velázquez:
Secure domination in rooted product graphs. 401-413 - Supantha Pandit:
Dominating set of rectangles intersecting a straight line. 414-432 - Abbass Gorgi, Mourad El Ouali, Anand Srivastav, Mohamed Hachimi:
Approximation algorithm for the multicovering problem. 433-450 - Teresa W. Haynes, Michael A. Henning:
Bounds on the semipaired domination number of graphs with minimum degree at least two. 451-486 - Yong Lu, Qiannan Zhou:
On sufficient topological indices conditions for properties of graphs. 487-503 - Ruyan He, Jinjiang Yuan, C. T. Ng, T. C. E. Cheng:
Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work. 504-525 - Hong Gao, Tingting Feng, Yuansheng Yang:
Italian domination in the Cartesian product of paths. 526-543 - Roberto Cruz, Juan Daniel Monsalve, Juan Rada:
The balanced double star has maximum exponential second Zagreb index. 544-552 - Randy Davila, Michael A. Henning:
Zero forcing versus domination in cubic graphs. 553-577
Volume 41, Number 3, April 2021
- Alexsandro Oliveira Alexandrino, Guilherme Henrique Santos Miranda, Carla Negri Lintzmayer, Zanoni Dias:
Length-weighted λ-rearrangement distance. 579-602 - Santiago Valdés Ravelo:
Minimum constellation covers: hardness, approximability and polynomial cases. 603-624 - Qi Wei, Jie Sun, Xuehou Tan, Xiaolin Yao, Yonggong Ren:
The simple grid polygon exploration problem. 625-639 - Soheyl Khalilpourazari, Seyed Hamid Reza Pasandideh:
Designing emergency flood evacuation plans using robust optimization and artificial intelligence. 640-677 - Jinling Yang, Ligong Wang, Xiuwen Yang:
Some mixed graphs with H-rank 4, 6 or 8. 678-693 - Wenying Xi, Wensong Lin:
On maximum P3-packing in claw-free subcubic graphs. 694-709 - Tínaz Ekim, Mordechai Shalom, Oylum Seker:
The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation. 710-735 - Steffen Borgwardt, Stephan Patterson:
On the computational complexity of finding a sparse Wasserstein barycenter. 736-761 - Zhenhua Lyu:
Digraphs that contain at most t distinct walks of a given length with the same endpoints. 762-779
Volume 41, Number 4, May 2021
- Byung-Cheon Choi, Myoung-Ju Park:
Single-machine scheduling with periodic due dates to minimize the total earliness and tardy penalty. 781-793 - Ha-Bang Ban:
A metaheuristic for the delivery man problem with time windows. 794-816 - Hamid Darabi, Yaser Alizadeh, Sandi Klavzar, Kinkar Chandra Das:
On the relation between Wiener index and eccentricity of a graph. 817-829 - Wenjie Li, Jinjiang Yuan:
Single-machine online scheduling of jobs with non-delayed processing constraint. 830-843 - Henan Liu, Huili Zhang, Yi Xu:
The m-Steiner Traveling Salesman Problem with online edge blockages. 844-860 - Hui Wang, Xiucui Guan, Qiao Zhang, Binwu Zhang:
Capacitated inverse optimal value problem on minimum spanning tree under bottleneck Hamming distance. 861-887 - Wei Lv, Chenchen Wu:
An LP-rounding based algorithm for a capacitated uniform facility location problem with penalties. 888-904 - Michitaka Furuya:
A continuous generalization of domination-like invariants. 905-922 - Ke Liu, Mei Lu:
Complete-Subgraph-Transversal-Sets problem on bounded treewidth graphs. 923-933
a service of 
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 2024-04-19 20:21 CEST 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:
