Listar Institut de Mathématiques de Bordeaux (IMB) - UMR 5251 por disciplina "Informatique [cs]/Recherche opérationnelle [cs.RO]"
Mostrando ítems 21-40 de 216
-
A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
(Mathematical Programming, Series A. pp. 55-84, 2006-01)Article de revue -
A multi-item production planning model with setup times: algorithms, reformulations, and polyhedral characterizations for a special case
(Mathematical Programming. pp. 71-90, 2003-01)Article de revue -
On the polyhedral structure of a multi–item production planning model with setup times
(Mathematical Programming. pp. 375-405, 2003-01)Article de revue -
A Combinatorial Active Set Algorithm for Linear and Quadratic Programming
Document de travail - Pré-publication -
A Parallel Macro Partitioning Framework for Solving Mixed Integer Programs
Communication dans un congrès -
Tight formulations for some simple mixed integer programs and convex objective integer programs
(Mathematical Programming, Series A. pp. 73-88, 2003-09)Article de revue -
A Polynomial Time Algorithm for the Stochastic Uncapacitated Lot-Sizing Problem with Backlogging
Communication dans un congrès -
A Computational Analysis of Lower Bounds for Big Bucket Production Planning Problems
Document de travail - Pré-publication -
Coordination of a two-level supply chain with contracts
(4OR: A Quarterly Journal of Operations Research. vol. 19, n° 2, pp. 235-264, 2021-06)Article de revue -
Non-Robust Strong Knapsack Cuts for Capacitated Location-Routing and Related Problems
Communication dans un congrès -
New route formulations for the Split-Delivery Vehicle Routing Problems
Communication dans un congrès -
Tutorial: The power of non-robust cuts in branch-cut-and-price algorithms
Communication dans un congrès -
A heuristic approach for big bucket multi-level production planning problems
(European Journal of Operational Research. pp. 396-411, 2009-01)Article de revue -
Polynomial-Time Algorithms for Stochastic Uncapacitated Lot-Sizing Problems
(Operations Research. pp. 1172-1183, 2008-09)Article de revue -
Optimal Allocation of Surgery Blocks to Operating Rooms Under Uncertainty
(Operations Research. vol. 58, pp. 802-816, 2010)Article de revue -
New exact and heuristic algorithms to solve the prize-collecting job sequencing problem with one common and multiple secondary resources
(European Journal of Operational Research, 2022)Article de revue -
Towards a generic branch-and-price solver: progress report
Communication dans un congrès -
Reformulation and Decomposition of Integer Programs
(Springer, 2010)Chapitre d'ouvrage