Journal of Combinatorial Optimization, Volume 13

Volume 13, Number 1, January 2007

• Don A. Grundel, Pavlo A. Krokhmal, Carlos A. S. Oliveira, Panos M. Pardalos:
  On the number of local minima for the multidimensional assignment problem. 1-18
  
• Wil Michiels, Jan H. M. Korst, Emile H. L. Aarts, Jan van Leeuwen:
  Performance ratios of the Karmarkar-Karp differencing method. 19-32
  
• Jingui Huang, Jianer Chen, Songqiao Chen, Jianxin Wang:
  A simple linear time approximation algorithm for multi-processor job scheduling on four processors. 33-45
  
• Boting Yang:
  Strong-mixed searching and pathwidth. 47-59
  
• Michael A. Henning:
  Graphs with large paired-domination number. 61-78
  
• Alireza Rahimi-Vahed, S. M. Mirghorbani:
  A multi-objective particle swarm for a flow shop scheduling problem. 79-102
  

Volume 13, Number 2, February 2007

• Gruia Calinescu, Peng-Jun Wan:
  On Ring Grooming in optical networks. 103-122
  
• Xiaoguang Yang, Jianzhong Zhang:
  Some inverse min-max network problems under weighted l₁ and l_infinity norms with bound constraints on changes. 123-135
  
• Kiruthika Ramanathan, Sheng Uei Guan:
  Clustering and combinatorial optimization in recursive supervised learning. 137-152
  
• Sun-Yuan Hsieh, Pei-Yu Yu:
  Fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges. 153-162
  
• Bernard Gendron, Alain Hertz, Patrick St-Louis:
  On edge orienting methods for graph coloring. 163-178
  
• Sergey Bereg, Marcin Kubica, Tomasz Walen, Binhai Zhu:
  RNA multiple structural alignment with longest common subsequences. 179-188
  
• Feifeng Zheng, Yinfeng Xu, E. Zhang:
  On-line production order scheduling with preemption penalties. 189-204
  

Volume 13, Number 3, April 2007

• Binhai Zhu:
  Editorial, special issue on bioinformatics. 205-206
  
• Brendan Mumey, Louise C. Showe, Michael K. Showe:
  Discovering classes in microarray data using island counts. 207-216
  
• Minghui Jiang:
  A 2-approximation for the preceding-and-crossing structured 2-interval pattern problem. 217-221
  
• Nguyen Bao Nguyen, C. Thach Nguyen, Wing-Kin Sung:
  Fast algorithms for computing the tripartition-based distance between phylogenetic networks. 223-242
  
• Hiroki Arimura, Takeaki Uno:
  An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence. 243-262
  
• Erdong Chen, Linji Yang, Hao Yuan:
  Improved algorithms for largest cardinality 2-interval pattern problem. 263-275
  
• Wun-Tat Chan, Yong Zhang, Stanley P. Y. Fung, Deshi Ye, Hong Zhu:
  Efficient algorithms for finding a longest common increasing subsequence. 277-288
  

Volume 13, Number 4, May 2007

• Renzo Zamprogno, André R. S. Amaral:
  An efficient approach for large scale graph partitioning. 289-320
  
• Zhi-Zhong Chen, Takayuki Nagoya:
  Improved approximation algorithms for metric MaxTSP. 321-336
  
• Abdelkader Sbihi:
  A best first search exact algorithm for the Multiple-choice Multidimensional Knapsack Problem. 337-351
  
• Wayne Goddard, Michael A. Henning:
  Restricted domination parameters in graphs. 353-363
  
• Manki Min, Panos M. Pardalos:
  Total energy optimal multicasting in wireless ad hoc networks. 365-378
  
• Andrey O. Matveev:
  Relative blocking in posets. 379-403
  

Last update Wed Feb 15 04:40:15 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page