• Publications
  • Influence
Nodal aggregation of resource constraints in a shortest path problem
TLDR
We propose an adjustment based on Lagrangian and surrogate relaxations in a column generation framework, in which the sub-problems are shortest path problems with resource constraints. Expand
  • 16
  • 2
A MIP flow model for crop-rotation planning in a context of forest sustainable development
TLDR
We propose a Mixed-Integer Linear Programming model for a class of multi-period crop rotation optimization problems with demand constraints and incompatibility constraints between cultivation and fallow state on a land plot. Expand
  • 24
  • 1
Reoptimization in Lagrangian methods for the 0-1 quadratic knapsack problem
TLDR
We propose to embed reoptimization techniques for improving the efficiency of the preprocessing phase of the 0-1 quadratic knapsack resolution. Expand
  • 14
  • 1
  • PDF
Solutions diversification in a column generation algorithm
TLDR
Column generation algorithms have been specially designed for solving mathematical programs with a huge number of variables. Expand
  • 12
  • 1
  • PDF
Bayesian optimization approach of general bi-level problems
TLDR
We propose BOBP, a Bayesian Optimization algorithm to solve Bi-level Problems, in order to limit the number of evaluations at the first level by extracting knowledge from the solutions which have been solved at the second level. Expand
  • 7
  • 1
Hybrid column generation for large-size Covering Integer Programs: Application to transportation planning
TLDR
The well-known column generation scheme is hybridized with an extension of the best-known CIP approximation heuristic, taking advantage of distinct criteria of columns selection. Expand
  • 5
  • 1
Maximum lateness minimization with positive tails on a single machine with an unexpected non-availability interval
TLDR
In this paper, we consider the single machine scheduling problem with an unexpected non-availability interval with two possible models related to this constraint: breakdown model and emergentjob model. Expand
  • 1
  • 1
0–1 Knapsack Problems
  • 8
Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem
TLDR
This paper deals with lagrangean heuristics, local search, variable fixing and reoptimization for an efficient solving of the 0–1 bidimensional knapsack problem. Expand
  • 14
Combining Arc-Consistency and Dual Lagrangean Relaxation for Filtering CSPs
TLDR
This paper presents a CSPs filtering method combining arc-consistency and dual Lagrangean relaxation techniques. Expand
  • 12
...
1
2
3
4
5
...