
| Algorithms for selection and graph-coloring problems with applications in marketing and micro-economics |
| A characterisation of stable sets in preordered structure |
| Delay analysis of a discrete-time multiclass slot-bound priority system |
| The impact of collaboration and smoothing replenishment rules on supply chain performance |
| Learning from conflicts in propositional satisfiability |
| New approaches for solving the resource-constrained project scheduling problem |
| No end of the world in 2012 for 4OR |
| Robust energy planning in buildings with energy and comfort costs |
| A simulated annealing hyper-heuristic methodology for flexible decision support |
| Analysis of reactive search optimisation techniques for the maximum clique problem and applications |
| Credit default swaps: implied ratings versus official ones |
| Decomposition and reformulation of integer linear programming problems |
| Matheuristics for combinatorial optimization problems: applications to services and production systems |
| Min–max and min–max (relative) regret approaches to representatives selection problem |
| Models and algorithms for network design problems |
| On inverse traveling salesman problems |
| Pure 0-1 programming approaches to wireless network design |
| The symmetric quadratic knapsack problem: approximation and scheduling applications |
| An adapted heuristic approach for a clustered traveling salesman problem with loading constraints |
| Bicriteria optimization in the newsvendor problem with uniformly distributed demand |
| The development and application of metaheuristics for problems in graph theory: a computational study |
| Pricing and setup/closedown policies in unobservable queues with strategic customers |
| Protection planning for critical infrastructure systems in location analysis: models and algorithms |
| Relaxations of mixed integer sets from lattice-free polyhedra |
| Simulation-based optimization in port logistics |
| Vehicle routing problems with trailers |
| Heuristic algorithms and learning techniques: applications to the graph coloring problem |
| Minimizing the completion time of a project under resource constraints and feeding precedence relations: an exact algorithm |
| Models and methods for the constrained shortest path problem and its variants |
| On the calculation of stability radius for multi-objective combinatorial optimization problems by inverse optimization |
| Semidefinite relaxations for partitioning, assignment and ordering problems |
| Shop and batch scheduling with constraints |
| Soft due window assignment and scheduling of unit-time jobs on parallel machines |
| The two-echelon vehicle routing problem |