Journal of Combinatorial Optimization, Volume 7

Volume 7, Number 1, March 2003

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

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

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

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