References
Aardal, K. I., van Hoesel, S. P. M., Koster, A. M. C. A., Mannino, C., & Sassano, A. (2003). Models and solution techniques for frequency assignment problems. 4OR, 1(4), 261–317.
Abrache, J., Crainic, T. G., & Gendreau, M. (2004). Design issues for combinatorial auctions. 4OR, 2(1), 1–33.
Barthélemy, J.-P., Brucker, F., & Osswald, C. (2004). Combinatorial optimization and hierarchical classifications. 4OR, 2(3), 179–219.
Bouyssou, D., Martello, S., & Plastria, F. (2003). 4OR for what purpose? 4OR, 1(1), 1–6.
Bouyssou, D., Martello, S., & Plastria, F. (2006). 4OR, Year 4. 4OR, 4(1), 1–9.
Brans, J.-P., & Gallo, G. (2004). Ethics in OR/MS: Past, present and future. 4OR, 2(2), 95–110.
Colson, B., Marcotte, P., & Savard, G. (2005). Bilevel programming: A survey. 4OR, 3(2), 87–107.
Cordeau, J.-F., & Laporte, G. (2003). The dial-a-ride problem (DARP): Variants, modeling issues and algorithms. 4OR, 1(2), 89–101.
Hochbaum, D. S. (2005). Complexity and algorithms for convex network optimization and other nonlinear problems. 4OR, 3(3), 171–216.
Lemaréchal, C. (2003). The omnipresence of Lagrange. 4OR, 1(1), 7–25.
Louveaux, Q., & Wolsey, L. A. (2003). Lifting, superadditivity, mixed integer rounding and single node flow sets revisited. 4OR, 1(3), 173–207.
Pahl, J., Voß, S., & Woodruff, D. L. (2005). Production planning with load dependent lead times. 4OR, 3(4), 257–302.
T’kindt, V., Bouibede-Hocine, K., & Esswein, C. (2005). Counting and enumeration complexity with application to multicriteria scheduling. 4OR, 3(1), 1–21.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Bouyssou, D., Martello, S. & Plastria, F. Eleven surveys in Operations Research. Ann Oper Res 153, 3–7 (2007). https://doi.org/10.1007/s10479-007-0168-2
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-007-0168-2