External Links

    Journal: Computing

    Volume 63, Issue 4

    299 -- 316Peter Brucker, Sigrid Knust. Complexity Results for Single-Machine Problems with Positive Finish-Start Time-Lags
    317 -- 330Rainer E. Burkard, M. M. Miatselski. Volume Maximization and Orthoconvex Approximation of Orthogons
    331 -- 340Michel X. Goemans, Franz Rendl. Semidefinite Programs and Association Schemes
    341 -- 349Clemens Heuberger. Minimal Expansions in Redundant Number Systems and Shortest Paths in Graphs
    351 -- 403Stefan E. Karisch, Eranda Çela, Jens Clausen, T. Espersen. A Dual Framework for Lower Bounds of the Quadratic Assignment Problem Based on Linearization
    405 -- 417Peter Kleinschmidt, Christian Rank. New Heuristics for the Multidimensional Vote Assignment Problem
    419 -- 430Ulrich Pferschy. Dynamic Programming Revisited: Improving Knapsack Algorithms
    runs on