Journal of Combinatorial Optimization, Volume 10

Volume 10, Number 1, August 2005

• Panos M. Pardalos:
  Editorial. 5-5
  Electronic Edition (link) BibTeX
• Stanislav Busygin, Oleg A. Prokopyev, Panos M. Pardalos:
  Feature Selection for Consistent Biclustering via Fractional 0-1 Programming. 7-21
  Electronic Edition (link) BibTeX
• Balabhaskar Balasundaram, Sergiy Butenko, Svyatoslav Trukhanov:
  Novel Approaches for Analyzing Biological Networks. 23-39
  Electronic Edition (link) BibTeX
• Ho Ki Fung, S. Rao, Christodoulos A. Floudas, Oleg A. Prokopyev, Panos M. Pardalos, F. Rendl:
  Computational Comparison Studies of Quadratic Assignment Like Formulations for the In Silico Sequence Selection Problem in De Novo Protein Design. 41-60
  Electronic Edition (link) BibTeX
• Carlos A. S. Oliveira:
  An Algorithm for the Maximum Likelihood Problem on Evolutionary Trees. 61-75
  Electronic Edition (link) BibTeX
• Gary A. Kochenberger, Fred Glover, Bahram Alidaee, Haibo Wang:
  Clustering of Microarray data via Clique Partitioning. 77-92
  Electronic Edition (link) BibTeX

Volume 10, Number 2, September 2005

• Jianping Li, Kang Li, Lusheng Wang, Hao Zhao:
  Maximizing Profits of Routing in WDM Networks. 99-111
  Electronic Edition (link) BibTeX
• Jinhui Xu, Guang Xu, Zhenming Chen, Vikas Singh, Kenneth R. Hoffmann:
  Efficient Algorithms for Determining 3-D Bi-Plane Imaging Geometry. 113-132
  Electronic Edition (link) BibTeX
• Gerold Jäger, Anand Srivastav:
  Improved Approximation Algorithms for Maximum Graph Partitioning Problems. 133-167
  Electronic Edition (link) BibTeX
• Igor E. Zverovich, Inessa I. Zverovich:
  Penta-Extensions of Hereditary Classes of Graphs. 169-178
  Electronic Edition (link) BibTeX
• Zhenming Chen, Vikas Singh, Jinhui Xu:
  Efficient Job Scheduling Algorithms with Multi-Type Contentions. 179-197
  Electronic Edition (link) BibTeX
• Hongwei Du, Xiaohua Jia, Feng Wang, My T. Thai, Yingshu Li:
  A Note on Optical Network with Nonsplitting Nodes. 199-202
  Electronic Edition (link) BibTeX

Volume 10, Number 3, November 2005

• Tinaz Ekim, Dominique de Werra:
  On Split-Coloring Problems. 211-225
  Electronic Edition (link) BibTeX
• Ariela Bilitzky, Arik Sadeh:
  Efficient Solutions for Special Zero-One Programming Problems. 227-238
  Electronic Edition (link) BibTeX
• Mhand Hifi, Hedi M'Halla, Slim Sadfi:
  Sensitivity of the Optimum to Perturbations of the Profit or Weight of an Item in the Binary Knapsack Problem. 239-260
  Electronic Edition (link) BibTeX
• Tonguç Ünlüyurt:
  Testing Systems of Identical Components. 261-282
  Electronic Edition (link) BibTeX
• Michael D. Henning, Michael D. Plummer:
  Vertices Contained in all or in no Minimum Paired-Dominating Set of a Tree. 283-294
  Electronic Edition (link) BibTeX

Volume 10, Number 4, December 2005

• Qizhi Fang, Hye Kyung Kim:
  A Note on Balancedness of Dominating Set Games. 303-310
  Electronic Edition (link) BibTeX
• Yannis Marinakis, Athanasios Migdalas, Panos M. Pardalos:
  A Hybrid Genetic-GRASP Algorithm Using Lagrangean Relaxation for the Traveling Salesman Problem. 311-326
  Electronic Edition (link) BibTeX
• Roberto Montemanni, Luca Maria Gambardella, Andrea Emilio Rizzoli, Alberto V. Donati:
  Ant Colony System for a Dynamic Vehicle Routing Problem. 327-343
  Electronic Edition (link) BibTeX
• Yiwei Jiang, Zhiyi Tan, Yong He:
  Preemptive Machine Covering on Parallel Machines. 345-363
  Electronic Edition (link) BibTeX
• Gautam Appa, Dimitris Magos, Ioannis Mourtos:
  The Wheels of the Orthogonal Latin Squares Polytope: Classification and Valid Inequalities. 365-389
  Electronic Edition (link) BibTeX
• Longjiang Guo, Weili Wu, Feng Wang, My T. Thai:
  An Approximation for Minimum Multicast Route in Optical Networks with Nonsplitting Nodes. 391-394
  Electronic Edition (link) BibTeX