"
4OR: Year 4 |
An acyclic days-off scheduling problem |
A case of plagiarism: Danut Marcu |
Empirical validation of a queueing approach to uninterrupted traffic flows |
Martins' algorithm revisited for multi-objective shortest path problems with a MaxMin cost function |
Mutual exclusion scheduling with interval graphs or related classes: Complexity and algorithms |
Nondecomposable solutions to group equations and an application to polyhedral combinatorics |
Two-machine flow shop scheduling problems with minimal and maximal delays |
Dealing with inconsistent judgments in multiple criteria sorting models |
An exact algorithm for the node weighted Steiner tree problem |
Some operations research methods for analyzing protein sequences and structures |
Validating state-dependent queueing models for uninterrupted traffic flows using simulation |
Algorithms for some graph theoretical optimization problems |
Design of cooperative algorithms for multi-objective optimization: application to the flow-shop scheduling problem |
Integrating operations research in constraint programming |
Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking |
Stochastic semidefinite programming: a new paradigm for stochastic optimization |
Approximation and resolution of min-max and min-max regret versions of combinatorial optimization problems |
A decomposition-based solution method for stochastic mixed integer nonlinear programs |
A decomposition-based solution method for stochastic mixed integer nonlinear programs |
Ejection chain and filter-and-fan methods in combinatorial optimization |
Energetic reasoning and bin-packing problem, for bounding a parallel machine scheduling problem |
The geometric generalized minimum spanning tree problem with grid clustering |
The geometric generalized minimum spanning tree problem with grid clustering |
Towards logistics systems parameter optimisation through the use of response surfaces |