Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Optimization, Volume 37
Volume 37, Number 1, January 2019
- Jian Chang, Lingjuan Zhang:
Case Mix Index weighted multi-objective optimization of inpatient bed allocation in general hospital. 1-19 - Ying Yang
, Shoucheng Luo, Jing Fan, Xinye Zhou, Chunyu Fu, Guochun Tang:
Study on specialist outpatient matching appointment and the balance matching model. 20-39 - Bin Hu, Fang Pan, Lei Wang:
A scheduling algorithm for medical emergency rescue aircraft trajectory based on hybrid estimation and intent inference. 40-61 - Huaxin Qiu, Dujuan Wang, Yanzhang Wang, Yunqiang Yin:
MRI appointment scheduling with uncertain examination time. 62-82 - Wenhua Li, Xing Chai:
The medical laboratory scheduling for weighted flow-time. 83-94 - Ling Gai, Jiandong Ji:
An integrated method to solve the healthcare facility layout problem under area constraints. 95-113 - Shanxiu Jiang, Li Luo:
Online in-time service problem with minimal server assignment. 114-122 - Huiqiao Su, Guohua Wan, Shan Wang:
Online scheduling for outpatient services with heterogeneous patients and physicians. 123-149 - Bowen Jiang, Jiafu Tang, Chongjun Yan:
A comparison of fixed and variable capacity-addition policies for outpatient capacity allocation. 150-182 - Cheng He, Yang Wu, Tong Chen:
Prognostics and health management of life-supporting medical instruments. 183-195 - Gang Du, Luyao Zheng, Xiaoling Ouyang:
Real-time scheduling optimization considering the unexpected events in home health care. 196-220 - Xi Chen, Liu Zhao, Haiming Liang, Kin Keung Lai:
Matching patients and healthcare service providers: a novel two-stage method based on knowledge rules and OWA-NSGA-II algorithm. 221-247 - Xiaohui Liu, Ni Zou, Dan Zhu, Dan Wang:
Influencing factors analysis and modeling of hospital-acquired infection in elderly patients. 248-270 - Huidan Lin, Qun Li, Xueguo Xu, Ping Li:
Optimal arrangement of the pulmonary interventional surgeries considering timely distribution of medical consumables. 271-285 - Liwei Zhong, Yanqin Bai:
Three-sided stable matching problem with two of them as cooperative partners. 286-292 - Jihong Yan, Chen Xu, Na Li, Ming Gao, Aoying Zhou:
Optimizing model parameter for entity summarization across knowledge graphs. 293-318 - Long Zhang, Yuzhong Zhang, Qingguo Bai:
Two-stage medical supply chain scheduling with an assignable common due window and shelf life. 319-329 - Feng Zhang, Jing Li, Junxiang Fan, Huili Shen, Jian Shen, Hua Yu:
Three-dimensional stable matching with hybrid preferences. 330-336 - Zhenyuan Liu, Jiongbing Lu, Zaisheng Liu, Guangrui Liao, Hao Howard Zhang, Junwu Dong:
Patient scheduling in hemodialysis service. 337-362 - Yadong Wang, Baoqiang Fan, Jingang Zhai, Wei Xiong:
Two-machine flowshop scheduling in a physical examination center. 363-374 - Wei Gao, Wuping Bao, Xin Zhou:
Analysis of cough detection index based on decision tree and support vector machine. 375-384 - Jiawei Zhang, Ling Wang, Lining Xing:
Large-scale medical examination scheduling technology based on intelligent optimization. 385-404 - Lu Liu, Chun Wang, Jian-Jun Wang:
A combinatorial auction mechanism for surgical scheduling considering surgeon's private availability information. 405-417 - Satoru Fujishige, Ali Ridha Mahjoub, Franz Rendl:
Preface: The fourth International Symposium on Combinatorial Optimization (ISCO) 2016. 418-422
Volume 37, Number 2, February 2019
- Yixin Cao, Jianer Chen:
Preface to the special issue on computing and combinatorics. 423 - Gill Barequet, Mira Shalah, Yufei Zheng:
An improved lower bound on the growth constant of polyiamonds. 424-438 - Dongmei Zhang, Chunlin Hao, Chenchen Wu, Dachuan Xu, Zhenning Zhang:
Local search approximation algorithms for the k-means problem with penalties. 439-453 - Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto:
Reconfiguration of maximum-weight b-matchings in a graph. 454-464 - Sankardeep Chakraborty, Srinivasa Rao Satti:
Space-efficient algorithms for maximum cardinality search, its applications, and variants of BFS. 465-481 - Kuan-Yi Ho, Yi-Jun Chang, Hsu-Chun Yen:
Unfolding some classes of orthogonal polyhedra of arbitrary genus. 482-500 - Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Efficient enumeration of non-equivalent squares in partial words with few holes. 501-522 - Prajakta Nimbhorkar, V Arvind Rameshwar:
Dynamic rank-maximal and popular matchings. 523-545 - Alan Diêgo Aurélio Carneiro, Fábio Protti, Uéverton S. Souza:
Deadlock resolution in wait-for graphs by vertex/arc deletion. 546-562 - Wei Yu, Zhaohui Liu:
Better approximability results for min-max tree/cycle/path cover problems. 563-578 - Elena Arseneva, Evanthia Papadopoulou:
Randomized incremental construction for the Hausdorff Voronoi diagram revisited and extended. 579-600 - Wenkai Dai, Yongjie Yang:
Reoptimization of minimum latency problem revisited: don't panic when asked to revisit the route after local modifications. 601-619 - Maximilian Drees, Matthias Feldotto, Sören Riechers, Alexander Skopalik:
Pure Nash equilibria in restricted budget games. 620-638 - Zhou Chen, Yukun Cheng, Qi Qi, Xiang Yan:
Agent incentives of a proportional sharing mechanism in resource sharing. 639-667 - Jianming Dong, Ruyan Jin, Jueliang Hu, Guohui Lin:
A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops. 668-684 - Shinya Fujita, Tommy Jensen, Boram Park, Tadashi Sakuma:
On the weighted safe set problem on paths and cycles. 685-701 - Bruce Priddy, Haiying Wang, Bing Wei:
Independent bondage number of a graph. 702-712 - Ekta Jain, Kalpana Dahiya, Anuj Sharma, Vanita Verma:
An improved algorithm for two stage time minimization assignment problem. 713-736 - Yukun Cheng, Qiaoming Han, Wei Yu, Guochuan Zhang:
Strategy-proof mechanisms for obnoxious facility game with bounded service range. 737-755
Volume 37, Number 3, April 2019
- Shuwan Zhu, Wenjuan Fan, Shanlin Yang, Jun Pei, Panos M. Pardalos:
Operating room planning and surgical case scheduling: a review of literature. 757-805 - Neda Beheshti Asl, S. A. MirHassani:
Accelerating benders decomposition: multiple cuts via multiple solutions. 806-826 - György Dósa, Leah Epstein:
Pareto optimal equilibria for selfish bin packing with uniform cost sharing. 827-847 - Davood Shiri, F. Sibel Salman:
Competitive analysis of randomized online strategies for the multi-agent k-Canadian Traveler Problem. 848-865 - Laurent Gourvès:
Agreeable sets with matroidal constraints. 866-888 - Gruia Calinescu, Xiaolang Wang:
Client assignment problems for latency minimization. 889-900 - Jin Cui, Cong Tian, Nan Zhang, Zhenhua Duan, Hongwei Du:
Verifying schedulability of tasks in ROS-based systems. 901-920 - Yanyan Wen, Guorong Chai, Qiuli Li, Zhe George Zhang:
A possible optimal design of one-way Hamming network H(n, 3) based on the minimum transmission latency. 921-934 - Chassidy Bozeman, Boris Brimkov, Craig Erickson, Daniela Ferrero, Mary Flagg, Leslie Hogben:
Restricted power domination and zero forcing problems. 935-956 - Mehdi Ghiyasvand:
An $$O(n(m+n\log n)\log n)$$ O ( n ( m + n log n ) log n ) time algorithm to solve the minimum cost tension problem. 957-969 - Daniela Ferrero, Cyriac Grigorious, Thomas Kalinowski, Joe Ryan, Sudeep Stephen:
Minimum rank and zero forcing number for butterfly networks. 970-988 - Yuan Zhang, Jinjiang Yuan:
A note on a two-agent scheduling problem related to the total weighted late work. 989-999 - Jun Liang, Dingjun Lou:
A polynomial algorithm determining cyclic vertex connectivity of k-regular graphs with fixed k. 1000-1010 - Paulina Grzegorek, Janusz Januszewski:
Drawer algorithms for 1-space bounded multidimensional hyperbox packing. 1011-1044 - Daniel R. Page, Roberto Solis-Oba:
Approximation algorithms for the graph balancing problem with two speeds and two job lengths. 1045-1070 - Weifan Wang, Jingjing Huo, Danjun Huang, Yiqiao Wang:
Planar graphs with $$\Delta =9$$ Δ = 9 are neighbor-distinguishing totally 12-colorable. 1071-1089
Volume 37, Number 4, May 2019
- Qilong Feng, Jiaxin Hu, Neng Huang, Jianxin Wang:
Improved PTAS for the constrained k-means problem. 1091-1110 - Jian Liang, Xiaohui Huang, Zhao Zhang:
Approximation algorithms for distance constraint sweep coverage with base stations. 1111-1125 - Yajing Liu, Edwin K. P. Chong, Ali Pezeshki:
Improved bounds for the greedy strategy in optimization problems with curvature. 1126-1149 - Marzio De Biasi, Juho Lauri:
On the complexity of restoring corrupted colorings. 1150-1169 - Shanshan Zhai, Peng Zhang, Daming Zhu, Weitian Tong, Yao Xu, Guohui Lin:
An approximation algorithm for genome sorting by reversals to recover all adjacencies. 1170-1190 - Meng Wang, Cong Tian, Nan Zhang, Zhenhua Duan, Hongwei Du:
Verifying a scheduling protocol of safety-critical systems. 1191-1215 - J. M. Grau Ribas:
A new look at the returning secretary problem. 1216-1236 - Luobing Dong, Qiumin Guo, Weili Wu:
Speech corpora subset selection based on time-continuous utterances features. 1237-1248 - Baoling Ning, Jianzhong Li, Shouxu Jiang:
Balanced tree partition problems with virtual nodes. 1249-1265 - Eric Angel, Evripidis Bampis, Fadi Kacem, Dimitrios Letsios:
Speed scaling on parallel processors with migration. 1266-1282 - Hisao Tamaki:
Positive-instance driven dynamic programming for treewidth. 1283-1311 - Takuro Fukunaga:
LP-based pivoting algorithm for higher-order correlation clustering. 1312-1326 - Zepeng Li, Zehui Shao, Pu Wu, Taiyin Zhao:
On the 2-rainbow domination stable graphs. 1327-1341 - Ming Chen, Yusheng Li, Yiting Yang:
Independence and matching number of some graphs. 1342-1350 - Ilkyoo Choi, Jinha Kim, Minki Kim:
On operations preserving semi-transitive orientability of graphs. 1351-1366 - Madalina M. Drugan:
Estimating the number of basins of attraction of multi-objective combinatorial problems. 1367-1407 - Xiaozhou He, Zhihui Liu, Bing Su, Yinfeng Xu, Feifeng Zheng, Binhai Zhu:
Efficient algorithms for computing one or two discrete centers hitting a set of line segments. 1408-1423
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-06-19 21:58 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:
