Journal of Combinatorial Optimization

1997 - 2025

Current editor(s): Thai, My T.

From Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

Access Statistics for this journal.
Is something missing from the series or not right? See the RePEc data check for the archive and series.

2006, volume 11, articles 4

Some further results on minimum distribution cost flow problems pp. 351-371

Haiyan Lu, Enyu Yao and Liqun Qi

A “maximum node clustering” problem pp. 373-385

Giuliana Carello, Federico Della Croce, Andrea Grosso and Marco Locatelli

Inapproximability results for the lateral gene transfer problem pp. 387-405

Bhaskar Dasgupta, Sergio Ferrarini, Uthra Gopalakrishnan and Nisha Raj Paryani

Strongly 2-shape-sortability of vector partitions pp. 407-410

Huilan Chang and Junyi Guo

A combinatorial theorem on labeling squares with points and its application pp. 411-420

Binhai Zhu and Minghui Jiang

Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem pp. 421-434

Vicky Mak and Tommy Thomadsen

Construction of the nearest neighbor embracing graph of a point set pp. 435-443

M. Y. Chan, Danny Z. Chen, Francis Y. L. Chin and Cao An Wang

Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees pp. 445-454

Zemin Jin, Mikio Kano, Xueliang Li and Bing Wei

2006, volume 11, articles 3

When are two multivariate random processes indistinguishable pp. 263-278

Demetrios Kazakos and Sam Makki

Approximation hardness of edge dominating set problems pp. 279-290

Miroslav Chlebík and Janka Chlebíková

Efficient point coverage in wireless sensor networks pp. 291-304

Jie Wang and Ning Zhong

Min-energy voltage allocation for tree-structured tasks pp. 305-319

Minming Li, Becky Jie Liu and Frances F. Yao

One-dimensional optimal bounded-shape partitions for Schur convex sum objective functions pp. 321-339

F. H. Chang, H. B. Chen, J. Y. Guo, F. K. Hwang and Uriel G. Rothblum

Strengthened 0-1 linear formulation for the daily satellite mission planning pp. 341-346

Virginie Gabrel

2006, volume 11, articles 2

Introduction to the special issue pp. 131-131

Lusheng Wang

Genome rearrangements with partially ordered chromosomes pp. 133-144

Chunfang Zheng and David Sankoff

Opportunistic data structures for range queries pp. 145-154

Chung Keung Poon and Wai Keung Yiu

Finding longest increasing and common subsequences in streaming data pp. 155-175

David Liben-Nowell, Erik Vee and An Zhu

A dynamic programming approach of finding an optimal broadcast schedule in minimizing total flow time pp. 177-187

Wun-Tat Chan, Francis Y. L. Chin, Yong Zhang, Hong Zhu, Hong Shen and Prudence W. H. Wong

On zero error algorithms having oracle access to one query pp. 189-202

Jin-Yi Cai and Venkatesan T. Chakaravarthy

A PTAS for a disc covering problem using width-bounded separators pp. 203-217

Zhixiang Chen, Bin Fu, Yong Tang and Binhai Zhu

Inapproximability and approximability of maximal tree routing and coloring pp. 219-229

Xujin Chen, Xiaodong Hu and Tianping Shuai

On the computational hardness based on linear FPT-reductions pp. 231-247

Jianer Chen, Xiuzhen Huang, Iyad A. Kanj and Ge Xia

On optimal placement of relay nodes for reliable connectivity in wireless sensor networks pp. 249-260

Hai Liu, Pengjun Wan and Xiaohua Jia

2006, volume 11, articles 1

Editorial pp. 5-6

Maggie X. Cheng

Energy conservation through resource-aware movement in heterogeneous mobile ad hoc networks pp. 7-20

Wei Liu, Yanchao Zhang, Yuguang Fang and Kejie Lu

Coverage by directional sensors in randomly deployed wireless sensor networks pp. 21-41

Jing Ai and Alhussein A. Abouzeid

Multiple objective optimization of bluetooth scatternets pp. 43-57

L. E. Hodge, R. M. Whitaker and S. Hurley

Optimal solutions to minimum total energy broadcasting problem in wireless ad hoc networks pp. 59-69

Manki Min, Oleg Prokopyev and Panos M. Pardalos

Reliable Ad Hoc Routing Based on Mobility Prediction pp. 71-85

Jian Tang, Guoliang Xue and Weiyi Zhang

An online distributed gossiping protocol for mobile networks pp. 87-97

Zhengnan Shi and Pradip K. Srimani

Minimum power assignment in wireless ad hoc networks with spanner property pp. 99-112

Yu Wang and Xiang-Yang Li

Data relaying with constraints in hierarchical sensor networks pp. 113-123

Robert Benkoczi, Hossam Hassanein, Selim Akl and Sylvia Tai

Erratum pp. 125-125

T. Ekim and D. Werra

2005, volume 10, articles 4

A Note on Balancedness of Dominating Set Games pp. 303-310

Qizhi Fang and Hye Kyung Kim

A Hybrid Genetic—GRASP Algorithm Using Lagrangean Relaxation for the Traveling Salesman Problem pp. 311-326

Yannis Marinakis, Athanasios Migdalas and Panos M. Pardalos

Ant Colony System for a Dynamic Vehicle Routing Problem pp. 327-343

R. Montemanni, L. M. Gambardella, A. E. Rizzoli and A. V. Donati

Preemptive Machine Covering on Parallel Machines pp. 345-363

Yiwei Jiang, Zhiyi Tan and Yong He

The Wheels of the Orthogonal Latin Squares Polytope: Classification and Valid Inequalities pp. 365-389

G. Appa, D. Magos and I. Mourtos

An Approximation for Minimum Multicast Route in Optical Networks with Nonsplitting Nodes pp. 391-394

Longjiang Guo, Weili Wu, Feng Wang and My Thai

2005, volume 10, articles 3

On Split-Coloring Problems pp. 211-225

T. Ekim and D. Werra

Efficient Solutions for Special Zero-One Programming Problems pp. 227-238

Ariela Bilitzky and Arik Sadeh

Sensitivity of the Optimum to Perturbations of the Profit or Weight of an Item in the Binary Knapsack Problem pp. 239-260

Mhand Hifi, Hedi Mhalla and Slim Sadfi

Testing Systems of Identical Components pp. 261-282

Tonguç Ünlüyurt

Vertices Contained in all or in no Minimum Paired-Dominating Set of a Tree pp. 283-294

Michael A. Henning and Michael D. Plummer

2005, volume 10, articles 2

Maximizing Profits of Routing in WDM Networks pp. 99-111

Jianping Li, Kang Li, Lusheng Wang and Hao Zhao

Efficient Algorithms for Determining 3-D Bi-Plane Imaging Geometry pp. 113-132

Jinhui Xu, Guang Xu, Zhenming Chen, Vikas Singh and Kenneth R. Hoffmann

Improved Approximation Algorithms for Maximum Graph Partitioning Problems pp. 133-167

Gerold Jäger and Anand Srivastav

Penta-Extensions of Hereditary Classes of Graphs pp. 169-178

Igor E. Zverovich and Inessa I. Zverovich

Efficient Job Scheduling Algorithms with Multi-Type Contentions pp. 179-197

Zhenming Chen, Vikas Singh and Jinhui Xu

A Note on Optical Network with Nonsplitting Nodes pp. 199-202

Hongwei Du, Xiaohua Jia, Feng Wang, My Thai and Yingshu Li

2005, volume 10, articles 1

Editorial pp. 5-5

Panos M. Pardalos

Feature Selection for Consistent Biclustering via Fractional 0–1 Programming pp. 7-21

Stanislav Busygin, Oleg A. Prokopyev and Panos M. Pardalos

Novel Approaches for Analyzing Biological Networks pp. 23-39

Balabhaskar Balasundaram, Sergiy Butenko and Svyatoslav Trukhanov

Computational Comparison Studies of Quadratic Assignment Like Formulations for the In Silico Sequence Selection Problem in De Novo Protein Design pp. 41-60

H. K. Fung, S. Rao, C. A. Floudas, O. Prokopyev, P. M. Pardalos and F. Rendl

An Algorithm for the Maximum Likelihood Problem on Evolutionary Trees pp. 61-75

Carlos A. S. Oliveira

Clustering of Microarray data via Clique Partitioning pp. 77-92

Gary Kochenberger, Fred Glover, Bahram Alidaee and Haibo Wang