EN FR
EN FR
REALOPT - 2015
REALOPT - 2015
Project-Team Realopt
Members
Overall Objectives
Research Program
Application Domains
Highlights of the Year
New Software and Platforms
New Results
Bilateral Contracts and Grants with Industry
Partnerships and Cooperations
Dissemination
Bibliography
Project-Team Realopt
Members
Overall Objectives
Research Program
Application Domains
Highlights of the Year
New Software and Platforms
New Results
Bilateral Contracts and Grants with Industry
Partnerships and Cooperations
Dissemination
Bibliography


previous Previous | up Home


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, no 2, pp. 299–344.
  • 2S. 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, no 1, pp. 37-46.

    http://hal.archives-ouvertes.fr/hal-00308150/en/
  • 3L. Gouveia, P. Pesneau.

    On extended formulations for the precedence constrained asymmetric traveling salesman problem, in: Networks, 2006, vol. 48, no 6, pp. 77–89.
  • 4A. Pêcher, A. Wagler.

    Almost all webs are not rank-perfect, in: Mathematical Programming, 2006, vol. 105, no 2-3, pp. 311–328.
  • 5R. Sadykov, F. Vanderbeck.

    Column Generation for Extended Formulations, in: EURO Journal on Computational Optimization, May 2013, vol. 1, no 1-2, pp. 81-115. [ DOI : 10.1007/s13675-013-0009-9 ]

    https://hal.inria.fr/hal-00661758
  • 6R. 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, no 2, pp. 209–217.
  • 7F. Vanderbeck.

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

    http://hal.inria.fr/inria-00311274
  • 8F. Vanderbeck.

    Computational Study of a Column Generation algorithm for Bin Packing and Cutting Stock problems, in: Mathematical Programming, Ser. A, 1999, vol. 86, pp. 565–594.
  • 9F. Vanderbeck, L. Wolsey.

    Reformulation and Decomposition of Integer Programs, in: 50 Years of Integer Programming 1958-2008, Springer, 2010, CORE DP 2009/16. [ DOI : 10.1007/978-3-540-68279-0_13 ]

    http://hal.inria.fr/inria-00392254
Publications of the year

Articles in International Peer-Reviewed Journals

  • 10C. Alves, J. Rietz, J. M. Valério De Carvalho, F. Clautiaux.

    Constructing general dual-feasible functions, in: Operations Research Letters, 2015, vol. 43, no 4, 5 p. [ DOI : 10.1016/j.orl.2015.06.002 ]

    https://hal.inria.fr/hal-01214650
  • 11O. Beaumont, L. Eyraud-Dubois, J.-A. Lorenzo-Del-Castillo.

    Analyzing Real Cluster Data for Formulating Allocation Algorithms in Cloud Platforms, in: Parallel Computing, 2015.

    https://hal.inria.fr/hal-01214636
  • 12S. Borne, P. Fouilhoux, R. Grappe, M. Lacroix, P. Pesneau.

    Circuit and bond polytopes on series–parallel graphs, in: Discrete Optimization, August 2015, vol. 17. [ DOI : 10.1016/j.disopt.2015.04.001 ]

    https://hal.inria.fr/hal-01215899
  • 13L. Eyraud-Dubois, L. Marchal, O. Sinnen, F. Vivien.

    Parallel scheduling of task trees with limited memory, in: ACM Transactions on Parallel Computing, July 2015, vol. 2, no 2, 36 p. [ DOI : 10.1145/2779052 ]

    https://hal.inria.fr/hal-01160118
  • 14M. Gérard, F. Clautiaux, R. Sadykov.

    Column generation based approaches for a tour scheduling problem with multi-skill heterogeneous workforce, in: European Journal of Operational Research, 2015.

    https://hal.inria.fr/hal-01214652
  • 15H. H. Kramer, E. Uchoa, M. Fampa, F. Vanderbeck, V. Kohler.

    Column generation approaches for the software clustering problem, in: Computational Optimization and Applications, December 2015.

    https://hal.inria.fr/hal-01108161
  • 16B. Vignac, F. Vanderbeck, B. Jaumard.

    Reformulation and Decomposition Approaches for Traffic Routing in Optical Networks, in: Networks, December 2015.

    https://hal.inria.fr/inria-00392256

International Conferences with Proceedings

  • 17E. Agullo, O. Beaumont, L. Eyraud-Dubois, J. Herrmann, S. Kumar, L. Marchal, S. Thibault.

    Bridging the Gap between Performance and Bounds of Cholesky Factorization on Heterogeneous Platforms, in: Heterogeneity in Computing Workshop 2015, Hyderabad, India, May 2015.

    https://hal.inria.fr/hal-01120507
  • 18E. Agullo, O. Beaumont, L. Eyraud-Dubois, S. Kumar.

    Are Static Schedules so Bad ? A Case Study on Cholesky Factorization, in: IPDPS'16, Chicago, IL, United States, Proceedings of the 30th IEEE International Parallel & Distributed Processing Symposium, IEEE, May 2016.

    https://hal.inria.fr/hal-01223573
  • 19O. Beaumont, I. Belaid, L. Eyraud-Dubois, J.-A. Lorenzo-Del-Castillo.

    Allocating jobs with periodic demand variations, in: Euro-Par 2015, Vienna, Austria, Träff, Jesper Larsson, Hunold, Sascha, Versaci, Francesco, 2015. [ DOI : 10.1007/978-3-662-48096-0_12 ]

    https://hal.inria.fr/hal-01118176
  • 20O. Beaumont, L. Eyraud-Dubois, A. Guermouche, T. Lambert.

    Comparison of Static and Dynamic Resource Allocation Strategies for Matrix Multiplication, in: 26th IEEE International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD), 2015, Florianopolis, Brazil, October 2015.

    https://hal.inria.fr/hal-01163936
  • 21O. Beaumont, L. Eyraud-Dubois, T. Lambert.

    A New Approximation Algorithm for Matrix Partitioning in Presence of Strongly Heterogeneous Processors, in: 30th IEEE International Parallel & Distributed Processing Symposium, IPDPS'16, Chicago, France, IEEE, May 2016.

    https://hal.inria.fr/hal-01216245
  • 22I. Belaid, L. Eyraud-Dubois.

    Column generation integer programming for allocating jobs with periodic demand variations, in: International Workshop on Algorithmic Aspects of Cloud Computing, Patras, Greece, Springer, September 2015.

    https://hal.inria.fr/hal-01252770
  • 23B. Detienne, R. Sadykov, S. Tanaka.

    The two-machine flowshop total completion time problem: A branch-and-bound based on Network-flow formulation, in: 7th Multidisciplinary International Conference on Scheduling: Theory and Applications, Prague, Czech Republic, August 2015, pp. 635-637.

    https://hal.inria.fr/hal-01248318
  • 24R. Sadykov, A. A. Lazarev, A. Pessoa, E. Uchoa, F. Vanderbeck.

    The Prominence of Stabilization Techniques in Column Generation: the case of Freight Transportation, in: 6th International Workshop on Freight Transportation and Logistics Odysseus'2015, Ajaccio, France, June 2015.

    https://hal.inria.fr/hal-01248323
  • 25S. Tanaka, R. Sadykov, B. Detienne.

    A new Lagrangian bound for the min-sum job-shop scheduling, in: International Symposium on Scheduling ISS'2015, Kobe, Japan, July 2015.

    https://hal.inria.fr/hal-01248322

Other Publications

  • 26A. Pessoa, R. Sadykov, E. Uchoa, F. Vanderbeck.

    Automation and combination of linear-programming based stabilization techniques in column generation, August 2015, working paper or preprint.

    https://hal.inria.fr/hal-01077984
  • 27A. Pêcher, C. Bachoc, P. Moustrou.

    On dense sphere packings, December 2015, International Conference on Graph Theory and its Applications, Poster.

    https://hal.archives-ouvertes.fr/hal-01246068
  • 28R. Sadykov, F. Vanderbeck, A. Pessoa, I. Tahiri, E. Uchoa.

    Primal Heuristics for Branch-and-Price, December 2015, working paper or preprint.

    https://hal.inria.fr/hal-01237204
References in notes
  • 29K. 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/
  • 30K. Akartunali, A. J. Miller.

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

    http://hal.archives-ouvertes.fr/hal-00387052/en/
  • 31M. Alba Martínez, F. Clautiaux, M. Dell'Amico, M. Iori.

    Exact algorithms for the bin packing problem with fragile objects, in: Discrete Optimization, August 2013, vol. 10, no 3, pp. 210-223. [ DOI : 10.1016/j.disopt.2013.06.001 ]

    http://hal.inria.fr/hal-00909480
  • 32P. 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, no 6, pp. 487–502.

    http://hal.inria.fr/inria-00387012/en/
  • 33P. 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/
  • 34M. Constantino, A. J. Miller, M. Van Vyve.

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

    http://hal.archives-ouvertes.fr/hal-00387098/en/
  • 35G. 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, pp. 577–582.
  • 36B. Denton, A. J. Miller, H. Balasubramanian, T. Huschka.

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

    http://hal.archives-ouvertes.fr/hal-00386469/en/
  • 37B. Detienne.

    Extended formulations for robust maintenance planning at power plants, in: Gaspard Monge Program for Optimization : Conference on Optimization and Practices in Industry PGMO-COPI14, Saclay, France, October 2014.

    https://hal.inria.fr/hal-01104728
  • 38B. 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, no 1, pp. 85–111.
  • 39M. 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, no 11-2007.
  • 40M. 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.
  • 41Y. Guan, S. Ahmed, A. J. Miller, G. Nemhauser.

    On formulations of the stochastic uncapacitated lot-sizing problem, in: Operations Research Letters, 2006, vol. 34, pp. 241-250.
  • 42Y. 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, pp. 55-84.
  • 43L. 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.
  • 44L. 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.
  • 45J. Han, P. Bendotti, B. Detienne, G. Petrou, M. Porcheron, R. Sadykov, F. Vanderbeck.

    Extended Formulation for Maintenance Planning at Power Plants, in: ROADEF - 15ème congrès annuel de la Société française de recherche opérationnelle et d'aide à la décision, Bordeaux, France, Société française de recherche opérationnelle et d'aide à la décision, February 2014.

    https://hal.archives-ouvertes.fr/hal-00946294
  • 46Y. 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, pp. 132-135.
  • 47D. 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, no 1, pp. 116-133.
  • 48D. Huygens, A. R. Mahjoub, P. Pesneau.

    Two edge-disjoint hop-constrained paths and polyhedra, in: SIAM Journal of Discrete Mathematics, 2004, vol. 18, no 2, pp. 287–312.
  • 49C. 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.
  • 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, pp. 255–256.

    http://hal.archives-ouvertes.fr/hal-00307152/en/
  • 51C. Joncour, A. Pêcher.

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

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

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

    http://hal.archives-ouvertes.fr/hal-00611528
  • 53P. Meurdesoif, P. Pesneau, F. Vanderbeck.

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

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

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

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

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

    http://hal.inria.fr/inria-00169311/en/
  • 58S. Michel, F. Vanderbeck.

    A Column Generation based Tactical Planning Method for Inventory Routing, in: Operations Research, 2012, vol. 60, no 2, pp. 382-397.

    http://hal.inria.fr/inria-00169311
  • 59M. Mourgaya, F. Vanderbeck.

    The Periodic Vehicle Routing Problem: classification and heuristic, in: RAIRO-OR, April-June 2006, vol. 40, no 2, pp. 169–194.
  • 60M. Mourgaya, F. Vanderbeck.

    Column generation based heuristic for tactical planning in multi period vehicle routing, in: European Journal of Operational Research, 2007, vol. 183, no 3, pp. 1028-1041.
  • 61M. Padberg, G. Rinaldi.

    A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems, in: SIAM Review, 1991, vol. 33, no 1, pp. 60–100.
  • 62D. Pecin, A. Pessoa, M. Poggi, E. Uchoa.

    Improved Branch-Cut-and-Price for Capacitated Vehicle Routing, in: Integer Programming and Combinatorial Optimization, J. Lee, J. Vygen (editors), Lecture Notes in Computer Science, Springer International Publishing, 2014, vol. 8494, pp. 393-403.
  • 63N. Perrot.

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

    Industrial Cutting Stock Problem, in: Collection Sciences, Technologie Informatique, Presses Universitaires de Valenciennes, 2006.
  • 65M. 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
  • 66A. Pêcher, A. Wagler.

    Almost all webs are not rank-perfect, in: Mathematical Programming, 2006, vol. 105, pp. 311–328.
  • 67R. 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, no 3, pp. 1284–1304.

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

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

    http://hal.inria.fr/inria-00412519/en/
  • 69R. 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/
  • 70R. Sadykov.

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

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

    Bin Packing with conflicts: a generic branch-and-price algorithm, in: INFORMS Journal on Computing, 2013, vol. 25, no 2, pp. 244-255. [ DOI : 10.1287/ijoc.1120.0499 ]

    http://hal.inria.fr/inria-00539869
  • 72G. 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
  • 73A. Sutter, F. Vanderbeck, L. A. Wolsey.

    Optimal Placement of Add/Drop Multiplexers: Heuristic and Exact Algorithms, in: Operations Research, 1998, vol. 46, no 5, pp. 719–728.
  • 74F. Vanderbeck.

    Exact algorithm for minimising the number of setups in the one-dimensional cutting stock problem, in: Operations Research, 2000, vol. 48, no 5, pp. 915–926.
  • 75F. Vanderbeck.

    A nested decomposition approach to a 3-stage 2-dimensional cutting stock problem, in: Management Science, 2001, vol. 47, no 2, pp. 864–879.
  • 76F. Vanderbeck.

    Extending Dantzig's Bound to the Bounded Multiple-class Knapsack Problem, in: Mathematical Programming, Ser. A, 2002, vol. 94, no 1, pp. 125–136.
  • 77F. Vanderbeck.

    Lot-sizing with start-up times, in: Management Science, 1998, vol. 44, no 10, pp. 1409–1425.
  • 78F. Vanderbeck.

    Computational study of a column generation algorithm for bin packing and cutting stock problems, in: Mathematical Programming, Ser. A, 1999, vol. 86, pp. 565–594.
  • 79B. 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/
  • 80B. 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/
  • 81B. 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
  • 82B. Vignac.

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


previous Previous | up Home