Bibliography

Major publications by the team in recent years

1O. Briant, C. Lemaréchal, P. Meurdesoif, S. Michel, N. Perrot, F. Vanderbeck.

Comparison of Bundle and Classical Column Generation, in: Mathematical Programming, 2008, vol. 113, n^o 2, p. 299–344.
2M. Constantino, A. J. Miller, M. Van Vyve.

Mixing MIR Inequalities with Two Divisible Coefficients, in: Mathematical Programming, Series A, 2010, vol. 123, p. 451-483. [ DOI : 10.1007/s10107-009-0266-9 ]

http://hal.inria.fr/hal-00387098/en
3S. Coulonges, A. Pêcher, A. Wagler.

Characterizing and bounding the imperfection ratio for some classes of graphs, in: Mathematical Programming, Series A, 2009, vol. 118, n^o 1, p. 37-46.

http://hal.archives-ouvertes.fr/hal-00308150/en/
4F. Eisenbrand, G. Oriolo, G. Stauffer, P. Ventura.

The stable set polytope of quasi-line graphs, in: Combinatorica, 2008, vol. 28, n^o 1, p. 45-67.
5L. Gouveia, P. Pesneau.

On extended formulations for the precedence constrained asymmetric traveling salesman problem, in: Networks, 2006, vol. 48, n^o 6, p. 77–89.
6A. Pêcher, A. Wagler.

Almost all webs are not rank-perfect, in: Mathematical Programming, 2006, vol. 105, n^o 2-3, p. 311–328.
7R. Sadykov, L. A. Wolsey.

Integer Programming and Constraint Programming in Solving a Multimachine Assignment Scheduling Problem with Deadlines and Release Dates, in: INFORMS Journal on Computing, 1 2006, vol. 18, n^o 2, p. 209–217.
8F. Vanderbeck.

On Dantzig-Wolfe decomposition in integer programming and ways to perform branching in a branch-and-price algorithm, in: Operations Research, 2000, vol. 48, n^o 1, p. 111–128.
9F. Vanderbeck.

Branching in Branch-and-Price: a Generic Scheme, in: Mathematical Programming, Series A, 2011, vol. 130, p. 249-294. [ DOI : 10.1007/s10107-009-0334-1 ]

http://hal.inria.fr/inria-00311274
10F. Vanderbeck.

Computational Study of a Column Generation algorithm for Bin Packing and Cutting Stock problems, in: Mathematical Programming, Ser. A, 1999, vol. 86, p. 565–594.

Publications of the year

Articles in International Peer-Reviewed Journals

11C. Joncour, A. Pêcher.

Consecutive ones matrices for multi-dimensional orthogonal packing problems, in: Journal of Mathematical Modelling and Algorithms, 2012, vol. 11, n^o 1, p. 23-44. [ DOI : 10.1007/s10852-011-9167-z ]

http://hal.inria.fr/hal-00652574
12C. Joncour, A. Pêcher, P. Valicov.

MPQ-trees for the orthogonal packing problem, in: Journal of Mathematical Modelling and Algorithms, March 2012, vol. 11, n^o 1, p. 3-22. [ DOI : 10.1007/s10852-011-9159-z ]

http://hal.inria.fr/hal-00611528
13S. Michel, F. Vanderbeck.

A Column Generation based Tactical Planning Method for Inventory Routing, in: Operations Research, 2012, vol. 60, n^o 2, p. 382-397.

http://hal.inria.fr/inria-00169311
14A. J. Miller, K. Akartunali.

A computational analysis of lower bounds for big bucket production planning problems, in: Computational Optimization and Applications, 2012, vol. 53, p. 729-753.

http://hal.inria.fr/hal-00769669
15G. Oriolo, U. Pietropaoli, G. Stauffer.

On the recognition of fuzzy circular interval graphs, in: Discrete Mathematics, April 2012, vol. 312, n^o 8.

http://hal.inria.fr/hal-00761799
16A. Pêcher, A. Wagler.

Computing clique and chromatic number of circular-perfect graphs in polynomial time, in: Mathematical Programming A, 2012, to appear.

http://hal.inria.fr/hal-00760621
17A. Pêcher, A. Wagler.

Polynomial time computability of some graph parameters for superclasses of perfect graphs, in: International Journal of Mathematics in Operational Research, 2012, vol. 4, n^o 3, p. 263-275. [ DOI : 10.1504/IJMOR.2012.046687 ]

http://hal.inria.fr/inria-00560144
18R. Sadykov.

A dominant class of schedules for malleable jobs in the problem to minimise the total weighted completion time, in: Computers and Operations Research, 2012, vol. 39, n^o 6, p. 1265-1270. [ DOI : 10.1016/j.cor.2011.02.023 ]

http://hal.inria.fr/inria-00539875
19R. Sadykov.

Scheduling incoming and outgoing trucks at cross docking terminals to minimize the storage cost, in: Annals of Operations Research, 2012, vol. 201, n^o 1, p. 423-440. [ DOI : 10.1007/s10479-012-1232-0 ]

http://hal.inria.fr/inria-00539849
20R. Sadykov, F. Vanderbeck.

Bin Packing with conflicts: a generic branch-and-price algorithm, in: INFORMS Journal on Computing, 2012, to appear. [ DOI : 10.1287/ijoc.1120.0499 ]

http://hal.inria.fr/inria-00539869
21R. Sadykov, F. Vanderbeck.

Column Generation for Extended Formulations, in: EURO Journal on Computational Optimization, December 2012.

http://hal.inria.fr/hal-00661758
22G. Stauffer.

Using the economical order quantity formula for inventory control in one-warehouse multiretailer systems, in: Naval Research Logistics, April 2012, vol. 59, n^o 3-4.

http://hal.inria.fr/hal-00761817

Invited Conferences

23J. Han, P. Pesneau, A. Pessoa, E. Uchoa, F. Vanderbeck.

Column Generation Stabilization using Dual Smoothing: Theory & Practice, in: Column Generation 2012, Bromont, Canada, June 2012.

http://hal.inria.fr/hal-00750573
24A. Pêcher.

How unique is Lovasz's theta function?,, in: 2012 International Conference on Graph Theory, Combinatorics and Applications, Jinhua, Chine, October 2012.

http://hal.inria.fr/hal-00760631
25F. Vanderbeck, J. Han, P. Pesneau, A. Pessoa, R. Sadykov, E. Uchoa.

Unifying procedures for Cut-Column Generation and Stabilization, in: Workshop on Integer Programming, Valparaiso, Chili, March 2012.

http://hal.inria.fr/hal-00750579

International Conferences with Proceedings

26Y. Faenza, G. Oriolo, G. Stauffer.

Separating stable sets in claw-free graphs via Padberg-Rao and compact linear programs, in: ACM-SIAM Symposium on Discrete Algorithms, Kyoto, Japon, January 2012.

http://hal.inria.fr/hal-00648011
27P. Pesneau, R. Sadykov, F. Vanderbeck.

Feasibility Pump Heuristics for Column Generation Approaches, in: 11th International Symposium on Experimental Algorithms, Bordeaux, France, LNCS series, Springer, June 2012.

http://hal.inria.fr/hal-00686255

Conferences without Proceedings

28M. Poggi, D. Pecin, M. Reis, C. Ferreira, K. Neves, R. Sadykov, F. Vanderbeck.

Equipment/Operator task scheduling with BAPCOD, in: Column Generation 2012, Bromont, Canada, June 2012.

http://hal.inria.fr/hal-00750575
29F. Vanderbeck, J. Han, P. Pesneau, A. Pessoa, R. Sadykov, E. Uchoa.

Column Generation Stabilization using Dual Smoothing: Theory and Practice, in: Informs Annual Meeting: Informatics Rising, Phoenix, États-Unis, October 2012.

http://hal.inria.fr/hal-00750576
30F. Vanderbeck, C. Joncour, S. Michel, P. Pesneau, A. Pessoa, M. Poggi, R. Sadykov, E. Uchoa.

Primal heuristics for branch-and-price, in: 21th International Symposium on Mathematical Programming (ISMP 2012), Berlin, Allemagne, August 2012.

http://hal.inria.fr/hal-00750578

Scientific Books (or Scientific Book chapters)

31P. Belotti, S. Cafieri, J. Lee, L. Liberti, A. J. Miller.

On the Composition of Convex Envelopes for Quadrilinear Terms, in: Optimization, Simulation, and Control, Springer Verlag, 2013, p. 1-16.

http://hal.inria.fr/hal-00769671

Internal Reports

32A. Pessoa, R. Sadykov, E. Uchoa, F. Vanderbeck.

In-Out Separation and Column Generation Stabilization by Dual Price Smoothing, Inria, October 2012.

http://hal.inria.fr/hal-00750412

References in notes

33P. Baptiste, R. Sadykov.

On Scheduling a Single Machine to Minimize a Piecewise Linear Objective Function : A Compact MIP Formulation, in: Naval Research Logistics / Naval Research Logistics An International Journal, 2009, vol. 56, n^o 6, p. 487–502.

http://hal.inria.fr/inria-00387012/en/
34P. Baptiste, R. Sadykov.

Time Indexed Formulations for Scheduling Chains on a Single Machine: An Application to Airborne Radars, in: European Journal of Operational Research, 2009.

http://hal.inria.fr/inria-00339639/en/
35M. Constantino, A. J. Miller, M. Van Vyve.

Mixing MIR Inequalities with Two Divisible Coefficients, in: Mathematical Programming, Series A, 2009, p. 1–1.

http://hal.archives-ouvertes.fr/hal-00387098/en/
36G. Dahl, D. Huygens, A. R. Mahjoub, P. Pesneau.

On the $k$ -edge disjoint 2-hop-constrained paths polytope, in: Operations Research Letters, 2005, vol. 34, p. 577–582.
37B. Denton, A. J. Miller, H. Balasubramanian, T. Huschka.

Optimal Allocation of Surgery Blocks to Operating Rooms Under Uncertainty, in: Operations Research, 2009, p. 1–1.

http://hal.archives-ouvertes.fr/hal-00386469/en/
38Y. Faenza, G. Oriolo, G. Stauffer.

An Algorithmic Decomposition of Claw-free Graphs Leading to an O( $n^{3}$ )-algorithm for the Weighted Stable Set Problem, in: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA) 2011, United States San Francisco, SIAM, September 2010.

http://hal.inria.fr/inria-00463671/en
39B. Fortz, A. R. Mahjoub, S. T. McCormick, P. Pesneau.

Two-edge connected subgraphs with bounded rings: polyhedral results and branch-and-cut, in: Mathematical Programming, 2006, vol. 105, n^o 1, p. 85–111.
40M. T. Godinho, L. Gouveia, T. L. Magnanti, P. Pesneau, J. Pires.

On a Time-Dependent Model for the Unit Demand Vehicle Routing Problem, Centro de Investigacao Operacional da Universidade de Lisboa, 2007, n^o 11-2007.
41M. T. Godinho, L. Gouveia, T. L. Magnanti, P. Pesneau, J. Pires.

On Time-Dependent Model for Unit Demand Vehicle Routing Problems, in: International Conference on Network Optimization, INOC, International Network Optimization Conference (INOC), 2007.
42Y. Guan, S. Ahmed, A. J. Miller, G. Nemhauser.

On formulations of the stochastic uncapacitated lot-sizing problem, in: Operations Research Letters, 2006, vol. 34, p. 241-250.
43Y. Guan, S. Ahmed, G. Nemhauser, A. J. Miller.

A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem, in: Mathematical Programming, 2006, vol. 105, p. 55-84.
44L. Gély, G. Dessagne, P. Pesneau, F. Vanderbeck.

A multi scalable model based on a connexity graph representation, in: 11th International Conference on Computer Design and Operation in the Railway and Other Transit Systems COMPRAIL'08, Toledo, Spain, September 2008.
45Y. Hendel, R. Sadykov.

Timing problem for scheduling an airborne radar, in: Proceedings of the 11th International Workshop on Project Management and Scheduling, Istanbul, Turkey, April 2008, p. 132-135.
46D. Huygens, M. Labbé, A. R. Mahjoub, P. Pesneau.

The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut, in: Networks, 2007, vol. 49, n^o 1, p. 116-133.
47D. Huygens, A. R. Mahjoub, P. Pesneau.

Two edge-disjoint hop-constrained paths and polyhedra, in: SIAM Journal of Discrete Mathematics, 2004, vol. 18, n^o 2, p. 287–312.
48C. Joncour.

Problèmes de placement 2D et application à l ordonnancement : modélisation par la théorie des graphes et approches de programmation mathématique, University Bordeaux I, December 2010.
49C. Joncour, S. Michel, R. Sadykov, D. Sverdlov, F. Vanderbeck.

Column Generation based Primal Heuristics, in: Submitted to ISCO 2010, 2010.
50C. Joncour, A. Pêcher, P. Pesneau, F. Vanderbeck.

Mathematical programming formulations for the orthogonal 2d knapsack problem, in: Livre des résumé du 9ème Congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, February 2008, p. 255–256.

http://hal.archives-ouvertes.fr/hal-00307152/en/
51P. Meurdesoif, P. Pesneau, F. Vanderbeck.

Meter installation for monitoring network traffic, in: International Conference on Network Optimization, INOC, International Network Optimization Conference (INOC), 2007.
52P. Meurdesoif, P. Pesneau, F. Vanderbeck.

A Branch-and-Cut algorithm to optimize sensor installation in a network, in: Graph and Optimization Meeting GOM2008, France Saint-Maximin, 2008.
53S. Michel.

Optimisation des tournées de véhicules combinées à la gestion de stock, Université Bordeaux 1, Dec 2006.
54S. Michel, N. Perrot, F. Vanderbeck.

Knapsack Problems with Setups, in: European Journal of Operational Research, 2009, vol. 196, p. 909-918.

http://hal.inria.fr/inria-00232782/en/
55S. Michel, F. Vanderbeck.

A Column Generation based Tactical Planning Method for Inventory Routing, Inria, 2008.

http://hal.inria.fr/inria-00169311/en/
56M. Mourgaya, F. Vanderbeck.

The Periodic Vehicle Routing Problem: classification and heuristic, in: RAIRO-OR, April-June 2006, vol. 40, n^o 2, p. 169–194.
57M. Mourgaya, F. Vanderbeck.

Column generation based heuristic for tactical planning in multi period vehicle routing, in: European Journal of Operational Research, 2007, vol. 183, n^o 3, p. 1028-1041.
58G. Oriolo, U. Pietropaoli, G. Stauffer.

A new algorithm for the maximum weighted stable set problem in claw-free graphs, in: Lecture notes in computer science. Proceedings of the 13th IPCO Conference, 2008.

http://hal.inria.fr/inria-00442281
59M. Padberg, G. Rinaldi.

A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems, in: SIAM Review, 1991, vol. 33, n^o 1, p. 60–100.
60N. Perrot.

Advanced IP column generation strategies for the cutting stock stock problem and its variants, University Bordeaux 1, 2005.
61A. Pêcher, A. Wagler.

Almost all webs are not rank-perfect, in: Mathematical Programming, 2006, vol. 105, p. 311–328.
62R. Sadykov.

A branch-and-check algorithm for minimizing the sum of the weights of the late jobs on a single machine with release dates, in: European Journal of Operations Research, 2008, vol. 189, n^o 3, p. 1284–1304.

http://dx.doi.org/10.1016/j.ejor.2006.06.078
63R. Sadykov.

A polynomial algorithm for a simple scheduling problem at cross docking terminals, Inria, 2009, RR-7054.

http://hal.inria.fr/inria-00412519/en/
64R. Sadykov.

On scheduling malleable jobs to minimise the total weighted completion time, in: 13th IFAC Symposium on Information Control Problems in Manufacturing, Russie Moscow, 2009.

http://hal.inria.fr/inria-00339646/en/
65G. Stauffer.

The p-median Polytope of Y-free Graphs: An Application of the Matching Theory, in: Operations Research Letters, 2008.

http://hal.inria.fr/inria-00442282
66A. Sutter, F. Vanderbeck, L. A. Wolsey.

Optimal Placement of Add/Drop Multiplexers: Heuristic and Exact Algorithms, in: Operations Research, 1998, vol. 46, n^o 5, p. 719–728.
67F. Vanderbeck.

Exact algorithm for minimising the number of setups in the one-dimensional cutting stock problem, in: Operations Research, 2000, vol. 48, n^o 5, p. 915–926.
68F. Vanderbeck.

A nested decomposition approach to a 3-stage 2-dimensional cutting stock problem, in: Management Science, 2001, vol. 47, n^o 2, p. 864–879.
69F. Vanderbeck.

Extending Dantzig's Bound to the Bounded Multiple-class Knapsack Problem, in: Mathematical Programming, Ser. A, 2002, vol. 94, n^o 1, p. 125–136.
70F. Vanderbeck.

Lot-sizing with start-up times, in: Management Science, 1998, vol. 44, n^o 10, p. 1409–1425.
71F. Vanderbeck.

Computational study of a column generation algorithm for bin packing and cutting stock problems, in: Mathematical Programming, Ser. A, 1999, vol. 86, p. 565–594.
72B. Vignac, B. Jaumard, F. Vanderbeck.

An Hierarchical Optimization approach to Optical Network Design where Traffic Grooming and Routing is Solved by Column Generation, 2008, submitted to INOC 2009.
73B. Vignac, B. Jaumard, F. Vanderbeck.

Hierarchical Optimization Procedure for Traffic Grooming in WDM Optical Networks, 2008, submitted to IEEE conference ONDM2009.
74B. Vignac, B. Jaumard, F. Vanderbeck.

Hierarchical Heuristic for the GRWA Problem in WDM Networks with Delay Constraints, Inria, 2009, 18 p.

http://hal.inria.fr/inria-00415513/en/
75B. Vignac, F. Vanderbeck, B. Jaumard.

Nested Decomposition Approach to an Optical Network Design Problem, Inria, 2009, 18 p.

http://hal.inria.fr/inria-00415500/en/
76B. Vignac, F. Vanderbeck, B. Jaumard.

Reformulation and Decomposition Approaches for Traffic Routing in Optical Networks, Inria, 2009, 36 p.

http://www.math.u-bordeaux.fr/~fv/papers/grwaWP.pdf, http://hal.inria.fr/inria-00392256/en/
77B. Vignac.

Résolution d'un problème de groupage dans le réseaux optiques maillés, Université de Montréal, January 2010.

Previous |

Home