Volume 25, Issue 2

Search all Journal of Combinatorial Optimization articles

February 2013

Special Issue: Combinatorial Optimization and Applications

Issue Editors:

Weili Wu,
Ovidiu Daescu

10 articles in this issue

Scheduling Packets with Values and Deadlines in Size-Bounded Buffers
Fei Li
OriginalPaper 08 October 2011 Pages: 165 - 175
Some variations on constrained minimum enclosing circle problem
Arindam Karmakar
Sandip Das
Binay K. Bhattacharya
OriginalPaper 03 February 2012 Pages: 176 - 190
Complexity of determining the most vital elements for the p-median and p-center location problems
Cristina Bazgan
Sonia Toubaline
Daniel Vanderpooten
OriginalPaper 17 March 2012 Pages: 191 - 207
Coverage with k-transmitters in the presence of obstacles
Brad Ballinger
Nadia Benbernou
Ryuhei Uehara
OriginalPaper 15 March 2012 Pages: 208 - 233
Approximating multilinear monomial coefficients and maximum multilinear monomials in multivariate polynomials
Zhixiang Chen
Bin Fu
OriginalPaper 10 May 2012 Pages: 234 - 254
Improved approximation for spanning star forest in dense graphs
Jing He
Hongyu Liang
OriginalPaper 24 May 2012 Pages: 255 - 264
A primal-dual approximation algorithm for the Asymmetric Prize-Collecting TSP
Viet Hung Nguyen
OriginalPaper 19 May 2012 Pages: 265 - 278
Preemptive scheduling on two identical parallel machines with a single transporter
Hans Kellerer
Alan J. Soper
Vitaly A. Strusevich
OriginalPaper 23 June 2012 Pages: 279 - 307
Discrete optimization with polynomially detectable boundaries and restricted level sets
Yakov Zinder
Julia Memar
Gaurav Singh
OriginalPaper 15 September 2012 Pages: 308 - 325
A simplified algorithm for the all pairs shortest path problem with O(n ²logn) expected time
Tadao Takaoka
OriginalPaper 21 September 2012 Pages: 326 - 337

Volume 25, Issue 2

Search

Navigation