On Inverse Problems of Optimum Perfect Matching Zhenhong LiuJianzhong Zhang OriginalPaper Pages: 215 - 228
Genetic Algorithm for Graph Coloring: Exploration of Galinier and Hao's Algorithm Celia A. GlassAdam Prügel-Bennett OriginalPaper Pages: 229 - 236
A Tight Semidefinite Relaxation of the MAX CUT Problem Hongwei LiuSanyang LiuFengmin Xu OriginalPaper Pages: 237 - 245
Approximation Algorithms in Batch Processing Xiaotie DengChung Keung PoonYuzhong Zhang OriginalPaper Pages: 247 - 257
Solving Steiner Tree Problems in Graphs with Lagrangian Relaxation Laura BahienseFrancisco BarahonaOscar Porto OriginalPaper Pages: 259 - 282
The Flow Shop Scheduling Polyhedron with Setup Times Roger Z. Ríos-MercadoJonathan F. Bard OriginalPaper Pages: 291 - 318