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.

The Incremental Group Testing Model for Gap Closing in Sequencing Long Molecules pp. 327-337: Frank K. Hwang and Wen-Dar Lin
Random Pooling Designs Under Various Structures pp. 339-352: F.K. Hwang and Y.C. Liu
The Independence Number of Graphs with a Forbidden Cycle and Ramsey Numbers pp. 353-359: Yusheng Li and Wenan Zang
Trivial Two-Stage Group Testing with High Error Rates pp. 361-368: Anthony J. Macula
Exordium for DNA Codes pp. 369-379: Arkadii G. D'yachkov, Peter L. Erdös, Anthony J. Macula, Vyacheslav V. Rykov, David C. Torney, Chang-Shung Tung, Pavel A. Vilenkin and P. Scott White
A Note on Decoding of Superimposed Codes pp. 381-384: Tayuan Huang and Chih-Wen Weng
Decoding in Pooling Designs pp. 385-388: Weili Wu, Chungui Li, Xiaoyu Wu and Xiao Huang
DNA Screening, Pooling Design and Simplicial Complex pp. 389-394: Haesun Park, Weili Wu, Zhen Liu, Xiaoyu Wu and Hong G. Zhao

On Inverse Problems of Optimum Perfect Matching pp. 215-228: Zhenhong Liu and Jianzhong Zhang
Genetic Algorithm for Graph Coloring: Exploration of Galinier and Hao's Algorithm pp. 229-236: Celia A. Glass and Adam Prügel-Bennett
A Tight Semidefinite Relaxation of the MAX CUT Problem pp. 237-245: Hongwei Liu, Sanyang Liu and Fengmin Xu
Approximation Algorithms in Batch Processing pp. 247-257: Xiaotie Deng, Chung Keung Poon and Yuzhong Zhang
Solving Steiner Tree Problems in Graphs with Lagrangian Relaxation pp. 259-282: Laura Bahiense, Francisco Barahona and Oscar Porto
Necessary Edges in k-Chordalisations of Graphs pp. 283-290: Hans L. Bodlaender
The Flow Shop Scheduling Polyhedron with Setup Times pp. 291-318: Roger Z. Ríos-Mercado and Jonathan F. Bard

Computing Optimal Beams in Two and Three Dimensions pp. 111-136: Danny Z. Chen, Xiaobo (Sharon) Hu and Jinhui Xu
An Edge-Splitting Algorithm in Planar Graphs pp. 137-159: Hiroshi Nagamochi and Peter Eades
Zero-Lifting for Integer Block Structured Problems pp. 161-167: Giovanni Felici and Claudio Gentile
Cropped Cubes pp. 169-178: Jon Lee
GRASP with a New Local Search Scheme for Vehicle Routing Problems with Time Windows pp. 179-207: Wanpracha Chaovalitwongse, Dukwon Kim and Panos M. Pardalos

Iterative Converging Algorithms for Computing Bounds on Durations of Activities in Pert and Pert-Like Models pp. 5-22: Eugene Shragowitz, Habib Youssef and Bing Lu
Constructing Near Optimal Schedules for the Flow-Shop Lot Streaming Problem with Sublot-Attached Setups pp. 23-44: Adar A. Kalir and Subhash C. Sarin
Fast On-Line/Off-Line Algorithms for Optimal Reinforcement of a Network and its Connections with Principal Partition pp. 45-68: Sachin B. Patkar and H. Narayanan
The Enhanced Double Digest Problem for DNA Physical Mapping pp. 69-78: Ming-Yang Kao, Jared Samet and Wing-Kin Sung
Any Maximal Planar Graph with Only One Separating Triangle is Hamiltonian pp. 79-86: Chiuyuan Chen
Upper Bounds for the SPOT 5 Daily Photograph Scheduling Problem pp. 87-103: Michel Vasquez and Jin-Kao Hao

Composition of Graphs and the Triangle-Free Subgraph Polytope pp. 359-381: F. Bendali, A.R. Mahjoub and J. Mailfert
Center and Distinguisher for Strings with Unbounded Alphabet pp. 383-400: Xiaotie Deng, Guojun Li and Lusheng Wang
Resolution Search and Dynamic Branch-and-Bound pp. 401-423: Saïd Hanafi and Fred Glover
Traffic Partition in WDM/SONET Rings to Minimize SONET ADMs pp. 425-453: Gruia Călinescu and Peng-Jun Wan
Performance Analysis and Improvement for Some Linear On-Line Bin-Packing Algorithms pp. 455-471: Xiaodong Gu, Guoliang Chen, Jun Gu, Liusheng Huang and Yunjae Jung

Preface pp. 235-236: Panos M. Pardalos and Henry Wolkowicz
Geometry of Semidefinite Max-Cut Relaxations via Matrix Ranks pp. 237-270: Miguel F. Anjos and Henry Wolkowicz
A Novel Eigenvector Technique for Large Scale Combinatorial Problems in VLSI Layout pp. 271-286: Laleh Behjat, Dorothy Kucar and Anthony Vannelli
A Heuristic for the Maximum Independent Set Problem Based on Optimization of a Quadratic Over a Sphere pp. 287-297: Stanislav Busygin, Sergiy Butenko and Panos M. Pardalos
A Genetic Algorithm for the Weight Setting Problem in OSPF Routing pp. 299-333: M. Ericsson, M.G.C. Resende and P.M. Pardalos
All-Different Polytopes pp. 335-352: Jon Lee

A Parametric Approach for a Nonlinear Discrete Location Problem pp. 119-132: J. Sun and Y. Gu
Simplicial Pivoting Algorithms for a Tractable Class of Integer Programs pp. 133-142: H. Van Maaren and C. Dang
Approximating the Independence Number and the Chromatic Number in Expected Polynomial Time pp. 143-155: Michael Krivelevich and Vu Van H.
Improved Approximation for Breakpoint Graph Decomposition and Sorting by Reversals pp. 157-182: Alberto Caprara and Romeo Rizzi
The Structural Birnbaum Importance of Consecutive-k Systems pp. 183-197: Hsun-Wen Chang, R.J. Chen and F.K. Hwang
Ordinal On-Line Scheduling for Maximizing the Minimum Machine Completion Time pp. 199-206: Yong He and Zhiyi Tan
A General Model of Some Inverse Combinatorial Optimization Problems and Its Solution Method Under l ∞ Norm pp. 207-227: Jianzhong Zhang and Zhenhong Liu

Attacking the Market Split Problem with Lattice Point Enumeration pp. 5-16: Alfred Wassermann
On the Robust Single Machine Scheduling Problem pp. 17-33: Jian Yang and Gang Yu
The Knapsack Sharing Problem: An Exact Algorithm pp. 35-54: Mhand Hifi and Slim Sadfi
A Simulated Annealing Approach to Communication Network Design pp. 55-65: Marcus Randall, Graham McMahon and Stephen Sugden
3-Partitioning Problems for Maximizing the Minimum Load pp. 67-80: Shi Ping Chen, Yong He and Guohui Lin
A Tabu Search Heuristic for the Location of Multi-Type Protection Devices on Electrical Supply Tree Networks pp. 81-98: J.C. James and S. Salhi
New Approximation Algorithms for Map Labeling with Sliding Labels pp. 99-110: Binhai Zhu and Z.P. Qin