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. 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.
6Y. Guan, A. Miller.

Polynomial-Time Algorithms for Stochastic Uncapacitated Lot-Sizing Problems, in: Operations Research, 2008, vol. 56, n^o 2, p. 1172–1183.
7A. Pêcher, A. Wagler.

Almost all webs are not rank-perfect, in: Mathematical Programming, 2006, vol. 105, n^o 2-3, p. 311–328.
8R. 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.
9F. 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.
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

Doctoral Dissertations and Habilitation Theses

11G. Stauffer.

Excursions en Optimisation Combinatoire, Programmation Entiere et Polyedres., Université Sciences et Technologies - Bordeaux I, November 2011, HDR.

http://tel.archives-ouvertes.fr/tel-00653059

Articles in International Peer-Reviewed Journal

12M. T. Godinho, L. Gouveia, P. Pesneau.

Natural and Extended formulations for the Time-Dependent Traveling Salesman Problem, in: Discrete Applied Mathematics, November 2011. [ DOI : 10.1016/j.dam.2011.11.019 ]

http://hal.inria.fr/hal-00648451/en
13C. Joncour, A. Pêcher.

Consecutive ones matrices for multi-dimensional orthogonal packing problems, in: Journal of Mathematical Modelling and Algorithms, 2011. [ DOI : 10.1007/s10852-011-9167-z ]

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

MPQ-trees for the orthogonal packing problem, in: Journal of Mathematical Modelling and Algorithms, August 2011, A paraitre p, To appear in Journal of Mathematical Modelling and Algorithms. [ DOI : 10.1007/s10852-011-9159-z ]

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

A Column Generation based Tactical Planning Method for Inventory Routing, in: Operations Research, 2011.

http://hal.inria.fr/inria-00169311/en
16G. Oriolo, G. Stauffer, P. Ventura.

Stable set in claw-free graphs: recent achievement and future challenges, in: Optima Mathematical Optimization Society Newsletter, August 2011, n^o 86.

http://hal.inria.fr/hal-00648013
17S. Pokutta, G. Stauffer.

Lower bounds for the Chvátal-Gomory closure in the 0/1 cube, in: Operations Research Letters, January 2011.

http://hal.inria.fr/inria-00539038
18A. Pêcher, A. Wagler.

Computing the clique number of a-perfect graphs in polynomial time, in: Electronic Notes in Discrete Mathematics, September 2011, p. 705-710.

http://hal.archives-ouvertes.fr/hal-00592080
19A. Pêcher, A. Wagler.

Polynomial time computability of some graph parameters for superclasses of perfect graphs, in: International Journal of Mathematics in Operational Research, 2011.

http://hal.inria.fr/inria-00560144/en
20R. Sadykov.

A dominant class of schedules for malleable jobs in the problem to minimise the total weighted completion time, in: Computers and Operations Research, 2011, vol. To appear. [ DOI : 10.1016/j.cor.2011.02.023 ]

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

Bin Packing with conflicts: a generic branch-and-price algorithm, in: INFORMS Journal on Computing, 2011, vol. To appear.

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

The strongly minimal facets of the stable set polytope of quasi-line graphs, in: Operations Research Letters, March 2011.

http://hal.inria.fr/inria-00463669/en
23F. 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

Articles in Non Peer-Reviewed Journal

24M. Kiliç, J. Linderoth, J. Luedtke, A. Miller.

Strong Branching Inequalities for Convex Mixed Integer Nonlinear Programs, in: Optimization Online, April 2011.

http://www.optimization-online.org/DB_HTML/2011/09/3150.html
25R. Sadykov, F. Vanderbeck.

Column Generation for Extended Formulations, in: Optimization Online, July 2011.

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

Invited Conferences

26A. Pêcher.

The circular chromatic number of circular-perfect graphs is polytime, in: 2011 Workshop on Graph Theory, Taipei, Taiwan, Province Of China, March 2011.

http://hal.inria.fr/hal-00652773/en

International Conferences with Proceedings

27Y. 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
28R. Sadykov, F. Vanderbeck.

Column Generation for Extended Formulations, in: 6th Latin-American Algorithms, Graphs and Optimization Symposium, Bariloche, Argentina, Electronic Notes in Discrete Mathematics, Elsvier, 2011, vol. 37, p. 357-362. [ DOI : 10.1016/j.endm.2011.05.061 ]

http://hal.inria.fr/inria-00539870/en
29R. Sadykov, F. Vanderbeck.

Machine scheduling by column-and-row generation on the time-indexed formulation, in: 10th International Workshop on Models and Algorithms for Planning and Scheduling Problems, Nymburk, Czech Republic, 2011, p. 55-57.

http://hal.inria.fr/hal-00649184/en
30G. Stauffer, G. Massonnet, C. Rapine, J.-P. Gayon.

A simple and fast 2-approximation algorithm for the one warehouse multi-retailer problem, in: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA) 2011, San Francisco, United States, SIAM, January 2011.

http://hal.inria.fr/inria-00539042/en

Conferences without Proceedings

31J. Hyemin, J. Linderoth, A. Miller.

Linear and Nonlinear Inequalities for a Nonseparable Quadratic Set, in: SIAM Conference on Optimization, 2011.

http://www.siam.org/meetings/op11/program.php

Scientific Books (or Scientific Book chapters)

32Y. Faenza, G. Oriolo, G. Stauffer, P. Ventura.

Stable Sets in Claw-free Graphs : A Journey Through Algorithms and Polytopes, in: Progress in Combinatorial Optimization., A. R. Mahjoub (editor), Wiley, October 2011.

http://hal.inria.fr/hal-00648014/en
33M. T. Godinho, L. Gouveia, P. Pesneau.

On a Time-Dependent Formulation and an Updated Classification of ATSP Formulations, in: Progress in Combinatorial Optimization, A. R. Mahjoub (editor), Wiley, October 2011.

http://hal.inria.fr/hal-00648457/en

Other Publications

34C. Bachoc, A. Pêcher, A. Thiery.

On the theta number of powers of cycle graphs, 2011, 17 pages.

http://hal.inria.fr/hal-00572897/en
35P. Belotti, S. Cafieri, J. Lee, L. Liberti, A. Miller.

On the composition of convex envelopes for quadrilinear terms, 2011, 15 pages.

References in notes

36K. Akartunali, A. J. Miller.

A Computational Analysis of Lower Bounds for Big Bucket Production Planning Problems, 2009.

http://hal.archives-ouvertes.fr/hal-00387105/en/
37K. Akartunali, A. Miller.

A heuristic approach for big bucket multi-level production planning problems, in: European Journal of Operational Research, 2009, p. 396-411.

http://hal.archives-ouvertes.fr/hal-00387052/en/
38P. 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/
39P. 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/
40P. Baptiste, R. Sadykov, S. David.

Planification, ordonnancement : résolution de problèmes disjonctifs, in: Gestion de la complexité et de l'information dans les grands systèmes critiques, A. Appriou (editor), CNRS Éditions, 2009.

http://hal.inria.fr/inria-00440278/en/
41M. Constantino, A. 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/
42G. 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.
43B. Denton, A. 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/
44L. Dubost, R. Gonzalez, C. Lemaréchal.

A primal-proximal heuristic applied to the French unit-commitment problem, in: Mathematical Programming, 2005, vol. 104, n^o 1, p. 129–152.
45Y. 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
46B. 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.
47M. 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.
48M. 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.
49Y. Guan, S. Ahmed, A. Miller, G. Nemhauser.

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

A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem, in: Mathematical Programming, 2006, vol. 105, p. 55-84.
51L. 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.
52L. Gély.

Real-time train scheduling at SNCF, in: 1st Workshop on Robust Planning and Rescheduling in Railways, ARRIVAL meeting on Robust planning and Rescheduling in Railways, April 2007.
53Y. 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.
54D. 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.
55D. 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.
56B. Jaumard, F. Vanderbeck, B. Vignac.

A Nested Decomposition Approach to an Optical Network Design Problem, in: 9th INFORMS Telecommunications Conference, Washington, March 2008.
57C. Joncour.

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

Column Generation based Primal Heuristics, in: Submitted to ISCO 2010, 2010.
59C. 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/
60H. Kerivin, A. Mahjoub.

On Survivable Network Polyhedra, in: Discrete Mathematics, 2005, vol. 290, p. 183–210.
61P. Meurdesoif, P. Pesneau, F. Vanderbeck.

Meter installation for monitoring network traffic, in: International Conference on Network Optimization, INOC, International Network Optimization Conference (INOC), 2007.
62P. 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.
63S. Michel.

Optimisation des tournées de véhicules combinées à la gestion de stock, Université Bordeaux 1, Dec 2006.
64S. 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/
65S. Michel, F. Vanderbeck.

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

http://hal.inria.fr/inria-00169311/en/
66M. 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.
67M. 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.
68G. 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
69M. 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.
70N. Perrot.

Advanced IP column generation strategies for the cutting stock stock problem and its variants, University Bordeaux 1, 2005.
71N. Perrot, F. Vanderbeck.

Industrial Cutting Stock Problem, in: Collection Sciences, Technologie Informatique, Presses Universitaires de Valenciennes (editor), ROADEF 2006, 2006.
72A. Pêcher, A. K. Wagler.

Almost all webs are not rank-perfect, in: Mathematical Programming, 2006, vol. 105, p. 311–328.
73A. Pêcher, A. Wagler.

Clique and chromatic number of circular-perfect graphs, in: Electronic Notes in Discrete Mathematics, Hammamet, Tunisie, February 2010, vol. 36, p. 199-206.

http://hal.archives-ouvertes.fr/hal-00453400
74R. 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. [ DOI : 10.1016/j.ejor.2006.06.078 ]
75R. Sadykov.

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

http://hal.inria.fr/inria-00412519/en/
76R. 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/
77R. Sadykov.

A polynomial algorithm for a simple scheduling problem at cross docking terminals, in: Project Management and Scheduling, France Tours, 2010, p. 345-348.

http://hal.inria.fr/inria-00539843/en
78G. 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
79A. Sutter, F. Vanderbeck, L. Wolsey.

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

A generic view of Dantzig-Wolfe decomposition in mixed integer programming, in: Operations Research Letters, 2006, vol. 34, n^o 3, p. 296–306.
81F. 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.
82F. 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.
83F. 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.
84F. Vanderbeck.

Lot-sizing with start-up times, in: Management Science, 1998, vol. 44, n^o 10, p. 1409–1425.
85F. 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.
86B. 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.
87B. Vignac, B. Jaumard, F. Vanderbeck.

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

Hierarchical Heuristic for the GRWA Problem in WDM Networks with Delay Constraints, INRIA, 2009.

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

Nested Decomposition Approach to an Optical Network Design Problem, INRIA, 2009.

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

Reformulation and Decomposition Approaches for Traffic Routing in Optical Networks, INRIA, 2009.

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

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

Previous |

Home