Constraint integer programming, 2007. ,
The robust vehicle routing problem with time windows, Computers and Operations Research, vol.40, issue.3, pp.856-866, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-00916976
A computational study of lp-based heuristic algorithms for two-dimensional guillotine cutting stock problems, OR Spectrum, vol.24, issue.2, pp.179-192, 2002. ,
A Neighborhood Search and Set Cover Hybrid Heuristic for the Two-Echelon Vehicle Routing Problem, 18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2018), vol.65, p.15, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-02005206
Two-stage two-dimensional guillotine cutting stock problems with usable leftover, International Transactions in Operational Research, vol.23, issue.1-2, pp.121-145, 2016. ,
The Traveling Salesman Problem: A Computational Study, 2006. ,
Optimal solutions for routing problems with profits, Discrete Applied Mathematics, vol.161, issue.4-5, pp.547-557, 2013. ,
Optimal network design with endto-end service requirements, Operations Research, vol.65, issue.3, pp.729-750, 2017. ,
An exact algorithm for the pickup and delivery problem with time windows, Operations Research, vol.59, issue.2, pp.414-426, 2011. ,
An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts, Mathematical Programming, vol.115, pp.351-385, 2008. ,
A unified exact method for solving different classes of vehicle routing problems, Mathematical Programming, vol.120, issue.2, pp.347-380, 2009. ,
New route relaxation and pricing strategies for the vehicle routing problem, Operations Research, vol.59, issue.5, pp.1269-1283, 2011. ,
On an integer program for a delivery problem, Operations Research, vol.12, issue.2, pp.300-304, 1964. ,
On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation, Naval Research Logistics, vol.56, issue.6, pp.487-502, 2009. ,
URL : https://hal.archives-ouvertes.fr/inria-00387012
Time-indexed formulations for scheduling chains on a single machine: An application to airborne radars, European Journal of Operational Research, vol.203, issue.2, pp.476-483, 2010. ,
URL : https://hal.archives-ouvertes.fr/inria-00339639
The volume algorithm: producing primal solutions with a subgradient method, Mathematical Programming, vol.87, issue.3, pp.385-399, 2000. ,
Algorithms for unconstrained two-dimensional guillotine cutting, The Journal of the Operational Research Society, vol.36, issue.4, pp.297-306, 1985. ,
A branch-and-cut-and-price algorithm for onedimensional stock cutting and two-dimensional two-stage cutting, European Journal of Operational Research, vol.171, issue.1, pp.85-106, 2006. ,
Acceleration of cutting-plane and column generation algorithms: Applications to network design, Networks, vol.49, issue.1, pp.3-17, 2007. ,
Dual-Optimal Inequalities for Stabilized Column Generation, Operations Research, vol.54, issue.3, pp.454-463, 2006. ,
On the choice of explicit stabilizing terms in column generation, Discrete Applied Mathematics, vol.157, issue.6, pp.1167-1184, 2009. ,
A Benders decomposition approach for the two-echelon stochastic multi-period capacitated location-routing problem. HAL 02178459, 2019. ,
URL : https://hal.archives-ouvertes.fr/hal-02178459
Discrete optimization with decision diagrams, INFORMS Journal on Computing, vol.28, issue.1, pp.47-66, 2016. ,
Automatic dantzig-wolfe reformulation of mixed integer programs, Mathematical Programming, vol.149, issue.1, pp.391-424, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01504852
Primal heuristics for mixed integer programs, 2006. ,
Robust discrete optimization and network flows, Mathematical Programming, vol.98, issue.1, pp.49-71, 2003. ,
A branch-and-bound algorithm for the knapsack problem with conflict graph, INFORMS Journal on Computing, vol.29, issue.3, pp.457-473, 2017. ,
A branch-and-cut algorithm for the team orienteering problem, International Transactions in Operational Research, vol.25, issue.2, pp.627-635, 2018. ,
Solving lp relaxations of large-scale precedence constrained problems, Integer Programming and Combinatorial Optimization, vol.6080, pp.1-14, 2010. ,
The continuous-time service network design problem, Operations Research forthcoming, 2017. ,
Route relaxations on gpu for vehicle routing problems, European Journal of Operational Research, vol.258, issue.2, pp.456-466, 2017. ,
A branch-and-price algorithm for the multi-activity multi-task shift scheduling problem, Journal of Scheduling, vol.17, issue.2, pp.185-197, 2014. ,
Bin packing and related problems: General arc-flow formulation with graph compression, Computers & Operations Research, vol.69, pp.56-67, 2016. ,
Comparison of bundle and classical column generation, Mathematical Programming, vol.113, issue.2, pp.299-344, 2008. ,
URL : https://hal.archives-ouvertes.fr/inria-00070554
Stabilized branch and price with dynamic parameter updating for discontinuous tour scheduling, Computers and Operations Research, vol.44, issue.0, pp.137-145, 2014. ,
The vehicle routing problem with service level constraints, European Journal of Operational Research, vol.265, issue.2, pp.544-558, 2018. ,
On the complete set packing and set partitioning polytopes: Properties and rank 1 facets, Operations Research Letters, vol.46, issue.4, pp.389-392, 2018. ,
On the exact solution of a large class of parallel machine scheduling problems, Cadernos do, vol.3, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01958180
A branch-and-price algorithm for the minimum latency problem, Computers & Operations Research, vol.93, pp.66-78, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01664835
An exact algorithm for the maximum clique problem, Operations Research Letters, vol.9, issue.6, pp.375-382, 1990. ,
Algorithms for twodimensional cutting stock and strip packing problems using dynamic programming and column generation, European Journal of Operational Research, vol.191, issue.1, pp.61-85, 2008. ,
Dynamic programming approaches for the temporal knapsack problem, 2019. ,
Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints, European Journal of Operational Research, vol.258, issue.2, pp.467-477, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01410170
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. ,
URL : https://hal.archives-ouvertes.fr/hal-01426690
Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers, 2019. ,
URL : https://hal.archives-ouvertes.fr/hal-01656179
Thirty years of inventory routing, Transportation Science, vol.48, issue.1, pp.1-19, 2014. ,
A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints, Discrete Optimization, vol.12, pp.129-146, 2014. ,
Grammar-based integer programming models for multiactivity shift scheduling, Management Science, vol.57, issue.1, pp.151-163, 2011. ,
Grammar-based column generation for personalized multi-activity shift scheduling, INFORMS Journal on Computing, vol.25, issue.3, pp.461-474, 2013. ,
Exploring relaxation induced neighborhoods to improve mip solutions, Mathematical Programming, vol.102, issue.1, pp.71-90, 2005. ,
A comment on Edie's "Ttraffic delays at toll booths, Journal of the Operations Research Society of America, vol.2, issue.3, pp.339-343, 1954. ,
The truck dispatching problem, Management Science, vol.6, issue.1, pp.80-91, 1959. ,
Decomposition principle for linear programs, Operations Research, vol.8, issue.1, pp.101-111, 1960. ,
Level bundle methods for oracles with ondemand accuracy, Optimization Methods and Software, vol.29, issue.6, pp.1180-1209, 2014. ,
Enhanced pseudo-polynomial formulations for bin packing and cutting stock problems, INFORMS Journal on Computing, 2018. ,
A cost-regular based hybrid column generation approach, Constraints, vol.11, issue.4, pp.315-333, 2006. ,
URL : https://hal.archives-ouvertes.fr/hal-00293562
A Unified Framework for Deterministic Time Constrained Vehicle Routing and Crew Scheduling Problems, pp.57-93, 1998. ,
Accelerating Strategies in Column Generation Methods for Vehicle Routing and Crew Scheduling Problems, pp.309-324, 2002. ,
Cutting planes for branchand-price algorithms, Networks, vol.58, issue.4, pp.301-310, 2011. ,
Tabu search, partial elementarity, and generalized k-path inequalities for the vehicle routing problem with time windows, Transportation Science, vol.42, issue.3, pp.387-404, 2008. ,
Branch-price-and-cut algorithms, Wiley Encyclopedia of Operations Research and Management Science, 2011. ,
The two-machine flowshop total completion time problem: Branch-and-bound algorithms based on network-flow formulation, European Journal of Operational Research, vol.252, issue.3, pp.750-760, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01419206
Exact algorithms for the chanceconstrained vehicle routing problem, Mathematical Programming, vol.172, issue.1, pp.105-138, 2018. ,
Branch-and-price for staff rostering: An efficient implementation using generic programming and nested column generation, European Journal of Operational Research, vol.230, issue.1, pp.157-169, 2013. ,
Exact algorithms for the twodimensional guillotine knapsack, Computers & Operations Research, vol.39, issue.1, pp.48-53, 2012. ,
Stabilized column generation, Discrete Mathematics, vol.194, issue.1-3, pp.229-237, 1999. ,
JuMP: A modeling language for mathematical optimization, SIAM Review, vol.59, issue.2, pp.295-320, 2017. ,
Solving the 3-staged 2-dimensional cutting stock problem by dynamic programming and variable neighborhood search, Electronic Notes in Discrete Mathematics, vol.47, pp.133-140, 2015. ,
Dynamic Aggregation of Set-Partitioning Constraints in Column Generation, Operations Research, vol.53, issue.4, pp.632-645, 2005. ,
A Branch-and-Price Algorithm for the Bin Packing Problem with Conflicts, INFORMS Journal on Computing, vol.23, issue.3, pp.404-415, 2011. ,
Staff scheduling and rostering: A review of applications, methods and models, European Journal of Operational Research, vol.153, issue.1, pp.3-27, 2004. ,
A note on branchand-cut-and-price, Operations Research Letters, vol.38, issue.5, pp.346-353, 2010. ,
Algorithms for the Bin Packing Problem with Conflicts, INFORMS Journal on Computing, vol.22, pp.401-415, 2010. ,
The feasibility pump, Mathematical Programming, vol.104, issue.1, pp.91-104, 2005. ,
Local branching, Mathematical Programming, vol.98, issue.1, pp.23-47, 2003. ,
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Lecture Notes in Computer Science, vol.6140, pp.136-140, 2010. ,
0-1 reformulations of the multicommodity capacitated network design problem, Discrete Applied Mathematics, vol.157, issue.6, pp.1229-1241, 2009. ,
A stabilized structured Dantzig-Wolfe decomposition method, Mathematical Programming, vol.140, issue.1, pp.45-76, 2013. ,
Integrated production and outbound distribution scheduling problems with job release dates and deadlines, Journal of Scheduling, vol.21, issue.4, pp.443-460, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01351929
Solving the freight car flow problem to optimality, Electronic Notes in Theoretical Computer Science, vol.66, issue.6, pp.42-52, 2002. ,
Robust branch-and-cut-and-price for the capacitated vehicle routing problem, Mathematical Programming, vol.106, issue.3, pp.491-511, 2006. ,
A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size, European Journal of Operational Research, vol.218, issue.1, pp.251-260, 2012. ,
Modeling two-dimensional guillotine cutting problems via integer programming, INFORMS Journal on Computing, vol.28, issue.4, pp.736-751, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01492005
Decomposition methods for integer linear programming, 2009. ,
Experiments with a generic Dantzig-Wolfe decomposition for integer programs, Experimental Algorithms, 2010. ,
, of Lecture Notes in Computer Science, vol.6049, pp.239-252
A new branching strategy for time constrained routing problems with application to backhauling, Annals of Operations Research, vol.61, issue.1, pp.91-109, 1995. ,
Time-dependent routing problems: A review, Computers and Operations Research, vol.64, pp.189-197, 2015. ,
Heuristics and lower bounds for the bin packing problem with conflicts, Computers and Operations Research, vol.31, issue.3, pp.347-358, 2004. ,
Heuristiques basées sur la génération de colonnes pour un problème de planification du personnel, 2015. ,
Column generation based approaches for a tour scheduling problem with a multi-skill heterogeneous workforce, European Journal of Operational Research, vol.252, issue.3, pp.1019-1030, 2016. ,
The distributionally robust chance constrained vehicle routing problem, 2018. ,
Multistage cutting stock problems of two and more dimensions, Operations Research, vol.13, issue.1, pp.94-120, 1965. ,
Convex nondifferentiable optimization: A survey focused on the analytic center cutting plane method, Optimization Methods and Software, vol.17, issue.5, pp.805-867, 2002. ,
New developments in the primaldual column generation technique, European Journal of Operational Research, vol.224, issue.1, pp.41-51, 2013. ,
An adaptive memory programming framework for the robust capacitated vehicle routing problem, Transportation Science, vol.50, issue.4, pp.1239-1260, 2016. ,
The robust capacitated vehicle routing problem under demand uncertainty, Operations Research, vol.61, issue.3, pp.677-693, 2013. ,
Dual inequalities for stabilized column generation revisited, INFORMS Journal on Computing, vol.28, issue.1, pp.175-194, 2016. ,
Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems, European Journal of Operational Research, vol.266, issue.2, pp.521-530, 2018. ,
Gurobi optimizer reference manual, 2017. ,
A hybrid genetic algorithm for the twodimensional single large object placement problem, European Journal of Operational Research, vol.183, issue.3, pp.1150-1166, 2007. ,
Limited discrepancy search, Proceedings of the 14th international joint conference on Artificial intelligence (IJCAI'95), vol.1, pp.607-615, 1995. ,
Maximum-weight stable sets and safe lower bounds for graph coloring, Mathematical Programming Computation, vol.4, issue.4, pp.363-381, 2012. ,
A matheuristic based on lagrangian relaxation for the multi-activity shift scheduling problem, European Journal of Operational Research, vol.272, issue.3, pp.859-867, 2019. ,
Stabilized branch-and-price algorithms for vector packing problems, European Journal of Operational Research, vol.271, issue.2, pp.401-419, 2018. ,
Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem, Computers and Operations Research, vol.34, issue.9, pp.2657-2673, 2007. ,
Improved empty freight car distribution, Transportation Science, vol.32, issue.2, pp.163-173, 1998. ,
A dynamic programming algorithm for the shortest path problem with time windows and linear node costs, Networks, vol.31, issue.3, pp.193-204, 1998. ,
Resource extension functions: properties, inversion, and generalization to segments, OR Spectrum, vol.30, issue.1, pp.113-148, 2008. ,
Shortest Path Problems with Resource Constraints, pp.33-65, 2005. ,
Path-reduced costs for eliminating arcs in routing and scheduling, INFORMS Journal on Computing, vol.22, issue.2, pp.297-313, 2010. ,
An approximation scheme for bin packing with conflicts, Journal of Combinatorial Optimization, vol.3, issue.4, pp.363-377, 1999. ,
Subset-row inequalities applied to the vehicle-routing problem with time windows, Operations Research, vol.56, issue.2, pp.497-511, 2008. ,
Column generation based primal heuristics, Electronic Notes in Discrete Mathematics, vol.36, pp.695-702, 2010. ,
URL : https://hal.archives-ouvertes.fr/hal-00790610
New lower bounds for bin packing problems with conflicts, European Journal of Operational Research, vol.206, issue.2, pp.281-288, 2010. ,
URL : https://hal.archives-ouvertes.fr/inria-00522668
Structure detection in mixed-integer programs, INFORMS Journal on Computing, vol.30, issue.3, pp.570-587, 2018. ,
Novel formulations and modeling enhancements for the dynamic berth allocation problem, European Journal of Operational Research, vol.278, issue.1, pp.170-185, 2019. ,
A branch and bound algorithm for the capacitated vehicle routing problem, Operations-Research-Spektrum, vol.5, issue.2, pp.77-85, 1983. ,
Chebyshev center based column generation, Discrete Applied Mathematics, vol.159, issue.18, pp.2251-2265, 2011. ,
A short note on the robust combinatorial optimization problems with cardinality constrained uncertainty, 4OR, vol.12, issue.4, pp.373-378, 2014. ,
New variants of bundle methods, Mathematical Programming, vol.69, issue.1, pp.111-147, 1995. ,
A branch-andcut-and-price algorithm for the capacitated location-routing problem, Book of abstracts of the Tenth Triennial Symposium on Ttransportation Analysis TRISTAN X, 2019. ,
A computational study of search strategies for mixed integer programming, INFORMS Journal on Computing, vol.11, issue.2, pp.173-187, 1999. ,
Vehicle scheduling in public transit and lagrangean pricing, Management Science, vol.44, issue.12, pp.1637-1649, 1998. ,
On an exact method for the constrained shortest path problem, Computers & Operations Research, vol.40, issue.1, pp.378-384, 2013. ,
Primal heuristics for branch-and-price algorithms, Operations Research Proceedings, pp.65-70, 2011. ,
Selected topics in column generation, Operations Research, vol.53, issue.6, pp.1007-1023, 2005. ,
CVRPSEP: a package of separation routines for the capacitated vehicle routing problem, vol.18, 2003. ,
Arc-flow model for the twodimensional guillotine cutting stock problem, Computers and Operations Research, vol.37, issue.6, pp.991-1001, 2010. ,
On the kidney exchange problem: cardinality constrained cycle and chain problems on directed graphs: a survey of integer programming approaches, Journal of Combinatorial Optimization, vol.33, issue.1, pp.35-59, 2017. ,
A decomposition-based pricing procedure for large-scale linear programs: An application to the linear multicommodity flow problem, Management Science, vol.46, issue.5, pp.693-709, 2000. ,
An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem, 2019. ,
URL : https://hal.archives-ouvertes.fr/hal-02112287
Polyhedral Characterization of Discrete Dynamic Programming, Operations Research, vol.38, issue.1, pp.127-138, 1990. ,
Efficient elementary and restricted nonelementary route pricing, European Journal of Operational Research, vol.239, issue.1, pp.102-111, 2014. ,
The robust vehicle routing problem with time windows: Compact formulation and branch-price-and-cut method, Transportation Science, vol.53, issue.4, pp.1043-1066, 2019. ,
A study of the bienstock-zuckerberg algorithm: applications in mining and resource constrained project scheduling, Computational Optimization and Applications, vol.69, issue.2, pp.501-534, 2018. ,
Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows, Mathematical Programming, vol.142, issue.1-2, pp.47-82, 2013. ,
Nonsmooth dual methods in integer programming, 2000. ,
A polyhedral approach to edge coloring, Operations Research Letters, vol.10, issue.6, pp.315-322, 1991. ,
The stochastic vehicle routing problem, a literature review, part i: models, EURO Journal on Transportation and Logistics, vol.7, issue.3, pp.193-221, 2018. ,
A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints, Discrete Optimization, vol.33, pp.146-168, 2019. ,
Algorithms for non-linear and stochastic resource constrained shortest path, Mathematical Methods of Operations Research, vol.89, issue.2, pp.281-317, 2019. ,
New enhancements for the exact solution of the vehicle routing problem with time windows, INFORMS Journal on Computing, vol.29, issue.3, pp.489-502, 2017. ,
Improved branch-cut-and-price for capacitated vehicle routing, Mathematical Programming Computation, vol.9, issue.1, pp.61-100, 2017. ,
Limited memory rank-1 cuts for vehicle routing problems, Operations Research Letters, vol.45, issue.3, pp.206-209, 2017. ,
Comparative analysis of capacitated arc routing formulations for designing a new branch-cut-and-price algorithm, Transportation Science accepted, 2019. ,
Feasibility pump heuristics for column generation approaches, Experimental Algorithms, vol.7276, pp.332-343, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-00686255
Robust branch-cut-and-price algorithms for vehicle routing problems, The Vehicle Routing Problem: Latest Advances and New Challenges, 2008. ,
, of Operations Research/Computer Science Interfaces, vol.43, pp.297-325
Branch-and-cut-and-price for the robust capacitated vehicle routing problem with knapsack uncertainty, Cadernos do LOGIS, issue.1, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01958184
Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems, European Journal of Operational Research, vol.270, issue.2, pp.530-543, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01664844
In-out separation and column generation stabilization by dual price smoothing, Lecture Notes in Computer Science, vol.7933, pp.354-365, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-00750412
Automation and combination of linear-programming based stabilization techniques in column generation, INFORMS Journal on Computing, vol.30, issue.2, pp.339-360, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01077984
A generic exact solver for vehicle routing and related problems, Integer Programming and Combinatorial Optimization, vol.11480, pp.354-369, 2019. ,
URL : https://hal.archives-ouvertes.fr/hal-02178171
A generic exact solver for vehicle routing and related problems. Cadernos do LOGIS, 2019. ,
URL : https://hal.archives-ouvertes.fr/hal-02178171
Robust constrained shortest path problems under budgeted uncertainty, Networks, vol.66, issue.2, pp.98-111, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01229790
Chvátal-Gomory Rank-1 Cuts Used in a Dantzig-Wolfe Decomposition of the Vehicle Routing Problem with Time Windows, pp.397-419, 2008. ,
The knapsack problem with conflict graphs, Journal of Graph Algorithms and Applications, vol.13, issue.2, pp.233-249, 2009. ,
Production Planning Using Mixed Integer Programming, 2006. ,
An exact method with variable fixing for solving the generalized assignment problem, Computational Optimization and Applications, vol.52, pp.629-644, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-01320026
A Branch and Bound Algorithm for the Total Weighted Tardiness Problem, Operations Research, vol.33, issue.2, pp.363-377, 1985. ,
Models and algorithms for three-stage twodimensional bin packing, European Journal of Operational Research, vol.183, issue.3, pp.1304-1327, 2007. ,
URL : https://hal.archives-ouvertes.fr/hal-01224921
Evolutionary Computation in Combinatorial Optimization, pp.165-176, 2004. ,
Branch-and-price for personalized multiactivity tour scheduling, INFORMS Journal on Computing, vol.28, issue.2, pp.334-350, 2016. ,
Combining benders decomposition and column generation for multi-activity tour scheduling, Computers and Operations Research, vol.93, pp.151-165, 2018. ,
Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints, Discrete Optimization, vol.3, issue.3, pp.255-273, 2006. ,
Dynamic ng-path relaxation for the delivery man problem, Transportation Science, vol.48, issue.3, pp.413-424, 2014. ,
An integer optimality condition for column generation on zero-one linear programs, Discrete Optimization, vol.31, pp.79-92, 2019. ,
Branching decisions in branch-and-cut-and-price algorithms for vehicle routing problems. Presentation in Column Generation, 2012. ,
An evolutionary algorithm for polishing mixed integer programming solutions, INFORMS Journal on Computing, vol.19, issue.4, pp.534-541, 2007. ,
Interior point stabilization for column generation, Operations Research Letters, vol.35, issue.5, pp.660-668, 2007. ,
URL : https://hal.archives-ouvertes.fr/hal-01311478
Computer Scheduling of Public Transport Urban Passenger Vehicle and Crew Scheduling, pp.269-280, 1981. ,
A dominant class of schedules for malleable jobs in the problem to minimize the total weighted completion time, Computers and Operations Research, vol.39, issue.6, pp.1265-1270, 2012. ,
Scheduling incoming and outgoing trucks at cross docking terminals to minimize the storage cost, Annals of Operations Research, vol.201, issue.1, pp.423-440, 2012. ,
URL : https://hal.archives-ouvertes.fr/inria-00539849
The prominence of stabilization techniques in column generation: the case of freight transportation, Sixth International Workshop on Freight Transportation and Logistics, pp.87-90, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01248323
Solving a freight railcar flow problem arising in russia, 13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, vol.33, pp.55-67, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-00857914
A bucket graph based labeling algorithm with application to vehicle routing, Cadernos do LOGIS 2017/7, Universidade Federal Fluminense, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01664854
Column generation for extended formulations, Electronic Notes in Discrete Mathematics, vol.37, pp.357-362, 2011. ,
URL : https://hal.archives-ouvertes.fr/hal-00661758
Bin packing with conflicts: A generic branchand-price algorithm, INFORMS Journal on Computing, vol.25, issue.2, pp.244-255, 2013. ,
Column generation for extended formulations, EURO Journal on Computational Optimization, vol.1, issue.1-2, pp.81-115, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-00661758
Primal heuristics for branch-and-price: the assets of diving methods, INFORMS Journal on Computing, vol.31, issue.2, pp.251-267, 2019. ,
URL : https://hal.archives-ouvertes.fr/hal-01237204
Column generation based heuristic for the generalized assignment problem, Simpósio Brasileiro de Pesquisa Operacional. Porto de Galinhas, pp.3624-3631, 2015. ,
Integer programming and constraint programming in solving a multimachine assignment scheduling problem with deadlines and release dates, INFORMS Journal on Computing, vol.18, issue.2, pp.209-217, 2006. ,
Preprocessing and probing techniques for mixed integer programming problems, ORSA Journal on Computing, vol.6, issue.4, pp.445-454, 1994. ,
A survey of the standard location-routing problem, Annals of Operations Research, vol.259, issue.1, pp.389-414, 2017. ,
Solving rcpsp/max by lazy clause generation, Journal of Scheduling, vol.16, issue.3, pp.273-289, 2013. ,
The robust machine availability problembin packing under uncertainty, 2018. ,
Robust optimization of a broad class of heterogeneous vehicle routing problems under demand uncertainty, 2018. ,
A robust optimization approach for the capacitated vehicle routing problem with demand uncertainty, IIE Transactions, vol.40, issue.5, pp.509-523, 2008. ,
, , pp.687-701, 2018.
New benchmark instances for the capacitated vehicle routing problem, European Journal of Operational Research, vol.257, issue.3, pp.845-858, 2017. ,
Exact solution of bin-packing problems using column generation and branch-and-bound, Annals of Operations Research, vol.86, pp.629-659, 1999. ,
Time-indexed formulations for machine scheduling problems: Column generation, INFORMS Journal on Computing, vol.12, issue.2, pp.111-124, 2000. ,
On Dantzig-Wolfe decomposition in integer programming and ways to perform branching in a branch-and-price algorithm, Operations Research, vol.48, issue.1, pp.111-128, 2000. ,
URL : https://hal.archives-ouvertes.fr/inria-00342641
A nested decomposition approach to a three-stage, twodimensional cutting-stock problem, Management Science, vol.47, issue.6, pp.864-879, 2001. ,
URL : https://hal.archives-ouvertes.fr/inria-00342635
Implementing mixed integer column generation, Column Generation, pp.331-358, 2005. ,
URL : https://hal.archives-ouvertes.fr/inria-00342630
Branching in branch-and-price: a generic scheme, Mathematical Programming, vol.130, issue.2, pp.249-294, 2011. ,
URL : https://hal.archives-ouvertes.fr/inria-00311274
BaPCod -a generic Branch-And-Price Code, 2017. ,
A generic view of Dantzig-Wolfe decomposition in mixed integer programming, Operations Research Letters, vol.34, issue.3, pp.296-306, 2006. ,
URL : https://hal.archives-ouvertes.fr/inria-00342623
Reformulation and decomposition of integer programs, 50 Years of Integer Programming, pp.431-502, 1958. ,
URL : https://hal.archives-ouvertes.fr/inria-00392254
A unified solution framework for multi-attribute vehicle routing problems, European Journal of Operational Research, vol.234, issue.3, pp.658-673, 2014. ,
Column generation for the integrated berth allocation, quay crane assignment, and yard assignment problem, Transportation Science, vol.52, issue.4, pp.812-834, 2018. ,
A new branch-and-price-and-cut algorithm for one-dimensional bin-packing problems, INFORMS Journal on Computing accepted, 2019. ,
Weighted dantzig-wolfe decomposition for linear mixed-integer programming, International Transactions in Operational Research, vol.4, issue.2, pp.151-162, 1997. ,
A path relinking approach with ejection chains for the generalized assignment problem, European Journal of Operational Research, vol.169, issue.2, pp.548-569, 2006. ,
Routing optimization with time windows under uncertainty, Mathematical Programming, vol.175, issue.1, pp.263-305, 2019. ,