
| Constrained auction clearing in the Italian electricity market |
| Design issues for combinatorial auctions |
| Network synthesis under survivability constraints |
| Phi-functions for complex 2D-objects |
| A solution approach of production planning problems based on compact formulations for single-item lot-sizing models |
| Trust-region algorithms for derivative-free optimization and nonlinear bilevel programming |
| Antiwebs are rank-perfect |
| Combinatorial optimization - Polyhedra and efficiency: A book review |
| Concentrator location in telecommunications |
| Ethics in OR/MS: Past, present and future |
| A genetic algorithm for robust schedules in a one-machine environment with ready times and due dates |
| A MIP approach for some practical packing problems: Balancing constraints and tetris-like items |
| Stefano Pallottino (1945-2004) |
| Ten notes on equal-processing-time scheduling |
| Combinatorial optimization and hierarchical classifications |
| Compact optimization can outperform separation: A case study in structural proteomics |
| The generation of stable project plans |
| Reformulation and convex relaxation techniques for global optimization |
| Upper bounds for revenue maximization in a satellite scheduling problem |
| Concordant outranking with multiple criteria of ordinal significance |
| Integrating local search techniques into mixed integer programming |
| Knapsack problems: A book review |
| LP formulations of the shortest path tree problem |
| Minimum convex piecewise linear cost tension problem on quasi-k series-parallel graphs |
| Non-classical preference models in combinatorial problems: Models and algorithms for graphs |
| A note on robust 0-1 optimization with uncertain cost coefficients |