A decomposition approach for a very large scale optimal diversity management problem Pasquale AvellaMaurizio BocciaIgor Vasil’ev Regular Paper Pages: 23 - 37
Counting and enumeration complexity with application to multicriteria scheduling Vincent T’kindtKarima Bouibede-HocineCarl Esswein Invited Survey Pages: 1 - 21
Non-classical preference models in combinatorial problems: Models and algorithms for graphs Olivier Spanjaard PhD thesis Pages: 325 - 328
Integrating local search techniques into mixed integer programming Emilie Danna PhD thesis Pages: 321 - 324
A note on robust 0-1 optimization with uncertain cost coefficients Mustafa Ç. Pínar Regular Paper Pages: 309 - 316
Concordant outranking with multiple criteria of ordinal significance Raymond Bisdorff Regular Paper Pages: 293 - 308
Minimum convex piecewise linear cost tension problem on quasi-k series-parallel graphs Bruno BacheletPhilippe Mahey Regular Paper Pages: 275 - 291
LP formulations of the shortest path tree problem Jakob KrarupMalene Nordlund Rørbech Education Pages: 259 - 274
Reformulation and convex relaxation techniques for global optimization Leo Liberti PhD thesis Pages: 255 - 258
Upper bounds for revenue maximization in a satellite scheduling problem Thierry BenoistBenoít Rottembourg OriginalPaper Pages: 235 - 249
Compact optimization can outperform separation: A case study in structural proteomics Robert D. CarrGiuseppe G. Lancia OriginalPaper Pages: 221 - 233
Combinatorial optimization and hierarchical classifications Jean-Pierre BarthélemyFrançois BruckerChristophe Osswald Invited survey Pages: 179 - 219
A MIP approach for some practical packing problems: Balancing constraints and tetris-like items Giorgio Fasano OriginalPaper Pages: 161 - 174
Combinatorial optimization - Polyhedra and efficiency: A book review Michelangelo ConfortiRomeo Rizzi OriginalPaper Pages: 153 - 159
A genetic algorithm for robust schedules in a one-machine environment with ready times and due dates Marc SevauxKenneth Sörensen OriginalPaper Pages: 129 - 147
Ten notes on equal-processing-time scheduling Philippe BaptistePeter BruckerVadim G. Timkovsky OriginalPaper Pages: 111 - 127
Ethics in OR/MS: Past, present and future Jean-Pierre BransGiorgio Gallo OriginalPaper Pages: 95 - 110
A solution approach of production planning problems based on compact formulations for single-item lot-sizing models Mathieu Van Vyve OriginalPaper Pages: 89 - 91
Trust-region algorithms for derivative-free optimization and nonlinear bilevel programming Benoít Colson OriginalPaper Pages: 85 - 88
\(\Phi \)-functions for complex 2D-objects Yurij StoyanGuntram ScheithauerTatiana Romanova OriginalPaper Pages: 69 - 84
Network synthesis under survivability constraints Jean-François MaurrasSonia Vanier OriginalPaper Pages: 53 - 67
Constrained auction clearing in the Italian electricity market Patrizia BeraldiDomenico ConfortiAntonio Violi OriginalPaper Pages: 35 - 51
Design issues for combinatorial auctions Jawad AbracheTeodor Gabriel CrainicMichel Gendreau OriginalPaper Pages: 1 - 33
Acknowledgement to referees Denis BouyssouSilvano MartelloFrank Plastria Acknowledgement to referees Pages: 347 - 348
A framework for robust and flexible optimisation using metaheuristics Kenneth Sörensen OriginalPaper Pages: 341 - 345
Two exact algorithms for the capacitated p-median problem Alberto Ceselli OriginalPaper Pages: 319 - 340
Models and solution techniques for frequency assignment problems Karen I. AardalStan P. M. van HoeselAntonio Sassano OriginalPaper Pages: 261 - 317
Upper and lower bounds for the fixed spectrum frequency assignment problem Roberto Montemanni OriginalPaper Pages: 257 - 260
A note on a new variant of Murty’s ranking assignments algorithm Marta PascoalM. Eugénia CaptivoJoão Clímaco OriginalPaper Pages: 243 - 255
Bottleneck shortest paths on a partially ordered scale Jérôme MonnotOlivier Spanjaard OriginalPaper Pages: 225 - 241
Lifting, superadditivity, mixed integer rounding and single node flow sets revisited Quentin LouveauxLaurence A. Wolsey OriginalPaper Pages: 173 - 207
Routing, districting and location for arc traversal problems Luc Muyldermans OriginalPaper Pages: 169 - 172
Embedding optimisation algorithms with Mosel Tito A. CirianiYves ColombaniSusanne Heipcke OriginalPaper Pages: 155 - 167
The Two-Dimensional Finite Bin Packing Problem. Part II: New lower and upper bounds Marco A. BoschettiAristide Mingozzi OriginalPaper Pages: 135 - 147
A new implementation of Yen’s ranking loopless paths algorithm Ernesto Q. V. MartinsMarta M. B. Pascoal OriginalPaper Pages: 121 - 133
Process selection and sequencing in a two-agents production system Alessandro AgnetisPaolo DettiCarlo Meloni OriginalPaper Pages: 103 - 119
The Dial-a-Ride Problem (DARP): Variants, modeling issues and algorithms Jean-François CordeauGilbert Laporte OriginalPaper Pages: 89 - 101
Chemical trees enumeration algorithms Roberto AringhieriPierre HansenFederico Malucelli OriginalPaper Pages: 67 - 83
ABS methods and ABSPACK for linear systems and optimization: A review Emilio SpedicatoElena BodonNezam Mahdavi-Amiri OriginalPaper Pages: 51 - 66
Upper bounds on the independence and the clique covering number Cyriel Van NuffelenKristel Van Rompay OriginalPaper Pages: 43 - 50
The two-dimensional finite bin packing problem. Part I: New lower bounds for the oriented case Marco A. BoschettiAristide Mingozzi OriginalPaper Pages: 27 - 42