
| 4OR for what purpose? |
| ABS methods and ABSPACK for linear systems and optimization: A review |
| Algorithms for packing and scheduling problems |
| Chemical trees enumeration algorithms |
| The omnipresence of Lagrange |
| The two-dimensional finite bin packing problem. Part I: New lower bounds for the oriented case |
| Upper bounds on the independence and the clique covering number |
| The Dial-a-Ride Problem (DARP): Variants, modeling issues and algorithms |
| Embedding optimisation algorithms with Mosel |
| A new implementation of Yen's ranking loopless paths algorithm |
| Process selection and sequencing in a two-agents production system |
| Routing, districting and location for arc traversal problems |
| The Two-Dimensional Finite Bin Packing Problem. Part II: New lower and upper bounds |
| The vehicle routing problem: A book review |
| Bottleneck shortest paths on a partially ordered scale |
| Lifting, superadditivity, mixed integer rounding and single node flow sets revisited |
| A note on a new variant of Murty's ranking assignments algorithm |
| Primal separation algorithms |
| Upper and lower bounds for the fixed spectrum frequency assignment problem |
| Acknowledgement to referees |
| A framework for robust and flexible optimisation using metaheuristics |
| Models and solution techniques for frequency assignment problems |
| Two exact algorithms for the capacitated p-median problem |