The following pages link to Philippe Yves Paul Michelon (Q1652241):
Displaying 39 items.
- (Q342559) (redirect page) (← links)
- A variable fixing heuristic with local branching for the fixed charge uncapacitated network design problem with user-optimal flow (Q342561) (← links)
- SAPI: statistical analysis of propagation of incidents. A new approach for rescheduling trains after disruptions (Q421648) (← links)
- Generalized resolution search (Q429682) (← links)
- An exact cooperative method for the uncapacitated facility location problem (Q495932) (← links)
- Crop rotation scheduling with adjacency constraints (Q666491) (← links)
- An exact method with variable fixing for solving the generalized assignment problem (Q694523) (← links)
- LSSPER: Solving the resource-constrained project scheduling problem with large neighbourhood search (Q702729) (← links)
- ``Miniaturized'' linearizations for quadratic 0/1 problems (Q817208) (← links)
- A constraint programming approach for the resource-constrained project scheduling problem (Q940840) (← links)
- A multi-level search strategy for the 0-1 multidimensional knapsack problem (Q968116) (← links)
- A linearization framework for unconstrained quadratic (0-1) problems (Q1025991) (← links)
- Lagrangean decomposition for integer nonlinear programming with linear constraints (Q1181738) (← links)
- Unconstrained 0-1 nonlinear programming: A nondifferentiable approach (Q1187840) (← links)
- Lagrangean methods for the 0-1 quadratic knapsack problem (Q1268265) (← links)
- Using the tabu search method for the distribution of supplies in a hospital (Q1339143) (← links)
- Insertion techniques for static and dynamic resource-constrained project scheduling. (Q1399570) (← links)
- Scheduling the flying squad nurses of a hospital using a multi-objective programming model (Q1593530) (← links)
- The Euclidean Steiner tree problem in \(\mathbb{R}^{n}\): A mathematical programming formulation (Q1593533) (← links)
- Algorithms for job scheduling problems with distinct time windows and general earliness/tardiness penalties (Q1652242) (← links)
- A hybrid metaheuristic for the minimum labeling spanning tree problem (Q1755227) (← links)
- A neighborhood exploration approach with multi-start for extend generalized block-modeling (Q1791915) (← links)
- General variable neighborhood search for the data mule scheduling problem (Q1791917) (← links)
- Lagrangean methods for 0-1 quadratic problems (Q1803678) (← links)
- Generalized assignment type goal programming problem: application to nurse scheduling (Q1850969) (← links)
- A polyhedral approach to the generalized minimum labeling spanning tree problem (Q2329708) (← links)
- The dynamic frequency assignment problem (Q2378376) (← links)
- A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices (Q2516354) (← links)
- An Exact Site Availability Approach to Modeling the D-FAP (Q2883541) (← links)
- Constraint-Propagation-Based Cutting Planes: An Application to the Resource-Constrained Project Scheduling Problem (Q2890456) (← links)
- A MIP-based local search method for the railway rescheduling problem (Q3076018) (← links)
- Models and methods for frequency assignment with cumulative interference constraints (Q3499441) (← links)
- The Vehicle Scheduling Problem with Multiple Vehicle Types (Q3787780) (← links)
- Un Algorithme pour la Bipartition d'un Graphe en Sous-graphes de Cardinalité Fixée (Q4546064) (← links)
- 0-1 Quadratic Knapsack Problems: An Exact Approach Based on a $t$-Linearization (Q4915173) (← links)
- Integer and constraint programming approaches for providing optimality to the bandwidth multicoloring problem (Q5002336) (← links)
- New proposals for modelling and solving the problem of covering solids using spheres of different radii (Q5109811) (← links)
- Solution of a Facility Layout Problem in a Final Assembly Workshop using Constraint Programming (Q6102811) (← links)
- Notes on models for distance coloring problems (Q6492343) (← links)
