Issue 4/2011
Content (27 Articles)
Optimal on-line algorithms for one batch machine with grouped processing times
Yang Fang, Peihai Liu, Xiwen Lu
The Maximum Box Problem for moving points in the plane
S. Bereg, J. M. Díaz-Báñez, P. Pérez-Lantero, I. Ventura
Revised GRASP with path-relinking for the linear ordering problem
W. Art Chaovalitwongse, Carlos A. S. Oliveira, Bruno Chiarini, Panos M. Pardalos, Mauricio G. C. Resende
A closest vector problem arising in radiation therapy planning
Céline Engelbeen, Samuel Fiorini, Antje Kiesel
PTAS for minimum weighted connected vertex cover problem with c-local condition in unit disk graphs
Lidan Fan, Zhao Zhang, Wei Wang
Optimal semi-online algorithm for scheduling with rejection on two uniform machines
Xiao Min, Jing Liu, Yuqing Wang
Geometric rounding: a dependent randomized rounding scheme
Dongdong Ge, Simai He, Yinyu Ye, Jiawei Zhang
Improved floor-planning of graphs via adjacency-preserving transformations
Huaming Zhang, Sadish Sadasivam
A rearrangement of adjacency matrix based approach for solving the crossing minimization problem
Neng Fan, Panos M. Pardalos
Minimizing makespan in an ordered flow shop with machine-dependent processing times
Byung-Cheon Choi, Joseph Y.-T. Leung, Michael L. Pinedo
SIRALINA: efficient two-steps heuristic for storage optimisation in single period task scheduling
Karine Deschinkel, Sid-Ahmed-Ali Touati, Sébastien Briais
Polynomially solvable special cases of the quadratic bottleneck assignment problem
Rainer E. Burkard, Roswitha Rissner
Minimum d-blockers and d-transversals in graphs
Marie-Christine Costa, Dominique de Werra, Christophe Picouleau
A modified power spectral density test applied to weighing matrices with small weight
Ilias S. Kotsireas, Christos Koukouvinos, Panos M. Pardalos