Logical Constraints as Cardinality Rules: Tight Representation Egon Balas OriginalPaper Pages: 115 - 128
On Approximability of Boolean Formula Minimization Oleg A. ProkopyevPanos M. Pardalos OriginalPaper Pages: 129 - 135
Batch-Processing Scheduling with Setup Times Chuangyin DangLiying Kang OriginalPaper Pages: 137 - 146
Comments on the Paper: Attacking the Market Split Problem with Lattice Point Enumeration Karen Aardal OriginalPaper Pages: 147 - 149
b-Tree Facets for the Simple Graph Partitioning Polytope Michael M. Sørensen OriginalPaper Pages: 151 - 170
A Further Improved Approximation Algorithm for Breakpoint Graph Decomposition Guohui LinTao Jiang OriginalPaper Pages: 183 - 194
A Multi-Exchange Neighborhood for Minimum Makespan Parallel Machine Scheduling Problems Antonio FrangioniEmiliano NecciariMaria Grazia ScutellĂ OriginalPaper Pages: 195 - 220