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
  
• Adar A. Kalir, Subhash C. Sarin:
  Constructing Near Optimal Schedules for the Flow-Shop Lot Streaming Problem with Sublot-Attached Setups. 23-44
  
• 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
  
• Ming-Yang Kao, Jared Samet, Wing-Kin Sung:
  The Enhanced Double Digest Problem for DNA Physical Mapping. 69-78
  
• Chiuyuan Chen:
  Any Maximal Planar Graph with Only One Separating Triangle is Hamiltonian. 79-86
  
• Michel Vasquez, Jin-Kao Hao:
  Upper Bounds for the SPOT 5 Daily Photograph Scheduling Problem. 87-103
  

Volume 7, Number 2, June 2003

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

Volume 7, Number 3, September 2003

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

Volume 7, Number 4, December 2003

• Frank K. Hwang, Wen-Dar Lin:
  The Incremental Group Testing Model for Gap Closing in Sequencing Long Molecules. 327-337
  
• Frank K. Hwang, Y. C. Liu:
  Random Pooling Designs Under Various Structures. 339-352
  
• Yusheng Li, Wenan Zang:
  The Independence Number of Graphs with a Forbidden Cycle and Ramsey Numbers. 353-359
  
• Anthony J. Macula:
  Trivial Two-Stage Group Testing with High Error Rates. 361-368
  
• 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
  
• Tayuan Huang, Chih-wen Weng:
  A Note on Decoding of Superimposed Codes. 381-384
  
• Weili Wu, Chungui Li, Xiaoyu Wu, Xiao Huang:
  Decoding in Pooling Designs. 385-388
  
• Haesun Park, Weili Wu, Zhen Liu, Xiaoyu Wu, Hong G. Zhao:
  DNA Screening, Pooling Design and Simplicial Complex. 389-394