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.

A Combinatorial Algorithm for Minimum Weighted Colorings of Claw-Free Perfect Graphs pp. 331-347: Xueliang Li and Wenan Zang
An Improved Approximation Algorithm for Multicast k-Tree Routing pp. 349-356: Guohui Lin
The 2-Edge-Connected Subgraph Polyhedron pp. 357-379: Dieter Vandenbussche and George L. Nemhauser
Robotic-Cell Scheduling: Special Polynomially Solvable Cases of the Traveling Salesman Problem on Permuted Monge Matrices pp. 381-399: Vladimir G. Deineko, George Steiner and Zhihui Xue
An Improved Randomized Approximation Algorithm for Max TSP pp. 401-432: Zhi-Zhong Chen and Lusheng Wang

On Approximation Ratios of Minimum-Energy Multicast Routing in Wireless Networks pp. 243-262: Hongxu Cai and Yingchao Zhao
On 3-Stage Clos Networks with Different Nonblocking Requirements on Two Types of Calls pp. 263-266: Hung-Lin Fu and Frank K. Hwang
Perfect Circular Arc Coloring pp. 267-280: Xujin Chen, Zhiquan Hu and Wenan Zang
The Polymatroid Steiner Problems pp. 281-294: G. Calinescu and A. Zelikovsky
On the Hardness of Approximating the Min-Hack Problem pp. 295-311: Ramkumar Chinchani, Duc Ha, Anusha Iyer, Hung Q. Ngo and Shambhu Upadhyaya
A Framework for the Complexity of High-Multiplicity Scheduling Problems pp. 313-323: N. Brauner, Y. Crama, A. Grigoriev and J. Klundert

Finding a Length-Constrained Maximum-Density Path in a Tree pp. 147-156: Rung-Ren Lin, Wen-Hsiung Kuo and Kun-Mao Chao
A Tighter Extra-Resource Analysis of Online Deadline Scheduling pp. 157-165: Tak-Wah Lam, Tusen-Wan Johnny Ngan and Kar-Keung To
On-Line Scheduling Algorithms for a Batch Machine with Finite Capacity pp. 167-186: Chung Keung Poon and Wenci Yu
The Center Location Improvement Problem Under the Hamming Distance pp. 187-198: Binwu Zhang, Jianzhong Zhang and Yong He
Clustering Binary Oligonucleotide Fingerprint Vectors for DNA Clone Classification Analysis pp. 199-211: Zhipeng Cai, Maysam Heydari and Guohui Lin
Power Assignment for k-Connectivity in Wireless Ad Hoc Networks pp. 213-222: Xiaohua Jia, Dongsoo Kim, Sam Makki, Peng-Jun Wan and Chih-Wei Yi
Broadcast Routing with Minimum Wavelength Conversion in WDM Optical Networks pp. 223-235: Lu Ruan and Weili Wu

A PTAS for Semiconductor Burn-in Scheduling pp. 5-17: Xiaotie Deng, Haodi Feng, Guojun Li and Benyun Shi
Average-Case Performance Analysis of a 2D Strip Packing Algorithm—NFDH pp. 19-34: Xiaodong Gu, Guoliang Chen and Yinlong Xu
Requiring Connectivity in the Set Covering Problem pp. 35-47: J. Orestes Cerdeira and Leonor S. Pinto
Scheduling in Switching Networks with Set-Up Delays pp. 49-57: Foto Afrati, Timos Aslanidis, Evripidis Bampis and Ioannis Milis
Separating Type-I Odd-Cycle Inequalities for a Binary-Encoded Edge-Coloring Formulation pp. 59-67: Jon Lee, Janny Leung and Sven Vries
Efficient Algorithms and Implementations for Optimizing the Sum of Linear Fractional Functions, with Applications pp. 69-90: Danny Z. Chen, Ovidiu Daescu, Yang Dai, Naoki Katoh, Xiaodong Wu and Jinhui Xu
Weighted Inverse Minimum Spanning Tree Problems Under Hamming Distance pp. 91-100: Yong He, Binwu Zhang and Enyu Yao
Two Variations of the Minimum Steiner Problem pp. 101-120: Tsan-Sheng Hsu, Kuo-Hui Tsai, Da-Wei Wang and D. T. Lee
Order Consolidation for Batch Processing pp. 121-138: Hark-Chin Hwang and Soo Y. Chang

Protein Threading by Linear Programming: Theoretical Analysis and Computational Results pp. 403-418: Jinbo Xu, Ming Li and Ying Xu
A Novel Evolutionary Formulation of the Maximum Independent Set Problem pp. 419-437: Valmir C. Barbosa and Luciana C. D. Campos
On Combinatorial Approximation of Covering 0-1 Integer Programs and Partial Set Cover pp. 439-452: Toshihiro Fujito
The Minimal Spanning Tree Preservation Approaches for DNA Multiple Sequence Alignment and Evolutionary Tree Construction pp. 453-468: Shyong Jian Shyu, Yin Te Tsai and R.C.T. Lee
From Linear to Semidefinite Programming: An Algorithm to Obtain Semidefinite Relaxations for Bivalent Quadratic Problems pp. 469-493: Frédéric Roupin
Minimum ε-equivalent Circuit Size Problem pp. 495-502: Oleg A. Prokopyev and Panos M. Pardalos

Equal Processing Time Bicriteria Scheduling on Parallel Machines pp. 227-240: Subhash C. Sarin and Divya Prakash
Minimal Tetrahedralizations of a Class of Polyhedra pp. 241-265: Boting Yang and Cao An Wang
On Approximate Graph Colouring and MAX-k-CUT Algorithms Based on the θ-Function pp. 267-294: E. de Klerk, D.V. Pasechnik and J.P. Warners
Vertex and Tree Arboricities of Graphs pp. 295-306: Gerard J. Chang, Chiuyuan Chen and Yaping Chen
Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee pp. 307-328: A.A. Ageev and M.I. Sviridenko
Inverse Combinatorial Optimization: A Survey on Problems, Methods, and Results pp. 329-361: Clemens Heuberger
Models and Bounds for Two-Dimensional Level Packing Problems pp. 363-379: Andrea Lodi, Silvano Martello and Daniele Vigo
Even Cycles and Perfect Matching Problems with Side Constraints pp. 381-396: Elena Fernández and Oscar Meza

Logical Constraints as Cardinality Rules: Tight Representation pp. 115-128: Egon Balas
On Approximability of Boolean Formula Minimization pp. 129-135: Oleg A. Prokopyev and Panos M. Pardalos
Batch-Processing Scheduling with Setup Times pp. 137-146: Chuangyin Dang and Liying Kang
Comments on the Paper: Attacking the Market Split Problem with Lattice Point Enumeration pp. 147-149: Karen Aardal
b-Tree Facets for the Simple Graph Partitioning Polytope pp. 151-170: Michael M. Sørensen
Wide Diameters of Cartesian Product Graphs and Digraphs pp. 171-181: Jun-Ming Xu
A Further Improved Approximation Algorithm for Breakpoint Graph Decomposition pp. 183-194: Guohui Lin and Tao Jiang
A Multi-Exchange Neighborhood for Minimum Makespan Parallel Machine Scheduling Problems pp. 195-220: Antonio Frangioni, Emiliano Necciari and Maria Grazia Scutellà

Improved Dynamic Programming in Connection with an FPTAS for the Knapsack Problem pp. 5-11: Hans Kellerer and Ulrich Pferschy
Flow Shop Scheduling Problems Under Machine–Dependent Precedence Constraints pp. 13-28: A.A. Gladky, Y.M. Shafransky and V.A. Strusevich
Constructing the Maximum Consensus Tree from Rooted Triples pp. 29-39: Bang Ye Wu
Two Novel Evolutionary Formulations of the Graph Coloring Problem pp. 41-63: Valmir C. Barbosa, Carlos A.G. Assis and Josina O. Do Nascimento
Dynamic Programming and Hill-Climbing Techniques for Constrained Two-Dimensional Cutting Stock Problems pp. 65-84: Mhand Hifi
On-Line Scheduling a Batch Processing System to Minimize Total Weighted Job Completion Time pp. 85-95: Bo Chen, Xiaotie Deng and Wenan Zang
Algorithm for the Cost Edge-Coloring of Trees pp. 97-108: Xiao Zhou and Takao Nishizeki