
| Bilevel programming and price setting problems |
| Local search and combinatorial optimization: from structural analysis of a problem to efficient algorithms design |
| New approaches for solving the resource-constrained project scheduling problem |
| A new model and a hyper-heuristic approach for two-dimensional shelf space allocation |
| On coordinated cutting plane generation and mixed integer programs with nonconvex 2-norm constraints |
| Robust combinatorial optimization with variable budgeted uncertainty |
| To kit or not to kit: optimizing part feeding in the automotive assembly industry |
| Variable neighborhood search for the travelling deliveryman problem |
| An extension of the FlowSort sorting method to deal with imprecision |
| Combining metaheuristics with mathematical programming, constraint programming and machine learning |
| Exact algorithms for different classes of vehicle routing problems |
| A necessary 4-cycle condition for dice representability of reciprocal relations |
| On the design of networks with unicyclic connected components |
| The stable set problem: some structural properties and relaxations |
| An efficient heuristic algorithm for the capacitated p-median problem |
| Bicriteria path problem minimizing the cost and minimizing the number of labels |
| Complexity and in-approximability of a selection problem in robust optimization |
| MPOC: an agglomerative algorithm for multicriteria partially ordered clustering |
| Using multi-objective evolutionary algorithms for single-objective optimization |
| Effect of global FCFS and relative load distribution in two-class queues with dedicated servers |
| Global optimization based on local searches |
| A modified scaled memoryless BFGS preconditioned conjugate gradient method for unconstrained optimization |
| A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems |
| Speeding up Martins' algorithm for multiple objective shortest path problems |