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.

Practical Human-Machine Identification over Insecure Channels pp. 347-361: Xiang-Yang Li and Shang-Hua Teng
An Approximation Scheme for Bin Packing with Conflicts pp. 363-377: Klaus Jansen
Hybrid Evolutionary Algorithms for Graph Coloring pp. 379-397: Philippe Galinier and Jin-Kao Hao
Randomized Online Scheduling with Delivery Times pp. 399-416: Steve Seiden
Transversal Graphs for Partially Ordered Sets: Sequencing, Merging and Scheduling Problems pp. 417-435: Martin Middendorf and Vadim G. Timkovsky
Close Approximations of Minimum Rectangular Coverings pp. 437-452: Joachim Gudmundsson and Christos Levcopoulos
Packing of Unequal Spheres and Automated Radiosurgical Treatment Planning pp. 453-463: Jie Wang
Inverse Problems of Matroid Intersection pp. 465-474: Cai Mao-Cheng

Foreword pp. 147-148: Ying Xu, Saturo Miyano and Tom Head
On the Tightness of the Alternating-Cycle Lower Bound for Sorting by Reversals pp. 149-182: Alberto Caprara
On the Complexity of Constructing Evolutionary Trees pp. 183-197: Leszek Gasieniec, Jesper Jansson, Andrzej Lingas and Anna Östlin
Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance Matrices pp. 199-211: Bang Ye Wu, Kun-Mao Chao and Chuan Yi Tang
Fitting Distances by Tree Metrics with Increment Error pp. 213-225: Bin Ma, Lusheng Wang and Louxin Zhang
Aligning DNA Sequences to Minimize the Change in Protein pp. 227-245: Yufang Hua, Tao Jiang and Bin Wu
An Approximation Algorithm for Alignment of Multiple Sequences using Motif Discovery pp. 247-275: Laxmi Parida, Aris Floratos and Isidore Rigoutsos
Horn Clause Computation with DNA Molecules pp. 277-299: Satoshi Kobayashi
Combinatorial Optimization in Rapidly Mutating Drug-Resistant Viruses pp. 301-320: Richard H. Lathrop and Michael J. Pazzani
Approximation and Exact Algorithms for RNA Secondary Structure Prediction and Recognition of Stochastic Context-free Languages pp. 321-336: Tatsuya Akutsu

Minimizing the Number of Late Jobs under the Group Technology Assumption pp. 5-15: Zhaohui Liu and Wenci Yu
Reduction of the Three-Partition Problem pp. 17-30: Mauro Dell'Amico and Silvano Martello
A Probabilistic Analysis of the Capacitated Facility Location Problem pp. 31-50: Nanda Piersma
The Steiner Tree Problem in Kalmanson Matrices and in Circulant Matrices pp. 51-58: Bettina Klinz and Gerhard J. Woeginger
A New Fully Polynomial Time Approximation Scheme for the Knapsack Problem pp. 59-71: Hans Kellerer and Ulrich Pferschy
Analysis of the List Scheduling Algorithm for Precedence Constrained Parallel Tasks pp. 73-88: Keqin Li
A Note on the Max-Min 0-1 Knapsack Problem pp. 89-94: Hiroshi Iida
Analyses on the 2 and 3-Flip Neighborhoods for the MAX SAT pp. 95-114: M. Yagiura and T. Ibaraki
Inverse Polymatroidal Flow Problem pp. 115-126: Mao-Cheng Cai, Xiaoguang Yang and Yanjun Li
Solution Structure of Some Inverse Combinatorial Optimization Problems pp. 127-139: Jianzhong Zhang and Zhongfan Ma

A Two-Phase Exact Algorithm for MAX-SAT and Weighted MAX-SAT Problems pp. 299-306: Brian Borchers and Judith Furman
Structure Prediction and Computation of Sparse Matrix Products pp. 307-332: Edith Cohen
The Travelling Salesman Problem on Permuted Monge Matrices pp. 333-350: Rainer E. Burkard, Vladimir G. Deineko and Gerhard J. Woeginger
Simple and Efficient Graph Compression Schemes for Dense and Complement Graphs pp. 351-359: Ming-Yang Kao, Neill Occhiogrosso and Shang-Hua Teng
Constant-Level Greedy Triangulations Approximate the MWT Well pp. 361-369: Oswin Aichholzer, Franz Aurenhammer, Günter Rote and Yin-Feng Xu
Generalized Diameters and Rabin Numbers of Networks pp. 371-384: Sheng-Chyang Liaw and Gerard J. Chang
Probabilistic Nonadaptive and Two-Stage Group Testing with Relatively Small Pools and DNA Library Screening pp. 385-397: Anthony J. Macula
A Greedy Randomized Adaptive Search Procedure for the Feedback Vertex Set Problem pp. 399-412: Panos M. Pardalos, Tianbing Qian and Mauricio G.C. Resende
Sortabilities of Partition Properties pp. 413-427: Gerard J. Chang, Fu-Loong Chen, Lingling Huang, Frank K. Hwang, Su-Tzu Nuan, Uriel G. Rothblum, I-Fan Sun, Jan-Wen Wang and Hong-Gwa Yeh
Localizing Combinatorial Properties for Partitions on Block Graphs pp. 429-441: G. J. Chang, F. K. Hwang and Y. C. Yao

Facility Location with Dynamic Distance Functions pp. 199-217: Randeep Bhatia, Sudipto Guha, Samir Khuller and Yoram J. Sussmann
A Case Study of De-randomization Methods for Combinatorial Approximation Algorithms pp. 219-236: José D.P. Rolim and Luca Trevisan
A Unifying Augmentation Algorithm for Two-Edge Connectivity and Biconnectivity pp. 237-256: Tsan-sheng Hsu and Ming-Yang Kao
Approximation Algorithms for Certain Network Improvement Problems pp. 257-288: Sven O. Krumke, Madhav V. Marathe, Hartmut Noltemeier, R. Ravi and S. S. Ravi

Proof of Toft's Conjecture: Every Graph Containing No Fully Odd K4 is 3-Colorable pp. 117-188: Wenan Zang

Preface pp. 7-7: P.M. Pardalos and H. Wolkowicz
A Combined D.C. Optimization—Ellipsoidal Branch-and-Bound Algorithm for Solving Nonconvex Quadratic Programming Problems pp. 9-28: Le Thi Hoai An, Pham Dinh Tao and Le Dung Muu
Approximation Algorithms for Quadratic Programming pp. 29-50: Minyue Fu, Zhi-Quan Luo and Yinyu Ye
Polynomial Primal-Dual Affine Scaling Algorithms in Semidefinite Programming pp. 51-69: E. de Klerk, C. Roos and T. Terlaky
Semidefinite Programming Relaxations for the Quadratic Assignment Problem pp. 71-109: Qing Zhao, Stefan E. Karisch, Franz Rendl and Henry Wolkowicz

Job Shop Scheduling With Deadlines pp. 329-353: Egon Balas, Giuseppe Lancia, Paolo Serafini and Alkiviadis Vazacopoulos
On-Line Scheduling of Two-Machine Open Shops Where Jobs Arrive Over Time pp. 355-365: Bo Chen, Arjen P.A. Vestjens and Gerhard J. Woeginger
Efficient Algorithms for a Scheduling Problem and its Applications to Illicit Drug Market Crackdowns pp. 367-376: Pu Cai, Jin-yi Cai and Ashish V. Naik
On Multiprocessor System Scheduling pp. 377-392: Xiaotie Deng and Patrick Dymond
Optimal On-Line Scheduling of Parallel Jobs with Dependencies pp. 393-411: Anja Feldmann, Ming-Yang Kao, Jiří Sgall and Shang-Hua Teng
Improved Bounds on Relaxations of a Parallel Machine Scheduling Problem pp. 413-426: Cynthia A. Phillips, Andreas S. Schulz, David B. Shmoys, Cliff Stein and Joel Wein
Optimal Randomized Scheduling by Replacement pp. 427-456: Isaac Saias
Closed-Form Deterministic End-to-End Performance Bounds for the Generalized Processor Sharing Scheduling Discipline pp. 457-481: Zhi-Li Zhang, Zhen Liu and Don Towsley