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.

An efficient approach for large scale graph partitioning pp. 289-320: Renzo Zamprogno and André R. S. Amaral
Improved approximation algorithms for metric MaxTSP pp. 321-336: Zhi-Zhong Chen and Takayuki Nagoya
A best first search exact algorithm for the Multiple-choice Multidimensional Knapsack Problem pp. 337-351: Abdelkader Sbihi
Restricted domination parameters in graphs pp. 353-363: Wayne Goddard and Michael A. Henning
Total energy optimal multicasting in wireless ad hoc networks pp. 365-378: Manki Min and Panos M. Pardalos
Relative blocking in posets pp. 379-403: Andrey O. Matveev

Editorial, special issue on bioinformatics pp. 205-206: Binhai Zhu
Discovering classes in microarray data using island counts pp. 207-216: Brendan Mumey, Louise Showe and Michael Showe
A 2-approximation for the preceding-and-crossing structured 2-interval pattern problem pp. 217-221: Minghui Jiang
Fast algorithms for computing the tripartition-based distance between phylogenetic networks pp. 223-242: Nguyen Bao Nguyen, C. Thach Nguyen and Wing-Kin Sung
An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence pp. 243-262: Hiroki Arimura and Takeaki Uno
Improved algorithms for largest cardinality 2-interval pattern problem pp. 263-275: Erdong Chen, Linji Yang and Hao Yuan
Efficient algorithms for finding a longest common increasing subsequence pp. 277-288: Wun-Tat Chan, Yong Zhang, Stanley P. Y. Fung, Deshi Ye and Hong Zhu

On Ring Grooming in optical networks pp. 103-122: Gruia Călinescu and Peng-Jun Wan
Some inverse min-max network problems under weighted l 1 and l ∞ norms with bound constraints on changes pp. 123-135: Xiaoguang Yang and Jianzhong Zhang
Clustering and combinatorial optimization in recursive supervised learning pp. 137-152: Kiruthika Ramanathan and Sheng Uei Guan
Fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges pp. 153-162: Sun-Yuan Hsieh and Pei-Yu Yu
On edge orienting methods for graph coloring pp. 163-178: Bernard Gendron, Alain Hertz and Patrick St-Louis
RNA multiple structural alignment with longest common subsequences pp. 179-188: Sergey Bereg, Marcin Kubica, Tomasz Waleń and Binhai Zhu
On-line production order scheduling with preemption penalties pp. 189-204: Feifeng Zheng, Yinfeng Xu and E. Zhang

On the number of local minima for the multidimensional assignment problem pp. 1-18: Don A. Grundel, Pavlo A. Krokhmal, Carlos A. S. Oliveira and Panos M. Pardalos
Performance ratios of the Karmarkar-Karp differencing method pp. 19-32: Wil Michiels, Jan Korst, Emile Aarts and Jan van Leeuwen
A simple linear time approximation algorithm for multi-processor job scheduling on four processors pp. 33-45: Jingui Huang, Jianer Chen, Songqiao Chen and Jianxin Wang
Strong-mixed searching and pathwidth pp. 47-59: Boting Yang
Graphs with large paired-domination number pp. 61-78: Michael A. Henning
A multi-objective particle swarm for a flow shop scheduling problem pp. 79-102: A. R. Rahimi-Vahed and S. M. Mirghorbani

Editorial: In memoriam: Yong He (1969–2005) pp. 325-326: Guohui Lin and Zhiyi Tan
The web proxy location problem in general tree of rings networks pp. 327-336: Guangting Chen, Gu Zhang and Rainer E. Burkard
Scheduling with machine cost and rejection pp. 337-350: György Dósa and Yong He
The shortest path improvement problems under Hamming distance pp. 351-361: Binwu Zhang, Jianzhong Zhang and Liqun Qi
Separating online scheduling algorithms with the relative worst order ratio pp. 363-386: Leah Epstein, Lene M. Favrholdt and Jens S. Kohrt
A note on the complexity of the problem of two-agent scheduling on a single machine pp. 387-394: C. T. Ng, T. C. E. Cheng and J. J. Yuan
Inverse maximum flow problems under the weighted Hamming distance pp. 395-408: Longcheng Liu and Jianzhong Zhang
Dynamic-objective particle swarm optimization for constrained optimization problems pp. 409-419: Haiyan Lu and Weiqi Chen
Optimal algorithms for uncovering synteny problem pp. 421-432: Chen Ting and H. E. Yong

The fastest itinerary in time-dependent decentralized travel information systems pp. 167-185: Jinchang Wang and Thomas Kämpke
Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem pp. 187-215: Eranda Çela, Bettina Klinz and Christophe Meyer
Tree edge decomposition with an application to minimum ultrametric tree approximation pp. 217-230: Chia-Mao Huang, Bang Ye Wu and Chang-Biau Yang
Exact and heuristic algorithms for solving the generalized minimum filter placement problem pp. 231-256: E. Chisonge Mofya and J. Cole Smith
Penalty guided genetic search for redundancy optimization in multi-state series-parallel power system pp. 257-277: Rashika Gupta and Manju Agarwal
Optimal testing and repairing a failed series system pp. 279-295: Mikhail Y. Kovalyov, Marie-Claude Portmann and Ammar Oulamara
Construction of d(H)-disjunct matrix for group testing in hypergraphs pp. 297-301: Hong Gao, F. K. Hwang, My T. Thai, Weili Wu and Taieb Znati
Phased local search for the maximum clique problem pp. 303-323: Wayne Pullan

Minimum failure explanations for path vector routing changes pp. 5-16: Mohit Lad, Dan Massey, Adam Meyerson, Akash Nanavati and Lixia Zhang
Efficient algorithms for shared backup allocation in networks with partial information pp. 17-34: Yigal Bejerano, Joseph (Seffi) Naor and Alexander Sprintson
Resource allocation for restoration of compromised systems pp. 35-56: Qunwei Zheng, Sibabrata Ray and Xiaoyan Hong
Combinatorics of TCP reordering pp. 57-70: Anders Hansson, Gabriel Istrate and Shiva Prasad Kasiviswanathan
Optimization of loss-balanced multicast in all-optical WDM networks pp. 71-82: Yuan Cao and Oliver Yu
Finding disjoint paths with related path costs pp. 83-96: Randeep Bhatia, Murali Kodialam and T. V. Lakshman
Traffic engineering of tunnel-based networks with class specific diversity requirements pp. 97-125: Shekhar Srivastava and Deep Medhi
A New delay control method for real-time flows pp. 127-149: Weijia Jia, Hanxing Wang, Wanqing Tu and Wei Zhao
An adaptive algorithm for active queue management pp. 151-162: Chonggang Wang, Yu Lin, Kazem Sohraby and Bo Li