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.

2009, volume 17, articles 4

A successive approximation algorithm for the multiple knapsack problem pp. 347-366

Zhenbo Wang and Wenxun Xing

Optimal st-orientations for plane triangulations pp. 367-377

Huaming Zhang and Xin He

Standard directed search strategies and their applications pp. 378-399

Boting Yang and Yi Cao

Analytic evaluation of the expectation and variance of different performance measures of a schedule on a single machine under processing time variability pp. 400-416

Subhash C. Sarin, Balaji Nagarajan, Sanjay Jain and Lingrui Liao

A note on online strip packing pp. 417-423

Deshi Ye, Xin Han and Guochuan Zhang

An improved approximation algorithm for uncapacitated facility location problem with penalties pp. 424-436

Guang Xu and Jinhui Xu

2009, volume 17, articles 3

Finding an anti-risk path between two nodes in undirected graphs pp. 235-246

Peng Xiao, Yinfeng Xu and Bing Su

Traffic regulation with single- and dual-homed ISPs under a percentile-based pricing policy pp. 247-273

Jianping Wang, Jing Chen, Mei Yang and S. Q. Zheng

Probabilistic graph-coloring in bipartite and split graphs pp. 274-311

N. Bourgeois, F. Della Croce, B. Escoffier, C. Murat and V. Th. Paschos

A note on fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges pp. 312-322

Tz-Liang Kueng, Cheng-Kuan Lin, Tyne Liang, Jimmy J. M. Tan and Lih-Hsing Hsu

Single machine batch scheduling with release times pp. 323-338

Beat Gfeller, Leon Peeters, Birgitta Weber and Peter Widmayer

Two new error-correcting pooling designs from d-bounded distance-regular graphs pp. 339-345

Xinlu Zhang, Jun Guo and Suogang Gao

2009, volume 17, articles 2

Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval pp. 117-133

Imed Kacem

Multiple phase neighborhood Search—GRASP based on Lagrangean relaxation, random backtracking Lin–Kernighan and path relinking for the TSP pp. 134-156

Yannis Marinakis, Athanasios Migdalas and Panos M. Pardalos

Exact solution method to solve large scale integer quadratic multidimensional knapsack problems pp. 157-167

D. Quadri, E. Soutif and P. Tolla

Lower bounds and a tabu search algorithm for the minimum deficiency problem pp. 168-191

Mathieu Bouchard, Alain Hertz and Guy Desaulniers

Path packing and a related optimization problem pp. 192-205

Natalia Vanetik

A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times pp. 206-213

Jinjiang Yuan, Shisheng Li, Ji Tian and Ruyan Fu

An extension of the relaxation algorithm for solving a special case of capacitated arc routing problems pp. 214-234

Saman Eskandarzadeh, Reza Tavakkoli-Moghaddam and Amir Azaron

2009, volume 17, articles 1

Guest Editorial pp. 1-2

Onur Şeref and Petros Xanthopoulos

Selective support vector machines pp. 3-20

Onur Seref, O. Erhun Kundakcioglu, Oleg A. Prokopyev and Panos M. Pardalos

Generalized median graphs and applications pp. 21-44

Lopamudra Mukherjee, Vikas Singh, Jiming Peng, Jinhui Xu, Michael J. Zeitz and Ronald Berezney

On the complexity and approximation of non-unique probe selection using d-disjunct matrix pp. 45-53

My T. Thai and Taieb Znati

Modeling and in vitro and in vivo characterization of a tissue engineered pancreatic substitute pp. 54-73

C. L. Stabler, C. Fraker, E. Pedraza, I. Constantinidis and A. Sambanis

Measuring resetting of brain dynamics at epileptic seizures: application of global optimization and spatial synchronization techniques pp. 74-97

Shivkumar Sabesan, Niranjan Chakravarthy, Kostas Tsakalis, Panos Pardalos and Leon Iasemidis

Controlling epileptic seizures in a neural mass model pp. 98-116

Niranjan Chakravarthy, Shivkumar Sabesan, Kostas Tsakalis and Leon Iasemidis

2008, volume 16, articles 4

Foreword: selected papers from the Franco-Canadian workshop on combinatorial algorithms pp. 323-323

David Bremner, Antoine Deza and Michael Soltys

A quadratic lower bound for colourful simplicial depth pp. 324-327

Tamon Stephen and Hugh Thomas

Computing monotone disjoint paths on polytopes pp. 328-343

David Avis and Bohdan Kaluzny

Stable matching problems with exchange restrictions pp. 344-360

Robert W. Irving

Minimum entropy coloring pp. 361-377

Jean Cardinal, Samuel Fiorini and Gwenaël Joret

A nonlinear optimization methodology for VLSI fixed-outline floorplanning pp. 378-401

Chaomin Luo, Miguel F. Anjos and Anthony Vannelli

Packing trees in communication networks pp. 402-423

Mohamed Saad, Tamás Terlaky, Anthony Vannelli and Hu Zhang

2008, volume 16, articles 3

Editorial, COCOON 2007 special issue pp. 197-197

Guohui Lin and Zhipeng Cai

Priority algorithms for the subset-sum problem pp. 198-228

Yuli Ye and Allan Borodin

A new recombination lower bound and the minimum perfect phylogenetic forest problem pp. 229-247

Yufeng Wu and Dan Gusfield

Online interval scheduling: randomized and multiprocessor cases pp. 248-262

Stanley P. Y. Fung, Chung Keung Poon and Feifeng Zheng

Alignments with non-overlapping moves, inversions and tandem duplications in O(n 4) time pp. 263-278

Christian Ledergerber and Christophe Dessimoz

Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems pp. 279-292

Robert W. Irving and David F. Manlove

A new quartet approach for reconstructing phylogenetic trees: quartet joining method pp. 293-306

Bin Ma, Lei Xin and Kaizhong Zhang

On broadcasting in unicyclic graphs pp. 307-322

Hovhannes A. Harutyunyan and Edward Maraachlian

2008, volume 16, articles 2

Preface pp. 97-98

Andreas Dress, Yinfeng Xu and Binhai Zhu

On minimum m-connected k-dominating set problem in unit disc graphs pp. 99-106

Weiping Shang, Frances Yao, Pengjun Wan and Xiaodong Hu

On threshold BDDs and the optimal variable ordering problem pp. 107-118

Markus Behle

An asymptotic PTAS for batch scheduling with nonidentical job sizes to minimize makespan pp. 119-126

Yuzhong Zhang and Zhigang Cao

A Lagrangian relaxation approach for the multiple sequence alignment problem pp. 127-154

Ernst Althaus and Stefan Canzar

Approximation algorithms for connected facility location problems pp. 155-172

Mohammad Khairul Hasan, Hyunwoo Jung and Kyung-Yong Chwa

Finding the anti-block vital edge of a shortest path between two nodes pp. 173-181

Bing Su, Qingchuan Xu and Peng Xiao

Point sets in the unit square and large areas of convex hulls of subsets of points pp. 182-195

Hanno Lefmann

2008, volume 16, articles 1

Online coupon consumption problem pp. 1-15

Yiwei Jiang, An Zhang and Zhiyi Tan

Almost optimal solutions for bin coloring problems pp. 16-27

Mingen Lin, Zhiyong Lin and Jinhui Xu

Online scheduling on parallel machines with two GoS levels pp. 28-38

Yiwei Jiang

Parameterized lower bound and inapproximability of polylogarithmic string barcoding pp. 39-49

Chunmei Liu, Yinglei Song and Legand L. Burge

The inverse 1-maxian problem with edge length modification pp. 50-67

Elisabeth Gassner

On the upper total domination number of Cartesian products of graphs pp. 68-80

Paul Dorbec, Michael A. Henning and Douglas F. Rall

OMEGa: an optimistic most energy gain method for minimum energy multicasting in wireless ad hoc networks pp. 81-95

Manki Min and Panos M. Pardalos