Journal of Combinatorial Optimization

1997 - 2025

Current editor(s): Thai, My T.

From Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

Access Statistics for this journal.
Is something missing from the series or not right? See the RePEc data check for the archive and series.

1997, volume 1, articles 3

Editorial pp. 209-210

Gang Yu

A Grasp for Aircraft Routing in Response to Groundings and Delays pp. 211-228

Michael F. Argüello, Jonathan F. Bard and Gang Yu

Quelling Cabin Noise in Turboprop Aircraft via Active Control pp. 229-250

Rex K. Kincaid, Keith E. Laba and Sharon L. Padula

Decision Support for Airline Schedule Planning pp. 251-275

Dennis F.X. Mathaisel

Using Prices More Realistically as Decision Variables in Perishable-Asset Revenue Management Problems pp. 277-304

Lawrence R. Weatherford

Optimization Model and Algorithm for Crew Management During Airline Irregular Operations pp. 305-321

Guo Wei, Gang Yu and Mark Song

1997, volume 1, articles 2

A New Subgraph of Minimum Weight Triangulations pp. 115-127

Cao An Wang, Francis Chin and Yin-Feng Xu

Scheduling Problems in a Practical Allocation Model pp. 129-149

Lisa Hollermann, Tsan-sheng Hsu, Dian Rae Lopez and Keith Vertanen

Local Optimality and Its Application on Independent Sets for k-claw Free Graphs pp. 151-164

Gang Yu and Olivier Goldschmidt

On Integer Programming Approaches for Morphological Template Decomposition Problems in Computer Vision pp. 165-178

P. Sussner, P.M. Pardalos and G.X. Ritter

Near-Optimal Conflict-Free Channel Set Assignments for an Optical Cluster-Based Hypercube Network pp. 179-186

Peng-Jun Wan

Efficient Detection and Protection of Information in Cross Tabulated Tables II: Minimal Linear Invariants pp. 187-202

Ming-Yang Kao

1997, volume 1, articles 1

Deterministic Õ(nm) Time Edge-Splitting in Undirected Graphs pp. 5-46

Hiroshi Nagamochi and Toshihide Ibaraki

New Approximation Algorithms for the Steiner Tree Problems pp. 47-65

Marek Karpinski and Alexander Zelikovsky

Compression Theorems and Steiner Ratios on Spheres pp. 67-78

J. H. Rubinstein and J. F. Weng

Moments of Inertia and Graph Separators pp. 79-104

Keith D. Gremban, Gary L. Miller and Shang-Hua Teng

Book Review: Discrete Analysis and operation Research pp. 105-105

Ding-Zhu Du

Undated

A class of exponential neighbourhoods for the quadratic travelling salesman problem pp. 1-30

Brad D. Woods and Abraham P. Punnen

Online traveling salesman problem with time cost and non-zealous server pp. 1-24

Tengyu Wu, Lin He and Haiyan Yu

Crossing minimization in perturbed drawings pp. 1-24

Radoslav Fulek and Csaba D. Tóth

A rapid learning automata-based approach for generalized minimum spanning tree problem pp. 1-24

Masoumeh Zojaji, Mohammad Reza Mollakhalili Meybodi and Kamal Mirzaie

A multi-period ambulance location and allocation problem in the disaster pp. 1-24

Jian Wang, Yin Wang and Mingzhu Yu

Personalized manufacturing service composition recommendation: combining combinatorial optimization and collaborative filtering pp. 1-24

Shuangyao Zhao, Qiang Zhang, Zhanglin Peng and Xiaonong Lu

Maximizing a monotone non-submodular function under a knapsack constraint pp. 1-24

Zhenning Zhang, Bin Liu, Yishui Wang, Dachuan Xu and Dongmei Zhang

Improved algorithms for single vehicle scheduling on tree/cycle networks pp. 1-16

Yuanxiao Wu and Xiwen Lu

Improved algorithms for ranking and unranking (k, m)-ary trees in B-order pp. 1-16

Yu-Hsuan Chang, Ro-Yu Wu, Ruay-Shiung Chang and Jou-Ming Chang

Research on model and algorithm of TCM constitution identification based on artificial intelligence pp. 1-16

Bin Li, Qianghua Wei and Xinye Zhou

From packing rules to cost-sharing mechanisms pp. 1-16

Chenhao Zhang and Guochuan Zhang

Randomized selection algorithm for online stochastic unrelated machines scheduling pp. 1-16

Xiaoyan Zhang, Ran Ma, Jian Sun and Zan-Bo Zhang

General restricted inverse assignment problems under $$l_1$$l1 and $$l_\infty $$l∞ norms pp. 1-16

Qin Wang, Tianyu Yang and Longshu Wu

Average eccentricity, minimum degree and maximum degree in graphs pp. 1-16

P. Dankelmann and F. J. Osaye

A general framework for path convexities pp. 1-16

João Vinicius C. Thompson, Loana T. Nogueira, Fábio Protti, Raquel S. F. Bravo, Mitre C. Dourado and Uéverton S. Souza

Max–min dispersion on a line pp. 1-7

Tetsuya Araki and Shin-ichi Nakano

The one-cop-moves game on planar graphs pp. 1-34

Ziyuan Gao and Boting Yang

Bipartite communities via spectral partitioning pp. 1-34

Kelly B. Yancey and Matthew P. Yancey

The spectral radius and domination number in linear uniform hypergraphs pp. 1-12

Liying Kang, Wei Zhang and Erfang Shan

An intelligent data-driven model for disease diagnosis based on machine learning theory pp. 1-12

He Huang, Wei Gao and Chunming Ye

Perceived service quality’s effect on patient loyalty through patient attitude within the context of traditional Chinese medicine pp. 1-12

Hongbo Li, Li Wang, Xuan Xia and Hongbo Liu

The bi-criteria seeding algorithms for two variants of k-means problem pp. 1-12

Min Li

Computation and algorithm for the minimum k-edge-connectivity of graphs pp. 1-12

Yuefang Sun, Chenchen Wu, Xiaoyan Zhang and Zhao Zhang

An approximation algorithm for the uniform capacitated k-means problem pp. 1-12

Lu Han, Dachuan Xu, Donglei Du and Dongmei Zhang

A tight approximation algorithm for problem $$P2\rightarrow D|v=1,c=1|C_{\max }$$P2→D|v=1,c=1|Cmax pp. 1-12

Yinling Wang, Yan Lan, Xin Chen, Xin Han and Yong Piao

On the complexity and approximability of repair position selection problem pp. 1-19

Xianmin Liu, Yingshu Li, Jianzhong Li and Yuqiang Feng

An improved algorithm for the $$(n, 3)$$ ( n, 3 ) -MaxSAT problem: asking branchings to satisfy the clauses pp. 1-19

Chao Xu, Wenjun Li, Jianxin Wang and Yongjie Yang

Energy-efficient weak-barrier coverage with adaptive sensor rotation pp. 1-19

Catalina Aranzazu-Suescun and Mihaela Cardei

Early warning of venous thromboembolism after surgery based on self-organizing competitive network pp. 1-19

Shi Yin, Jian Chang, Hailan Pan, Haizhou Mao and Mei Wang

On weak Pareto optimality of nonatomic routing networks pp. 1-19

Xujin Chen, Zhuo Diao and Xiaodong Hu

Exact algorithms for finding constrained minimum spanning trees pp. 1-19

Pei Yao and Longkun Guo

The price of fairness for a two-agent scheduling game minimizing total completion time pp. 1-19

Yubai Zhang, Zhao Zhang and Zhaohui Liu

Power domination on triangular grids with triangular and hexagonal shape pp. 1-19

Prosenjit Bose, Valentin Gledel, Claire Pennarun and Sander Verdonschot

The complexity of total edge domination and some related results on trees pp. 1-19

Zhuo Pan, Yu Yang, Xianyue Li and Shou-Jun Xu

More on limited packings in graphs pp. 1-19

Xuqing Bai, Hong Chang and Xueliang Li

The effects of price subsidy and fairness concern on pricing and benefits of take-away supply chain pp. 1-19

Hui Zhang, Kai Luo and Guanqun Ni

On the price of anarchy of two-stage machine scheduling games pp. 1-20

Deshi Ye, Lin Chen and Guochuan Zhang

The new treatment mode research of hepatitis B based on ant colony algorithm pp. 1-20

Jing Yu, Lining Xing and Xu Tan

An approximation algorithm for the maximum spectral subgraph problem pp. 1-20

Cristina Bazgan, Paul Beaujean and Éric Gourdin

Atomic congestion games with random players: network equilibrium and the price of anarchy pp. 1-20

Chenlan Wang, Xuan Vinh Doan and Bo Chen

A completely positive formulation of the graph isomorphism problem and its positive semidefinite relaxation pp. 1-20

Pawan Aurora and Shashank K. Mehta

Maximum weight induced matching in some subclasses of bipartite graphs pp. 1-20

B. S. Panda, Arti Pandey, Juhi Chaudhary, Piyush Dane and Manav Kashyap

Approximation algorithms for two variants of correlation clustering problem pp. 1-20

Sai Ji, Dachuan Xu, Min Li and Yishui Wang

Online pickup and delivery problem with constrained capacity to minimize latency pp. 1-20

Haiyan Yu, Xianwei Luo and Tengyu Wu

Three-sided matching problem with mixed preferences pp. 1-9

Feng Zhang and Liwei Zhong

A multi-objective and multi-period optimization model for urban healthcare waste’s reverse logistics network design pp. 1-28

Zhiguo Wang, Lufei Huang and Cici Xiao He

The band collocation problem pp. 1-28

Hakan Kutucu, Arif Gursoy, Mehmet Kurt and Urfat Nuriyev

Mixed connectivity properties of random graphs and some special graphs pp. 1-15

Ran Gu, Yongtang Shi and Neng Fan

Approximation approach for robust vessel fleet deployment problem with ambiguous demands pp. 1-15

E. Zhang, Feng Chu, Shijin Wang, Ming Liu and Yang Sui

A multi-objective simulated annealing to solve an identical parallel machine scheduling problem with deterioration effect and resources consumption constraints pp. 1-37

Norelhouda Sekkal and Fayçal Belkaid

Searching and inferring colorful topological motifs in vertex-colored graphs pp. 1-33

Diego P. Rubert, Eloi Araujo, Marco A. Stefanes, Jens Stoye and Fábio V. Martinez

Coordination mechanisms for scheduling selfish jobs with favorite machines pp. 1-33

Cong Chen and Yinfeng Xu

An improved mechanism for selfish bin packing pp. 1-21

Xin Chen, Qingqin Nong and Qizhi Fang

Computing an $$L_1$$L1 shortest path among splinegonal obstacles in the plane pp. 1-21

Tameem Choudhury and R. Inkulu

Isolation branching: a branch and bound algorithm for the k-terminal cut problem pp. 1-21

Mark Velednitsky and Dorit S. Hochbaum

Approximation algorithms for the maximally balanced connected graph tripartition problem pp. 1-21

Guangting Chen, Yong Chen, Zhi-Zhong Chen, Guohui Lin, Tian Liu and An Zhang

Reconfiguration of garbage collection system based on Voronoi graph theory: a simulation case of Beijing region pp. 1-21

Chun-lin Xin, Shuo Liang and Feng-wu Shen

Preface: Combinatorial optimization drives the future of Health Care pp. 1-2

Liwei Zhong and Guochun Tang

A spectral partitioning algorithm for maximum directed cut problem pp. 1-23

Zhenning Zhang, Donglei Du, Chenchen Wu, Dachuan Xu and Dongmei Zhang

Tropical paths in vertex-colored graphs pp. 1-23

Johanne Cohen, Giuseppe F. Italiano, Yannis Manoussakis, Nguyen Kim Thang and Hong Phong Pham

Big data driven urban railway planning: Shenzhen metro case study pp. 1-23

Wen Xu, Caiwei Yuan, Keke Peng and Hongwei Du

Outpatient appointment scheduling problem considering patient selection behavior: data modeling and simulation optimization pp. 1-23

Xuanzhu Fan, Jiafu Tang, Chongjun Yan, Hainan Guo and Zhongfa Cao

Multiprocessor open shop problem: literature review and future directions pp. 1-23

Zeynep Adak, Mahmure Övül Arıoğlu Akan and Serol Bulkan

Online economic ordering problem for deteriorating items with limited price information pp. 1-23

Wenqiang Dai, Meng Zheng, Xu Chen and Zhuolin Yang

Integer linear programming formulations of the filter partitioning minimization problem pp. 1-23

Hazhar Rahmani and Jason M. O’Kane

Joint optimal pricing and advertising policies in a fashion supply chain under the ODM strategy considering fashion level and goodwill pp. 1-31

Qi Chen and Qi Xu

Bottleneck subset-type restricted matching problems pp. 1-10

Oleg Duginov

Computing equilibrium in network utility-sharing and discrete election games pp. 1-29

Rahul Swamy and Timothy Murray

Weighted thresholding homotopy method for sparsity constrained optimization pp. 1-29

Wenxing Zhu, Huating Huang, Lanfan Jiang and Jianli Chen

Batch scheduling of nonidentical job sizes with minsum criteria pp. 1-22

Rongqi Li, Zhiyi Tan and Qianyu Zhu

Risk prediction of hypertension complications based on the intelligent algorithm optimized Bayesian network pp. 1-22

Gang Du, Xi Liang, Xiaoling Ouyang and Chunming Wang

Medical rolling bearing fault prognostics based on improved extreme learning machine pp. 1-22

Cheng He, Changchun Liu, Tao Wu, Ying Xu, Yang Wu and Tong Chen

Robustly assigning unstable items pp. 1-22

Ananya Christman, Christine Chung, Nicholas Jaczko, Scott Westvold and David S. Yuen

On the approximability of Time Disjoint Walks pp. 1-22

Alexandre Bayen, Jesse Goodman and Eugene Vinitsky

A balm: defend the clique-based attack from a fundamental aspect pp. 1-22

Meng Han, Dongjing Miao, Jinbao Wang and Liyuan Liu

Approximation algorithms for constructing required subgraphs using stock pieces of fixed length pp. 1-22

Junran Lichen, Jianping Li, Ko-Wei Lih and Xingxing Yu

Truthful mechanism design for bin packing with applications on cloud computing pp. 1-22

Deshi Ye, Feng Xie and Guochuan Zhang

Single machine batch scheduling with two non-disjoint agents and splitable jobs pp. 1-22

Zhichao Geng and Jiayu Liu

Tighter price of anarchy for selfish task allocation on selfish machines pp. 1-32

Xiayan Cheng, Rongheng Li and Yunxia Zhou

Fast computation of global solutions to the single-period unit commitment problem pp. 1-26

Cheng Lu, Zhibin Deng, Shu-Cherng Fang, Qingwei Jin and Wenxun Xing

Emergency medical center location problem with people evacuation solved by extended TODIM and objective programming pp. 1-26

Ling Gai, Zhiyue Peng, Jiming Zhang and Jiafu Zhang

Selfish colorful bin packing games pp. 1-26

Vittorio Bilò, Francesco Cellinese, Giovanna Melideo and Gianpiero Monaco

Eco-friendly container transshipment route scheduling problem with repacking operations pp. 1-26

Ming Liu, Rongfan Liu, E Zhang and Chengbin Chu

Conflict-free connection of trees pp. 1-14

Hong Chang, Meng Ji, Xueliang Li and Jingshu Zhang

Shortest paths among transient obstacles pp. 1-39

Anil Maheshwari, Arash Nouri and Jörg-Rüdiger Sack

On theoretical and empirical algorithmic analysis of the efficiency gap measure in partisan gerrymandering pp. 1-35

Tanima Chatterjee, Bhaskar DasGupta, Laura Palmieri, Zainab Al-Qurashi and Anastasios Sidiropoulos

On the complexity of and algorithms for detecting k-length negative cost cycles pp. 1-13

Longkun Guo and Peng Li

A three-stage supply chain scheduling problem based on the nursing assistants’ daily work in a hospital pp. 1-13

Jing Fan and Hui Shi

An approximation algorithm for stochastic multi-level facility location problem with soft capacities pp. 1-13

Chenchen Wu, Donglei Du and Yue Kang

Online scheduling on a single machine with linear deteriorating processing times and delivery times pp. 1-13

Xing Chai, Wenhua Li, Hang Yuan and Libo Wang

Combinatorial approximation algorithms for the submodular multicut problem in trees with submodular penalties pp. 1-13

Xiaofei Liu and Weidong Li

An approximation algorithm for a supply-chain scheduling problem with an assignable common due window and holding time pp. 1-13

Long Zhang, Yuzhong Zhang and Qingguo Bai

Approximation algorithms for the selling with preference pp. 1-13

Pan Li, Qiang Hua, Zhijun Hu, Hing-Fung Ting and Yong Zhang

An improved linear convergence of FISTA for the LASSO problem with application to CT image reconstruction pp. 1-17

Qian Li and Wei Zhang

Related machine scheduling with machine speeds satisfying linear constraints pp. 1-17

Siyun Zhang, Kameng Nip and Zhenbo Wang

Analysis of consensus sorting via the cycle metric pp. 1-17

Ivan Avramovic and Dana S. Richards

Due date assignment and two-agent scheduling under multitasking environment pp. 1-17

Yongjian Yang, Guangqiang Yin, Chunyu Wang and Yunqiang Yin

Parameterized algorithms and complexity for the traveling purchaser problem and its variants pp. 1-17

Mingyu Xiao, Jianan Zhang and Weibo Lin

Complexity and characterization aspects of edge-related domination for graphs pp. 1-17

Zhuo Pan, Xianyue Li and Shou-Jun Xu

Fitting PB1-p62 filaments model structure into its electron microscopy based on an improved genetic algorithm pp. 1-11

Zhihong Zhao, Beibei Li and Jun Liu

Research of SVM ensembles in medical examination scheduling pp. 1-11

Yi Du, Hua Yu and Zhijun Li

An optimized approach of venous thrombus embolism risk assessment pp. 1-11

Ruiping Wang, Mei Wang, Jian Chang, Zai Luo, Feng Zhang and Chen Huang

Capacitated vehicle routing problem on line with unsplittable demands pp. 1-11

Yuanxiao Wu and Xiwen Lu

A primal-dual algorithm for the minimum power partial cover problem pp. 1-11

Menghong Li, Yingli Ran and Zhao Zhang

Algorithmic aspect on the minimum (weighted) doubly resolving set problem of graphs pp. 1-11

Changhong Lu, Qingjie Ye and Chengru Zhu

On the Roman domination subdivision number of a graph pp. 1-11

J. Amjadi, R. Khoeilar, M. Chellali and Z. Shao

Algorithms for the metric ring star problem with fixed edge-cost ratio pp. 1-25

Xujin Chen, Xiaodong Hu, Xiaohua Jia, Zhongzheng Tang, Chenhao Wang and Ying Zhang

A sparse optimization problem with hybrid $$L_2{\text {-}}L_p$$L2-Lp regularization for application of magnetic resonance brain images pp. 1-25

Xuerui Gao, Yanqin Bai and Qian Li

A dynamic approach to detecting, eliminating and fixing memory leaks pp. 1-18

Bin Yu, Cong Tian, Nan Zhang, Zhenhua Duan and Hongwei Du

Medical consumable usage control based on Canopy_K-means clustering and WARM pp. 1-18

Ying Yang, Huijing Wu and Caixia Yan

Improved gray neural network model for healthcare waste recycling forecasting pp. 1-18

Hao Hao, Ji Zhang, Qian Zhang, Li Yao and Yichen Sun

A novel kernel-free nonlinear SVM for semi-supervised classification in disease diagnosis pp. 1-18

Xin Yan, Hongmiao Zhu and Jian Luo

Research on dispatch of drugs and consumables in SPD warehouse of large scale hospital under uncertain environment: take respiratory consumables as an example pp. 1-18

Huidan Lin, Qun Li, Xueguo Xu and Ying Zhang

Path optimization for joint distribution of medical consumables under hospital SPD supply chain mode pp. 1-18

Gengjun Gao, Yuxuan Che and Jian Shen

The seeding algorithm for spherical k-means clustering with penalties pp. 1-18

Sai Ji, Dachuan Xu, Longkun Guo, Min Li and Dongmei Zhang

The principal eigenvector to $$\alpha $$α-spectral radius of hypergraphs pp. 1-18

Jing Wang, Liying Kang and Erfang Shan

Journal of combinatorial optimization, special issue on communication networks and internet applications

Maggie X. Cheng

A robust genetic algorithm for rectangle packing problem

Chen De-Sheng, Chang-Tzu Lin and Yi-Wen Wang