Recherche
-
The two-machine flowshop total completion time problem: A branch-and-bound based on Network-flow formulation
Communication dans un congrès -
A new Lagrangian bound for the min-sum job-shop scheduling
Communication dans un congrès -
Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem
(Discrete Optimization. vol. 29, pp. 18-44, 2018-02-13)Article de revue -
A review of algorithmic enhancements for Benders decomposition
Communication dans un congrès -
Recent results for column generation based diving heuristics
Communication dans un congrès -
A Column Generation Based Heuristic for the Dial-A-Ride Problem
Communication dans un congrès -
Column generation based approaches for a tour scheduling problem with multi-skill heterogeneous workforce
(European Journal of Operational Research, 2016)Article de revue -
The Multi-Point Separation Strategy as a Column GenerationStabilization Technique
Communication dans un congrès -
Combining dual price smoothing and piecewise linear penalty function stabilization in column generation: experimental results
Communication dans un congrès -
Automatic stabilization for solving the Lagrangian dual problem using column generation
Communication dans un congrès