


default search action
Journal of Combinatorial Optimization, Volume 9
Volume 9, Number 1, February 2005
- Xiaotie Deng

, Haodi Feng, Guojun Li, Benyun Shi:
A PTAS for Semiconductor Burn-in Scheduling. 5-17 - Xiaodong Gu, Guoliang Chen, Yinlong Xu:

Average-Case Performance Analysis of a 2D Strip Packing Algorithm-NFDH. 19-34 - J. Orestes Cerdeira

, Leonor Santiago Pinto
:
Requiring Connectivity in the Set Covering Problem. 35-47 - Foto N. Afrati, Timos Aslanidis, Evripidis Bampis, Ioannis Milis:

Scheduling in Switching Networks with Set-Up Delays. 49-57 - Jon Lee

, Janny Leung
, Sven de Vries:
Separating Type-I Odd-Cycle Inequalities for a Binary-Encoded Edge-Coloring Formulation. 59-67 - Danny Z. Chen, Ovidiu Daescu, Yang Dai, Naoki Katoh, Xiaodong Wu, Jinhui Xu:

Efficient Algorithms and Implementations for Optimizing the Sum of Linear Fractional Functions, with Applications. 69-90 - Yong He, Binwu Zhang, Enyu Yao:

Weighted Inverse Minimum Spanning Tree Problems Under Hamming Distance. 91-100 - Tsan-sheng Hsu, Kuo-Hui Tsai, Da-Wei Wang, D. T. Lee:

Two Variations of the Minimum Steiner Problem. 101-120 - Hark-Chin Hwang, Soo Y. Chang:

Order Consolidation for Batch Processing. 121-138
Volume 9, Number 2, March 2005
- Rung-Ren Lin, Wen-Hsiung Kuo, Kun-Mao Chao

:
Finding a Length-Constrained Maximum-Density Path in a Tree. 147-156 - Tak Wah Lam

, Tsuen-Wan Ngan, Kar-Keung To:
A Tighter Extra-Resource Analysis of Online Deadline Scheduling. 157-165 - Chung Keung Poon

, Wenci Yu:
On-Line Scheduling Algorithms for a Batch Machine with Finite Capacity. 167-186 - Binwu Zhang, Jianzhong Zhang, Yong He:

The Center Location Improvement Problem Under the Hamming Distance. 187-198 - Zhipeng Cai, Maysam Heydari, Guohui Lin:

Clustering Binary Oligonucleotide Fingerprint Vectors for DNA Clone Classification Analysis. 199-211 - Xiaohua Jia

, Dongsoo Kim, Sam Makki, Peng-Jun Wan, Chih-Wei Yi
:
Power Assignment for k-Connectivity in Wireless Ad Hoc Networks. 213-222 - Lu Ruan, Weili Wu:

Broadcast Routing with Minimum Wavelength Conversion in WDM Optical Networks. 223-235
Volume 9, Number 3, May 2005
- Hongxu Cai, Yingchao Zhao

:
On Approximation Ratios of Minimum-Energy Multicast Routing in Wireless Networks. 243-262 - Hung-Lin Fu, Frank K. Hwang:

On 3-Stage Clos Networks with Different Nonblocking Requirements on Two Types of Calls. 263-266 - Xujin Chen, Zhiquan Hu, Wenan Zang:

Perfect Circular Arc Coloring. 267-280 - Gruia Calinescu

, Alexander Zelikovsky
:
The Polymatroid Steiner Problems. 281-294 - Ramkumar Chinchani, Duc T. Ha, Anusha Iyer, Hung Q. Ngo, Shambhu J. Upadhyaya:

On the Hardness of Approximating the Min-Hack Problem. 295-311 - Nadia Brauner, Yves Crama

, Alexander Grigoriev
, Joris van de Klundert
:
A Framework for the Complexity of High-Multiplicity Scheduling Problems. 313-323
Volume 9, Number 4, June 2005
- Xueliang Li, Wenan Zang:

A Combinatorial Algorithm for Minimum Weighted Colorings of Claw-Free Perfect Graphs. 331-347 - Guohui Lin:

An Improved Approximation Algorithm for Multicast k-Tree Routing. 349-356 - Dieter Vandenbussche, George L. Nemhauser:

The 2-Edge-Connected Subgraph Polyhedron. 357-379 - Vladimir G. Deineko, George Steiner, Zhihui Xue:

Robotic-Cell Scheduling: Special Polynomially Solvable Cases of the Traveling Salesman Problem on Permuted Monge Matrices. 381-399 - Zhi-Zhong Chen, Lusheng Wang

:
An Improved Randomized Approximation Algorithm for Max TSP. 401-432

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














