Volume 8, Number 1, March 2004
Bang Ye Wu
: Constructing the Maximum Consensus Tree from Rooted Triples.
: Dynamic Programming and Hill-Climbing Techniques for Constrained Two-Dimensional Cutting Stock Problems.
Volume 8, Number 2, June 2004
: Logical Constraints as Cardinality Rules: Tight Representation.
: Comments on the Paper: Attacking the Market Split Problem with Lattice Point Enumeration.
: Wide Diameters of Cartesian Product Graphs and Digraphs.
, Tao Jiang
: A Further Improved Approximation Algorithm for Breakpoint Graph Decomposition.
Volume 8, Number 3, September 2004
: Inverse Combinatorial Optimization: A Survey on Problems, Methods, and Results.
Volume 8, Number 4, December 2004
, Ming Li
, Ying Xu
: Protein Threading by Linear Programming: Theoretical Analysis and Computational Results.
: On Combinatorial Approximation of Covering 0-1 Integer Programs and Partial Set Cover.
: From Linear to Semidefinite Programming: An Algorithm to Obtain Semidefinite Relaxations for Bivalent Quadratic Problems.