Pierre Fouilhoux
YOU?
Author Swipe
View article: The Anchor-Robust Project Scheduling Problem
The Anchor-Robust Project Scheduling Problem Open
In project scheduling, the durations of activities are often uncertain. Delays may cause a massive disorganization if a large number of activities must be rescheduled. In “The Anchor-Robust Project Scheduling Problem,” Bendotti, Chrétienne…
View article: Dominance-based linear formulation for the Anchor-Robust Project\n Scheduling Problem
Dominance-based linear formulation for the Anchor-Robust Project\n Scheduling Problem Open
In project scheduling under processing times uncertainty, the Anchor-Robust\nProject Scheduling Problem is to find a baseline schedule of bounded makespan\nand a max-weight subset of jobs whose starting times are guaranteed. The\nproblem w…
View article: Dominance-based linear formulation for the Anchor-Robust Project Scheduling Problem
Dominance-based linear formulation for the Anchor-Robust Project Scheduling Problem Open
In project scheduling under processing times uncertainty, the Anchor-Robust Project Scheduling Problem is to find a baseline schedule of bounded makespan and a max-weight subset of jobs whose starting times are guaranteed. The problem was …
View article: Dominance inequalities for scheduling around an unrestrictive common due date
Dominance inequalities for scheduling around an unrestrictive common due date Open
View article: Anchored solutions in robust combinatorial optimization
Anchored solutions in robust combinatorial optimization Open
If the instance of an optimization problem changes, an initial solution may become suboptimal or infeasible. It is then necessary to compute a new solution, but it is also desirable to keep some decisions from the initial solution unchange…
View article: Dominance-based linear formulation for the Anchor-Robust Project Scheduling Problem
Dominance-based linear formulation for the Anchor-Robust Project Scheduling Problem Open
View article: Dominance inequalities for scheduling around an unrestrictive common due\n date
Dominance inequalities for scheduling around an unrestrictive common due\n date Open
The problem considered in this work consists in scheduling a set of tasks on\na single machine, around an unrestrictive common due date to minimize the\nweighted sum of earliness and tardiness. This problem can be formulated as a\ncompact …
View article: Mixed integer formulations using natural variables for single machine scheduling around a common due date
Mixed integer formulations using natural variables for single machine scheduling around a common due date Open
View article: Symmetry-breaking inequalities for ILP with structured sub-symmetry
Symmetry-breaking inequalities for ILP with structured sub-symmetry Open
View article: Linear inequalities for neighborhood based dominance properties for the common due-date scheduling problem
Linear inequalities for neighborhood based dominance properties for the common due-date scheduling problem Open
National audience
View article: Orbitopal fixing for the full (sub-)orbitope and application to the Unit Commitment Problem
Orbitopal fixing for the full (sub-)orbitope and application to the Unit Commitment Problem Open
View article: Inégalités linéaires de dominance pour l’ordonnancement juste-à-temps avec date d’échéance commune non restrictive
Inégalités linéaires de dominance pour l’ordonnancement juste-à-temps avec date d’échéance commune non restrictive Open
National audience
View article: Breaking structured symmetries and sub-symmetries in Integer Linear Programming
Breaking structured symmetries and sub-symmetries in Integer Linear Programming Open
We consider integer linear programs whose solutions are binary matrices and whose (sub-)symmetry groups are symmetric groups acting on (sub-)columns. Such structured subsymmetry groups arise in important classes of combinatorial problems, …
View article: Sub-Symmetry-Breaking Inequalities for ILP with Structured Symmetry
Sub-Symmetry-Breaking Inequalities for ILP with Structured Symmetry Open
View article: Branch-and-Cut-and-Price algorithms for the preemptive RCPSP
Branch-and-Cut-and-Price algorithms for the preemptive RCPSP Open
In this article, we address the preemptive Resource-Constrained Precedence Scheduling Problem. We propose two mixed integer formulations containing an exponential number of variables and inequalities. An antichain is a set of pairwise inco…
View article: Orbitopal fixing for the full (sub)-orbitope and application to the Unit Commitment Problem
Orbitopal fixing for the full (sub)-orbitope and application to the Unit Commitment Problem Open
This paper focuses on integer linear programs where solutions are binary matrices, and the corresponding symmetry group is the set of all column permutations. Orbitopal fixing, as introduced by Kaibel et al., is a technique designed to bre…
View article: Orbitopal fixing for the full orbitope and application to the Unit Commitment Problem
Orbitopal fixing for the full orbitope and application to the Unit Commitment Problem Open
This paper focuses on integer linear programs where solutions are binary matrices, and the corresponding symmetry group is the set of all column permutations. Orbitopal fixing, as introduced by Kaibel et al., is a technique designed to bre…
View article: Securing virtual network function placement with high availability guarantees
Securing virtual network function placement with high availability guarantees Open
Virtual Network Functions as a Service (VNFaaS) is currently under attentive\nstudy by telecommunications and cloud stakeholders as a promising business and\ntechnical direction consisting of providing network functions as a service on a\n…
View article: Securing Virtual Network Function Placement with High Availability Guarantees
Securing Virtual Network Function Placement with High Availability Guarantees Open
Virtual Network Functions as a Service (VNFaaS) is currently under attentive study by telecommunications and cloud stakeholders as a promising business and technical direction consisting of providing network functions as a service on a clo…
View article: Circuit and bond polytopes on series–parallel graphs
Circuit and bond polytopes on series–parallel graphs Open