Journal of Combinatorial Optimization, Volume 6

Volume 6, Number 1, March 2002

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

Volume 6, Number 2, June 2002

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

Volume 6, Number 3, September 2002

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

Volume 6, Number 4, December 2002

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

Last update Thu May 23 19:06:19 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page