External Links

    Journal: 4OR

    Volume 2, Issue 4

    259 -- 274Jakob Krarup, Malene Nordlund Rørbech. LP formulations of the shortest path tree problem
    275 -- 291Bruno Bachelet, Philippe Mahey. Minimum convex piecewise linear cost tension problem on quasi-::::k:::: series-parallel graphs
    293 -- 308Raymond Bisdorff. Concordant outranking with multiple criteria of ordinal significance
    309 -- 316Mustafa Ç. Pinar. A note on robust 0-1 optimization with uncertain cost coefficients
    317 -- 320Alberto Caprara. Knapsack problems: A book review
    321 -- 324Emilie Danna. Integrating local search techniques into mixed integer programming
    325 -- 328Olivier Spanjaard. Non-classical preference models in combinatorial problems: Models and algorithms for graphs

    Volume 2, Issue 3

    179 -- 219Jean-Pierre Barthélemy, François Brucker, Christophe Osswald. Combinatorial optimization and hierarchical classifications
    221 -- 233Robert D. Carr, Giuseppe Lancia. Compact optimization can outperform separation: A case study in structural proteomics
    235 -- 249Thierry Benoist, Benoît Rottembourg. Upper bounds for revenue maximization in a satellite scheduling problem
    251 -- 254Roel Leus. The generation of stable project plans
    255 -- 258Leo Liberti. Reformulation and convex relaxation techniques for global optimization

    Volume 2, Issue 2

    93 -- 93Silvano Martello. Stefano Pallottino (1945-2004)
    95 -- 110Jean-Pierre Brans, Giorgio Gallo. Ethics in OR/MS: Past, present and future
    111 -- 127Philippe Baptiste, Peter Brucker, Sigrid Knust, Vadim G. Timkovsky. Ten notes on equal-processing-time scheduling
    129 -- 147Marc Sevaux, Kenneth Sörensen. A genetic algorithm for robust schedules in a one-machine environment with ready times and due dates
    149 -- 152Annegret Wagler. Antiwebs are rank-perfect
    153 -- 159Michelangelo Conforti, Romeo Rizzi. Combinatorial optimization - Polyhedra and efficiency: A book review
    161 -- 174Giorgio Fasano. A MIP approach for some practical packing problems: Balancing constraints and tetris-like items
    175 -- 177Hande Yaman. Concentrator location in telecommunications

    Volume 2, Issue 1

    1 -- 33Jawad Abrache, Teodor Gabriel Crainic, Michel Gendreau. Design issues for combinatorial auctions
    35 -- 51Patrizia Beraldi, Domenico Conforti, Chefi Triki, Antonio Violi. Constrained auction clearing in the Italian electricity market
    53 -- 67Jean François Maurras, Sonia Vanier. Network synthesis under survivability constraints
    69 -- 84Yurij Stoyan, Guntram Scheithauer, Nikolay Gil, Tatiana Romanova. Phi-functions for complex 2D-objects
    85 -- 88Benoît Colson. Trust-region algorithms for derivative-free optimization and nonlinear bilevel programming
    89 -- 91Mathieu Van Vyve. A solution approach of production planning problems based on compact formulations for single-item lot-sizing models
    runs on