default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Optimization, Volume 43
Volume 43, Number 1, January 2022
- Shu-Yu Cui, Yiqiao Wang, Danjun Huang, Hongwei Du, Weifan Wang:
Structure and pancyclicity of maximal planar graphs with diameter two. 1-27 - Amirreza Akbari, Saieed Akbari, Ali Doosthosseini
, Zahra Hadizadeh, Michael A. Henning, A. Naraghi:
Independent domination in subcubic graphs. 28-41 - Yingli Li, Jiahai Wang, Zhengwei Liu:
A simple two-agent system for multi-objective flexible job-shop scheduling. 42-64 - Zhongyuan Che:
k-Wiener index of a k-plex. 65-78 - Baruch Mor:
Minmax common flow-allowance problems with convex resource allocation and position-dependent workloads. 79-97 - Xinsheng Xiong, Xianjia Wang, Kun He:
A new allocation rule for the housing market problem with ties. 98-115 - Zhongyi Jiang, Fangfang Chen, Xiandong Zhang:
Single-machine scheduling problems with general truncated sum-of-actual-processing-time-based learning effect. 116-139 - Rashed Khanjani Shiraz, Ali Babapour Azar, Zohreh Hosseini-Noudeh, Panos M. Pardalos:
Distributionally robust maximum probability shortest path problem. 140-167 - Abdennour Azerine, Mourad Boudhar, Djamal Rebaine:
A two-machine no-wait flow shop problem with two competing agents. 168-199 - Kameng Nip, Tianning Shi, Zhenbo Wang:
Some graph optimization problems with weights satisfying linear constraints. 200-225 - Ante Custic, Stefan Lendl:
The Steiner cycle and path cover problem on interval graphs. 226-234 - Jian Lin, Xiangfei Zeng, Jianxun Liu, Keqin Li:
Angular bisector insertion algorithm for solving small-scale symmetric and asymmetric traveling salesman problem. 235-252 - Tianlong Ma, Eddie Cheng, Yaping Mao, Xu Wang:
A note on maximum fractional matchings of graphs. 253-264 - Mehdi Soltanifar, Hamid Sharafi:
A modified DEA cross efficiency method with negative data and its application in supplier selection. 265-296
Volume 43, Number 2, March 2022
- Mark Velednitsky:
Solving (k-1)-stable instances of k-terminal cut with isolating cuts. 297-311 - Bhanuprakash Dudi, V. Rajesh:
Optimized threshold-based convolutional neural network for plant leaf classification: a challenge towards untrained data. 312-349 - Yuan Yuan, Yan Lan, Ning Ding, Xin Han:
A PTAS for non-resumable open shop scheduling with an availability constraint. 350-362 - Sayani Das, Sounaka Mishra:
On the complexity of minimum q-domination partization problems. 363-383 - Zhen-Kun Zhang, Zhong Zhao, Liuyong Pang:
Decomposability of a class of k-cutwidth critical graphs. 384-401 - Frank Gurski, Dominique Komander, Carolin Rehs, Jochen Rethmann, Egon Wanke:
Computing directed Steiner path covers. 402-431 - Santiago Valdés Ravelo:
Approximation algorithms for simple assembly line balancing problems. 432-443 - Zhihuai Chen, Bo Li, Xiaohan Shan, Xiaoming Sun, Jialin Zhang:
Discouraging pool block withholding attacks in Bitcoin. 444-459 - David G. L. Wang, Monica M. Y. Wang, Shiqiang Zhang:
Determining the edge metric dimension of the generalized Petersen graph P(n, 3). 460-496
Volume 43, Number 3, April 2022
- Marc Goerigk, Adam Kasperski, Pawel Zielinski:
Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty. 497-527 - Vladimir Shenmaier:
Linear-size universal discretization of geometric center-based problems in fixed dimensions. 528-542 - Rocío M. Casablanca, Peter Dankelmann, Wayne Goddard, Lucas Mol, Ortrud Oellermann:
The maximum average connectivity among all orientations of a graph. 543-570 - Yong Chen, Yinhui Cai, Longcheng Liu, Guangting Chen, Randy Goebel, Guohui Lin, Bing Su, An Zhang:
Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph. 571-588 - Lakmali Weerasena:
Advancing local search approximations for multiobjective combinatorial optimization problems. 589-612 - János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin:
Lower bounds for batched bin packing. 613-629 - Xingong Zhang, Win-Chin Lin, Chin-Chia Wu:
Rescheduling problems with allowing for the unexpected new jobs arrival. 630-645 - Jilei Shi, Lei Cai, Erfang Shan, Wenrong Lyu:
A value for cooperative games with coalition and probabilistic graph structures. 646-671 - Yong Zhang, Hong Lin, Lina Zheng, Xingyu Yang:
Adaptive online portfolio strategy based on exponential gradient updates. 672-696 - Mark Velednitsky:
Correction To: Solving (k-1)-stable instances of k-terminal cut with isolating cuts. 697
Volume 43, Number 4, May 2022
- Han Xiao, Qizhi Fang:
Population monotonicity in matching games. 699-709 - Zhuoya Liu, Changqing Xu:
Adjacent vertex distinguishing edge coloring of IC-planar graphs. 710-726 - Sanderson L. Gonzaga de Oliveira, Cláudio Carvalho:
Metaheuristic algorithms for the bandwidth reduction of large-scale matrices. 727-784 - Zeynep Adak, Mahmure Övül Arioglu, Serol Bulkan:
An ant colony optimization approach for the proportionate multiprocessor open shop. 785-817 - Sylvain Béal, Eric Rémila, Philippe Solal:
Allocation rules for cooperative games with restricted communication and a priori unions based on the Myerson value and the average tree solution. 818-849 - Alexander V. Smirnov:
Spanning tree of a multiple graph. 850-869 - Zhen Wang, Liwei Liu, Yiqiang Q. Zhao:
Equilibrium customer and socially optimal balking strategies in a constant retrial queue with multiple vacations and N-policy. 870-908
Volume 43, Number 5, July 2022
- Jian Wang, Yin Wang, Mingzhu Yu:
A multi-period ambulance location and allocation problem in the disaster. 909-932 - Sai Ji, Dachuan Xu, Min Li, Yishui Wang:
Approximation algorithms for two variants of correlation clustering problem. 933-952 - Chunlin Xin, Shuo Liang, Fengwu Shen:
Reconfiguration of garbage collection system based on Voronoi graph theory: a simulation case of Beijing region. 953-973 - Haiyan Yu, Xianwei Luo, Tengyu Wu:
Online pickup and delivery problem with constrained capacity to minimize latency. 974-993 - João Vinicius C. Thompson, Loana Tito Nogueira, Fábio Protti, Raquel S. F. Bravo, Mitre Costa Dourado, Uéverton S. Souza:
A general framework for path convexities. 994-1009 - Ming Liu, Rongfan Liu, E. Zhang, Chengbin Chu:
Eco-friendly container transshipment route scheduling problem with repacking operations. 1010-1035 - Anil Maheshwari, Arash Nouri, Jörg-Rüdiger Sack:
Shortest paths among transient obstacles. 1036-1074 - Qi Chen, Qi Xu:
Joint optimal pricing and advertising policies in a fashion supply chain under the ODM strategy considering fashion level and goodwill. 1075-1105 - Hui Zhang, Kai Luo, Guanqun Ni:
The effects of price subsidy and fairness concern on pricing and benefits of take-away supply chain. 1106-1124 - Zhenning Zhang, Bin Liu, Yishui Wang, Dachuan Xu, Dongmei Zhang:
Maximizing a monotone non-submodular function under a knapsack constraint. 1125-1148 - Cong Chen, Huili Zhang, Yinfeng Xu:
Online machine minimization with lookahead. 1149-1172 - Xue Li, Zhengwen He, Nengmin Wang, Mario Vanhoucke:
Multimode time-cost-robustness trade-off project scheduling problem under uncertainty. 1173-1202 - Sofiat Olaosebikan, David F. Manlove:
Super-stability in the student-project allocation problem with ties. 1203-1239 - Kelin Luo, Yinfeng Xu, Haodong Liu:
Online scheduling of car-sharing request pairs between two locations. 1240-1263 - Takehiro Ito, Haruka Mizuta, Naomi Nishimura, Akira Suzuki:
Incremental optimization of independent sets under the reconfiguration framework. 1264-1279 - Xin Feng, Chengbin Chu:
Online leasing problem with price fluctuations and the second-hand transaction. 1280-1297 - Peng Wu, Ling Xu, Ada Che, Feng Chu:
A bi-objective decision model and method for the integrated optimization of bus line planning and lane reservation. 1298-1327 - Cristina Bazgan, Arne Herzel, Stefan Ruzika, Clemens Thielen, Daniel Vanderpooten:
An approximation algorithm for a general class of parametric optimization problems. 1328-1358 - Ying Chen, Yongxi Cheng, Guiqing Zhang:
Single machine lot scheduling with non-uniform lot capacities and processing times. 1359-1367 - Miroslav Chlebík, Janka Chlebíková:
Weighted amplifiers and inapproximability results for Travelling Salesman problem. 1368-1390 - Qiang Zhang, Shi Qiang Liu, Mahmoud Masoud:
A traffic congestion analysis by user equilibrium and system optimum with incomplete information. 1391-1404 - Wei Yu, Zhaohui Liu, Xiaoguang Bao:
Distance constrained vehicle routing problem to minimize the total cost: algorithms and complexity. 1405-1422 - Peng Hu, Feng Chu, Yunfei Fang, Peng Wu:
Novel distribution-free model and method for stochastic disassembly line balancing with limited distributional information. 1423-1446 - Wenjie Wang, Lei Xie:
Optimal pricing of crowdsourcing logistics services with social delivery capacity. 1447-1469 - Xiaoming Sun, Yuan Sun, Kewen Wu, Zhiyu Xia:
On the relationship between energy complexity and other boolean function measures. 1470-1492 - Boris Brimkov, Valentin E. Brimkov:
Optimal conditions for connectedness of discretized sets. 1493-1506 - Bo Chen, Dachuan Xu, Guochuan Zhang:
Preface. 1507-1508 - Alessandro Hill, Roberto Baldacci, Stefan Voß:
Optimal Steiner trees under node and edge privacy conflicts. 1509-1533 - Grzegorz Guspiel:
Smaller universal targets for homomorphisms of edge-colored graphs. 1534-1544 - Yuan Xue, Boting Yang, Sandra Zilles:
A simple method for proving lower bounds in the zero-visibility cops and robber game. 1545-1570 - Feifeng Zheng, Yaxin Pang, Yinfeng Xu:
Heuristics for cross-docking scheduling of truck arrivals, truck departures and shop-floor operations. 1571-1601 - Imed Kacem, Giorgio Lucarelli, Théo Nazé:
Exact algorithms for scheduling programs with shared tasks. 1602-1627 - Xin Chen, Qizhi Fang, Wenjing Liu, Yuan Ding, Qingqin Nong:
Strategyproof mechanisms for 2-facility location games with minimax envy. 1628-1644 - Jing Fan, Hui Shi:
Non-resumable scheduling on a single bounded parallel-batch machine with periodic maintenance. 1645-1654 - Bin Liu, Miaomiao Hu:
Fast algorithms for maximizing monotone nonsubmodular functions. 1655-1670 - Min Cui, Dachuan Xu, Longkun Guo, Dan Wu:
Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint. 1671-1690
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-12-04 22:08 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:
