Content
Undated
- 1-20 Maximum weight induced matching in some subclasses of bipartite graphs
by B. S. Panda & Arti Pandey & Juhi Chaudhary & Piyush Dane & Manav Kashyap - 1-20 Approximation algorithms for two variants of correlation clustering problem
by Sai Ji & Dachuan Xu & Min Li & Yishui Wang - 1-20 The new treatment mode research of hepatitis B based on ant colony algorithm
by Jing Yu & Lining Xing & Xu Tan - 1-20 Atomic congestion games with random players: network equilibrium and the price of anarchy
by Chenlan Wang & Xuan Vinh Doan & Bo Chen - 1-20 An approximation algorithm for the maximum spectral subgraph problem
by Cristina Bazgan & Paul Beaujean & Éric Gourdin - 1-20 A completely positive formulation of the graph isomorphism problem and its positive semidefinite relaxation
by Pawan Aurora & Shashank K. Mehta - 1-20 Online pickup and delivery problem with constrained capacity to minimize latency
by Haiyan Yu & Xianwei Luo & Tengyu Wu - 1-20 On the price of anarchy of two-stage machine scheduling games
by Deshi Ye & Lin Chen & Guochuan Zhang - 1-21 Reconfiguration of garbage collection system based on Voronoi graph theory: a simulation case of Beijing region
by Chun-lin Xin & Shuo Liang & Feng-wu Shen - 1-21 Isolation branching: a branch and bound algorithm for the k-terminal cut problem
by Mark Velednitsky & Dorit S. Hochbaum - 1-21 Computing an $$L_1$$L1 shortest path among splinegonal obstacles in the plane
by Tameem Choudhury & R. Inkulu - 1-21 An improved mechanism for selfish bin packing
by Xin Chen & Qingqin Nong & Qizhi Fang - 1-21 Approximation algorithms for the maximally balanced connected graph tripartition problem
by Guangting Chen & Yong Chen & Zhi-Zhong Chen & Guohui Lin & Tian Liu & An Zhang - 1-22 Medical rolling bearing fault prognostics based on improved extreme learning machine
by Cheng He & Changchun Liu & Tao Wu & Ying Xu & Yang Wu & Tong Chen - 1-22 Truthful mechanism design for bin packing with applications on cloud computing
by Deshi Ye & Feng Xie & Guochuan Zhang - 1-22 A balm: defend the clique-based attack from a fundamental aspect
by Meng Han & Dongjing Miao & Jinbao Wang & Liyuan Liu - 1-22 On the approximability of Time Disjoint Walks
by Alexandre Bayen & Jesse Goodman & Eugene Vinitsky - 1-22 Approximation algorithms for constructing required subgraphs using stock pieces of fixed length
by Junran Lichen & Jianping Li & Ko-Wei Lih & Xingxing Yu - 1-22 Batch scheduling of nonidentical job sizes with minsum criteria
by Rongqi Li & Zhiyi Tan & Qianyu Zhu - 1-22 Robustly assigning unstable items
by Ananya Christman & Christine Chung & Nicholas Jaczko & Scott Westvold & David S. Yuen - 1-22 Risk prediction of hypertension complications based on the intelligent algorithm optimized Bayesian network
by Gang Du & Xi Liang & Xiaoling Ouyang & Chunming Wang - 1-22 Single machine batch scheduling with two non-disjoint agents and splitable jobs
by Zhichao Geng & Jiayu Liu - 1-23 Outpatient appointment scheduling problem considering patient selection behavior: data modeling and simulation optimization
by Xuanzhu Fan & Jiafu Tang & Chongjun Yan & Hainan Guo & Zhongfa Cao - 1-23 Online economic ordering problem for deteriorating items with limited price information
by Wenqiang Dai & Meng Zheng & Xu Chen & Zhuolin Yang - 1-23 Integer linear programming formulations of the filter partitioning minimization problem
by Hazhar Rahmani & Jason M. O’Kane - 1-23 Big data driven urban railway planning: Shenzhen metro case study
by Wen Xu & Caiwei Yuan & Keke Peng & Hongwei Du - 1-23 Tropical paths in vertex-colored graphs
by Johanne Cohen & Giuseppe F. Italiano & Yannis Manoussakis & Nguyen Kim Thang & Hong Phong Pham - 1-23 A spectral partitioning algorithm for maximum directed cut problem
by Zhenning Zhang & Donglei Du & Chenchen Wu & Dachuan Xu & Dongmei Zhang - 1-23 Multiprocessor open shop problem: literature review and future directions
by Zeynep Adak & Mahmure Övül Arıoğlu Akan & Serol Bulkan - 1-24 Maximizing a monotone non-submodular function under a knapsack constraint
by Zhenning Zhang & Bin Liu & Yishui Wang & Dachuan Xu & Dongmei Zhang - 1-24 Online traveling salesman problem with time cost and non-zealous server
by Tengyu Wu & Lin He & Haiyan Yu - 1-24 Crossing minimization in perturbed drawings
by Radoslav Fulek & Csaba D. Tóth - 1-24 A rapid learning automata-based approach for generalized minimum spanning tree problem
by Masoumeh Zojaji & Mohammad Reza Mollakhalili Meybodi & Kamal Mirzaie - 1-24 Personalized manufacturing service composition recommendation: combining combinatorial optimization and collaborative filtering
by Shuangyao Zhao & Qiang Zhang & Zhanglin Peng & Xiaonong Lu - 1-24 A multi-period ambulance location and allocation problem in the disaster
by Jian Wang & Yin Wang & Mingzhu Yu - 1-25 A sparse optimization problem with hybrid $$L_2{\text {-}}L_p$$L2-Lp regularization for application of magnetic resonance brain images
by Xuerui Gao & Yanqin Bai & Qian Li - 1-25 Algorithms for the metric ring star problem with fixed edge-cost ratio
by Xujin Chen & Xiaodong Hu & Xiaohua Jia & Zhongzheng Tang & Chenhao Wang & Ying Zhang - 1-26 Emergency medical center location problem with people evacuation solved by extended TODIM and objective programming
by Ling Gai & Zhiyue Peng & Jiming Zhang & Jiafu Zhang - 1-26 Selfish colorful bin packing games
by Vittorio Bilò & Francesco Cellinese & Giovanna Melideo & Gianpiero Monaco - 1-26 Eco-friendly container transshipment route scheduling problem with repacking operations
by Ming Liu & Rongfan Liu & E Zhang & Chengbin Chu - 1-26 Fast computation of global solutions to the single-period unit commitment problem
by Cheng Lu & Zhibin Deng & Shu-Cherng Fang & Qingwei Jin & Wenxun Xing - 1-28 A multi-objective and multi-period optimization model for urban healthcare waste’s reverse logistics network design
by Zhiguo Wang & Lufei Huang & Cici Xiao He - 1-28 The band collocation problem
by Hakan Kutucu & Arif Gursoy & Mehmet Kurt & Urfat Nuriyev - 1-29 Weighted thresholding homotopy method for sparsity constrained optimization
by Wenxing Zhu & Huating Huang & Lanfan Jiang & Jianli Chen - 1-29 Computing equilibrium in network utility-sharing and discrete election games
by Rahul Swamy & Timothy Murray - 1-30 A class of exponential neighbourhoods for the quadratic travelling salesman problem
by Brad D. Woods & Abraham P. Punnen - 1-31 Joint optimal pricing and advertising policies in a fashion supply chain under the ODM strategy considering fashion level and goodwill
by Qi Chen & Qi Xu - 1-32 Tighter price of anarchy for selfish task allocation on selfish machines
by Xiayan Cheng & Rongheng Li & Yunxia Zhou - 1-33 Searching and inferring colorful topological motifs in vertex-colored graphs
by Diego P. Rubert & Eloi Araujo & Marco A. Stefanes & Jens Stoye & Fábio V. Martinez - 1-33 Coordination mechanisms for scheduling selfish jobs with favorite machines
by Cong Chen & Yinfeng Xu - 1-34 Bipartite communities via spectral partitioning
by Kelly B. Yancey & Matthew P. Yancey - 1-34 The one-cop-moves game on planar graphs
by Ziyuan Gao & Boting Yang - 1-35 On theoretical and empirical algorithmic analysis of the efficiency gap measure in partisan gerrymandering
by Tanima Chatterjee & Bhaskar DasGupta & Laura Palmieri & Zainab Al-Qurashi & Anastasios Sidiropoulos - 1-37 A multi-objective simulated annealing to solve an identical parallel machine scheduling problem with deterioration effect and resources consumption constraints
by Norelhouda Sekkal & Fayçal Belkaid - 1-39 Shortest paths among transient obstacles
by Anil Maheshwari & Arash Nouri & Jörg-Rüdiger Sack - v::y::i::d:10.1007_s10878-006-8463-4 A robust genetic algorithm for rectangle packing problem
by De-Sheng Chen & Chang-Tzu Lin & Yi-Wen Wang - v::y::i::d:10.1007_s10878-006-8900-4 Journal of combinatorial optimization, special issue on communication networks and internet applications
by Maggie X. Cheng