External Links

    Journal: Discrete Applied Mathematics

    Volume 48, Issue 3

    201 -- 218Hocine Belouadah, Chris N. Potts. Scheduling Identical Parallel Machines to Minimize Total Weighted Completion Time
    219 -- 229Martin E. Dyer. On a Universal Chain Problem
    231 -- 244Richard W. Eglese. Routeing Winter Gritting Vehicles
    245 -- 259Maud Göthe-Lundgren, Torbjörn Larsson. A Set Covering Reformulation of the Pure Fixed Charge Transportation Problem
    261 -- 272Robert W. Irving. Stable Marriage and Indifference
    273 -- 284Antoon W. J. Kolen, Erwin Pesch. Genetic Local Search in Combinatorial Optimization
    285 -- 288Masataka Nakamura. An Extension of Elementary Bipartite Graphs to Matroid Pairs and its Characterization
    289 -- 303Stan P. M. van Hoesel, Roelof Kuik, Marc Salomon, Luk Van Wassenhove. The Single-Item Discrete Lotsizing and Scheduling Problem: Optimization by Linear and Dynamic Programming

    Volume 48, Issue 2

    101 -- 109Peter Damaschke. A Tight Upper Bound for Group Testing in Graphs
    111 -- 127John G. Gimbel, Dieter Kratsch, Lorna Stewart. On Cocolourings and Cochromatic Numbers of Graphs
    129 -- 145Daniel Granot, Darko Skorin-Kapov. On Some Optimization Problems on ::::k::::-Trees and Partial ::::k::::-Trees
    147 -- 161Xiao-Dong Hu, Frank K. Hwang. Cutting Numbers for the Forward Loop Backward Hop Network
    163 -- 174Kenneth Schilling. Random Knapsacks with Many Constraints
    175 -- 186Alan P. Sprague, Hisao Tamaki. Routings for Involutions of a Hypercube
    187 -- 194Leizhen Cai. NP-Completeness of Minimum Spanner Problems

    Volume 48, Issue 1

    1 -- 20Warren P. Adams, Perino M. Dearing. On the Equivalence Between Roof Duality and Lagrangian Duality for Unconstrained 0-1 Quadratic Programming Problems
    21 -- 43Mireille Bousquet-Mélou. Codage des polyominos convexes et équations pour l énumération suivant l aire
    45 -- 68Peter Butkovic. Strong Regularity of Matrices - A Survey of Results
    69 -- 79Eugeniusz Nowicki, Czeslaw Smutnicki. An Approximation Algorithm for a Single-Machine Scheduling Problem with Release Times and Delivery Times
    81 -- 85Ivica Bosnjak. Some New Results Concerning three Counterfeit Coins Problem
    87 -- 92Vincent Bouchitté, Roland Jégou, Jean-Xavier Rampon. On the Directionality of Interval Orders
    93 -- 98Younzhou Zhu, David Mutchler. On Constructing the Elimination Tree
    runs on