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.

2008, volume 15, articles 4

The hierarchical model for load balancing on two machines pp. 305-314

Orion Chassid and Leah Epstein

An efficient generalized network-simplex-based algorithm for manufacturing network flows pp. 315-341

Prahalad Venkateshan, Kamlesh Mathur and Ronald H. Ballou

Partitioning a weighted partial order pp. 342-356

Linda S. Moonen and Frits C. R. Spieksma

Simplest optimal guillotine cutting patterns for strips of identical circles pp. 357-367

Yaodong Cui, Tianlong Gu and Wei Hu

A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries pp. 368-386

Niaz A. Wassan, A. Hameed Wassan and Gábor Nagy

Sublinear time width-bounded separators and their application to the protein side-chain packing problem pp. 387-407

Bin Fu and Zhixiang Chen

2008, volume 15, articles 3

Special Issue on Combinatorial Optimization in Data Mining pp. 223-224

Wanpracha Art Chaovalitwongse and Onur Seref

Novel quadratic programming approach for time series clustering with biomedical application pp. 225-241

Wanpracha Art Chaovalitwongse

Tracing ‘driver’ versus ‘modulator’ information flow throughout large-scale, task-related neural circuitry pp. 242-256

Linda Hermer-Vazquez

Shape analysis for automated sulcal classification and parcellation of MRI data pp. 257-275

Monica K. Hurdal, Juan B. Gutierrez, Christian Laing and Deborah A. Smith

Quantitative complexity analysis in multi-channel intracranial EEG recordings form epilepsy brains pp. 276-286

Chang-Chia Liu, Panos M. Pardalos, W. Art Chaovalitwongse, Deng-Shan Shiau, Georges Ghacibeh, Wichai Suharitdamrong and J. Chris Sackellares

A simulation tool for modeling the influence of anatomy on information flow using discrete integrate and fire neurons pp. 287-304

Maya Maimon and Larry Manevitz

2008, volume 15, articles 2

Designing k-coverage schedules in wireless sensor networks pp. 127-146

Yingshu Li and Shan Gao

Column generation approach for the point-feature cartographic label placement problem pp. 147-164

Glaydston Mattos Ribeiro and Luiz Antonio Nogueira Lorena

Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem pp. 165-178

Yannick Vimont, Sylvain Boussier and Michel Vasquez

An exponential (matching based) neighborhood for the vehicle routing problem pp. 179-190

Eric Angel, Evripidis Bampis and Fanny Pascual

On lazy bureaucrat scheduling with common deadlines pp. 191-199

Ling Gai and Guochuan Zhang

On the inapproximability of the exemplar conserved interval distance problem of genomes pp. 201-221

Zhixiang Chen, Richard H. Fowler, Bin Fu and Binhai Zhu

2008, volume 15, articles 1

Steiner systems for two-stage disjunctive testing pp. 1-6

Vladimir D. Tonchev

Hypothesis group testing for disjoint pairs pp. 7-16

Morgan A. Bishop, Anthony J. Macula, Thomas E. Renz and Vladimir V. Ufimtsev

Locating and detecting arrays for interaction faults pp. 17-48

Charles J. Colbourn and Daniel W. McClary

A survey on nonadaptive group testing algorithms through the angle of decoding pp. 49-59

Hong-Bin Chen and Frank K. Hwang

On a hyperplane arrangement problem and tighter analysis of an error-tolerant pooling design pp. 61-76

Hung Q. Ngo

New combinatorial structures with applications to efficient group testing with inhibitors pp. 77-94

Annalisa Bonis

Improved adaptive group testing algorithms with applications to multiple access channels and dead sensor diagnosis pp. 95-121

Michael T. Goodrich and Daniel S. Hirschberg

Improved construction for pooling design pp. 123-126

Ping Deng, F. K. Hwang, Weili Wu, David MacCallum, Feng Wang and Taieb Znati

2007, volume 14, articles 4

Maximally even sets and configurations: common threads in mathematics, physics, and music pp. 385-410

Jack Douthett and Richard Krantz

Monotonicity of strong searching on digraphs pp. 411-425

Boting Yang and Yi Cao

Online bin packing of fragile objects with application in cellular networks pp. 427-435

Wun-Tat Chan, Francis Y.-L. Chin, Deshi Ye, Guochuan Zhang and Yong Zhang

Approximation algorithms and hardness results for labeled connectivity problems pp. 437-453

Refael Hassin, Jérôme Monnot and Danny Segev

Maximum k-regular induced subgraphs pp. 455-463

Domingos M. Cardoso, Marcin Kamiński and Vadim Lozin

The densest k-subgraph problem on clique graphs pp. 465-474

Maria Liazi, Ioannis Milis, Fanny Pascual and Vassilis Zissimopoulos

A note on special optimal batching structures to minimize total weighted completion time pp. 475-480

Wenhua Li, Jinjiang Yuan and Yixun Lin

The wireless network jamming problem pp. 481-498

Clayton W. Commander, Panos M. Pardalos, Valeriy Ryabchenko, Stan Uryasev and Grigoriy Zrazhevsky

Journal of combinatorial optimization, special issue on communication networks and internet applications pp. 499-499

Maggie X. Cheng

A robust genetic algorithm for rectangle packing problem pp. 500-500

Chen De-Sheng, Chang-Tzu Lin and Yi-Wen Wang

2007, volume 14, articles 2

Editorial note pp. 111-112

Gerard J. Chang, Hung-Lin Fu and Xuding Zhu

Group testing in graphs pp. 113-119

Justie Su-tzu Juan and Gerard J. Chang

An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution pp. 121-129

H. B. Chen, D. Z. Du and F. K. Hwang

Optimal all-to-all personalized exchange in d-nary banyan multistage interconnection networks pp. 131-142

Victor W. Liu, Chiuyuan Chen and Richard B. Chen

Wide diameters of de Bruijn graphs pp. 143-152

Jyhmin Kuo and Hung-Lin Fu

The use of edge-directions and linear programming to enumerate vertices pp. 153-164

Shmuel Onn and Uriel G. Rothblum

An algorithm for optimal difference systems of sets pp. 165-175

Vladimir D. Tonchev and Hao Wang

Profile minimization on compositions of graphs pp. 177-190

Yu-Ping Tsao and Gerard J. Chang

Near automorphisms of trees with small total relative displacements pp. 191-195

Chia-Fen Chang and Hung-Lin Fu

Hamiltonicity of hypercubes with a constraint of required and faulty edges pp. 197-204

Lih-Hsing Hsu, Shu-Chung Liu and Yeong-Nan Yeh

Decomposition of K m,n into 4-cycles and 2t-cycles pp. 205-218

Chao-Chih Chou and Chin-Mei Fu

L(j,k)- and circular L(j,k)-labellings for the products of complete graphs pp. 219-227

Peter Che Bor Lam, Wensong Lin and Jianzhuan Wu

Transport schemes for topology-transparent scheduling pp. 229-248

Violet R. Syrotiuk, Zhiqiang Zhang and Charles J. Colbourn

Recent progress in mathematics and engineering on optimal graph labellings with distance conditions pp. 249-257

Jerrold R. Griggs and Xiaohua Teresa Jin

Decompositions of λ K v pp. 259-265

C. A. Rodger and S. K. Westbrook

Distance graphs on R n with 1-norm pp. 267-274

Jer-Jeong Chen and Gerard J. Chang

On cubic 2-independent Hamiltonian connected graphs pp. 275-294

Tung-Yang Ho, Chun-Nan Hung and Lih-Hsing Hsu

A study on cyclic bandwidth sum pp. 295-308

Ying-Da Chen and Jing-Ho Yan

Integer-magic spectra of sun graphs pp. 309-321

Wai Chee Shiu and Richard M. Low

Packing 5-cycles into balanced complete m-partite graphs for odd m pp. 323-329

Ming-Hway Huang, Chin-Mei Fu and Hung-Lin Fu

Characterizing the reconstruction and enumerating the patterns of DNA sequences with repeats pp. 331-347

Hsun-Wen Chang and Pei-Fang Tsai

On the equitable k *-laceability of hypercubes pp. 349-364

Chung-Haw Chang, Chao-Ming Sun, Hua-Min Huang and Lih-Hsing Hsu

Maximum cyclic 4-cycle packings of the complete multipartite graph pp. 365-382

Shung-Liang Wu and Hung-Lin Fu

Decomposition of K m,n into 4-cycles and 2t-cycles pp. 383-383

Chao-Chih Chou and Chin-Mei Fu

2007, volume 14, articles 1

Paired-domination in generalized claw-free graphs pp. 1-7

Paul Dorbec, Sylvain Gravier and Michael A. Henning

An immune algorithm with stochastic aging and kullback entropy for the chromatic number problem pp. 9-33

Vincenzo Cutello, Giuseppe Nicosia and Mario Pavone

Exact and heuristic algorithms for the circle cutting problem in the manufacturing industry of electric motors pp. 35-44

Yaodong Cui and Qiang Wang

Semi-online scheduling with “end of sequence” information pp. 45-61

Leah Epstein and Deshi Ye

Packing [1, Δ]-factors in graphs of small degree pp. 63-86

Adrian Kosowski, Michał Małafiejski and Paweł Żyliński

On the adjacent vertex-distinguishing total chromatic numbers of the graphs with Δ (G) = 3 pp. 87-109

Haiying Wang