Groupe d’études et de recherche en analyse des décisions

Publications

Optimisation combinatoire, Combinatoire, Théorie des graphes

Articles

A bi-objective vehicle routing problem integrating routing operations into tactical clustering decisions
, , et
Soumis à : Computers & Industrial Engineering, 2018 référence BibTeX
A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands
, et
Computers & Operations Research, 50, 141–153, 2014 référence BibTeX
Globally optimal clusterwise regression by column generation enhanced with heuristics, sequencing and ending subset optimization
, et
Journal of Classification, 31(2), 219–241, 2014 référence BibTeX
On the Weber facility location problem with limited distances and side constraints
, , , et
Optimization Letters, 8(2), 407–424, 2014 référence BibTeX
Improving heuristics for network modularity maximization using an exact algorithm
, et
Discrete Applied Mathematics, 163(1), 65–72, 2014 référence BibTeX
Variable neighborhood search for minimum sum-of-squares clustering on networks
, et
European Journal of Operational Research, 230(2), 356–363, 2013 référence BibTeX
IP restoration vs. optical protection: Which one has the least bandwidth requirements?
, , et
Optical Switching and Networking, 10(3), 261–273, 2013 référence BibTeX
Observer-based backstepping controller for microalgae cultivation
, et
Industrial & Engineering Chemistry Research, 52(22), 7482–7491, 2013 référence BibTeX
A Tabu-search algorithm for the location of data centers and software components in green cloud computing networks
et
IEEE Transactions on Cloud Computing, 1(1), 22–35, 2013 référence BibTeX
Packing unit spheres into the smallest sphere using VNS and NLP
, et
Computers & Operations Research, 40(2), 603–615, 2013 référence BibTeX
Network descriptors based on betweenness centrality and transmission and their extremal values
et
Discrete Applied Mathematics, 161(16-17), 2678–2686, 2013 référence BibTeX
Design and dimensioning of logical survivable topologies against multiple failures
et
IEEE/OSA Journal of Optical Communications and Networking, 5(1), 23–36, 2013 référence BibTeX
Subgradient optimization in nonsmooth optimization (including the Soviet Revolution)
Documenta Math., Extra Volume ISMP , 277–290, 2012 référence BibTeX
Coordination in a two-stage production system: Complexity, conflict and cooperation
, et
Computers & Operations Research, 39, 1245–1256, 2012 référence BibTeX
A two-stage heuristic for multi-activity and task assignment to work shifts
, et
Computers and Industrial Engineering, 63(4), 831–841, 2012 référence BibTeX
Estimation of the mixed logit likelihood function by randomized quasi-Monte Carlo
, , et
Transportation Research Part B: Methodological, 4(2), 305–320, 2012 référence BibTeX
Integer linear programming models for a cement delivery problem
, et
European Journal of Operational Research, 222(3), 623–631, 2012 référence BibTeX
CAPEX/OPEX effective optical wide area network design
, et
Telecommunications Systems, 49(3), 329–344, 2012 référence BibTeX
Using size for bounding expressions of graph invariants
, et
Annals of Operations Research, 188(1), 415–427, 2011 référence BibTeX
Designing robust rapid transit networks with alternative routes
, , et
Journal of Advanced Transportation, 45, 54–65, 2011 référence BibTeX
Bounds on the index of the signless Laplacian of a graph
, , et
Discrete Applied Mathematics, 158(4), 355–360, 2010 référence BibTeX
Variable neighborhood search for bandwidth reduction
, , et
European Journal of Operational Research, 200, 14–27, 2010 référence BibTeX
Branch-and-price-and-cut for the split delivery vehicle routing problem with time windows
Operations Research, 58(1), 179–192, 2010 référence BibTeX
A continuous analysis framework for the solution of location-allocation problems with dense demand
, et
Computers & Operations Research, 37, 123–136, 2010 référence BibTeX
European driver rules in vehicle routing with time windows
, , et
Transportation Science, 44(4), 455–473, 2010 référence BibTeX
A branch-and-price algorithm for the vehicle routing problem with deliveries, selective pickups and time windows
, , et
European Journal of Operational Research, 206(2), 341–349, 2010 référence BibTeX
Bounds and conjectures for the signless Laplacian index of graphs
et
Linear Algebra and its Applications, 432(12), 3319–3336, 2010 référence BibTeX
The traveling salesman problem, the vehicle routing problem, and their impact on combinatorial optimization
International Journal of Strategic Decision Sciences, 1, 82–92, 2010 référence BibTeX
Confection de calendriers de matchs pour le sport universitaire et collégial au Québec
et
INFOR, 48, 181–189, 2010 référence BibTeX
About Equivalent Interval Colorings of Weighted Graphs
, et
Discrete Applied Mathematics, 157(17), 3615–3624, 2009 référence BibTeX
Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem
et
Discrete Applied Mathematics, 157(6), 1267–1290, 2009 référence BibTeX
An anytime deduction algorithm for the probabilistic logic and entailment problems
et
International Journal of Approximate Reasoning, 50(1), 92–103, 2009 référence BibTeX
Using meta-heuristics to find minimal unsatisfiable subformulas in satisfiability problems
, , et
Journal of Combinatorial Optimization, 18, 124–150, 2009 référence BibTeX
A magnetic procedure for the stability number
et
Graphs and Combinatorics, 25, 707–716, 2009 référence BibTeX
An inequality for the signless Laplacian index of a graph using the chromatic number
et
Graph Theory Notes of New-York, LVII, 39–42, 2009 référence BibTeX
Locating objects in the plane using global optimization techniques
, et
Mathematics of Operations Research, 34(4), 837–879, 2009 référence BibTeX
Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph
, , , , , et
European Journal of Operational Research, 191(3), 661–676, 2008 référence BibTeX
Exact and heuristic procedures for the material handling circular flow path design problem
, et
European Journal of Operational Research, 176(2), 707–726, 2007 référence BibTeX
Variable neighborhood search for extremal graphs. 19. Further conjectures and results about the Randic index
, et
MATCH, Communications in Mathematical and in Computer Chemistry, 58(1), 83–102, 2007 référence BibTeX
Augmenting chains in graphs without a skew star
, et
Journal of Combinatorial Theory, 96(3), 352–366, 2006 référence BibTeX
A survey of local search methods for graph coloring
et
Computers & Operations Research, 33(9), 2547–2562, 2006 référence BibTeX
Automated conjectures on upper bounds for the largest Laplacian eigenvalue of graphs
, et
Linear Algebra and its Applications, 414(2-3), 407–424, 2006 référence BibTeX
Variable neighborhood search for extremal graphs. 18. Conjectures and results about the Randic index
, et
MATCH, Communications in Mathematical and in Computer Chemistry, 56(3), 541–550, 2006 référence BibTeX
Loop based facility planning and material handling
et
European Journal of Operational Research, 164, 1–11, 2005 référence BibTeX
Lower bounding and Tabu search procedures for the frequency assignment problem with polarization constraints
, et
4OR: Quarterly Journal of the Belgian, French and Italian Operations Research Societies , 139–161, 2005 référence BibTeX
Variable neighborhood search for extremal graphs. 12. A note on the variance of bounded degrees in graphs
, et
MATCH, Communications in Mathematical and in Computer Chemistry, 54, 221–232, 2005 référence BibTeX
Permutation-based genetic, Tabu and variable neighborhood search heuristics for multiprocessor scheduling with communication delays
, et
Asia-Pacific Journal of Operational Research, 22(3), 297–326, 2005 référence BibTeX
Solving the hierarchical chinese postman problem as a rural postman problem
, , et
European Journal of Operational Research, 155, 40–50, 2004 référence BibTeX
Exact algorithms for the job sequencing and tool switching problem
, et
IIE Transactions, 36(1), 37–45, 2004 référence BibTeX
A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem
, et
European Journal of Operational Research, 158, 793–795, 2004 référence BibTeX
On some interconnections between combinatorial optimization and extremal graph theory
, et
Yugoslav Journal of Operations Research, 14, 147–159, 2004 référence BibTeX
Ambulance location and relocation models
, et
European Journal of Operational Research, 147, 451–468, 2003 référence BibTeX

Chapitres de livre

Using local search to speed up filtering algorithms for some NP-hard constraints
, , et
Springer Berlin / Heidelberg, Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Lecture Notes in Computer Science, 5015, 298–302, 2008 référence BibTeX
A primer in column generation
et
G. Desaulniers, J. Desrosiers, M.M. Solomon (eds.), Column Generation, Springer, New York, 1–32, 2005 référence BibTeX
The maximum independent set problem and augmenting graphs
et
Eds Avis, D, Hertz, A & Marcotte, O, Graph Theory and Combinatorial Optimization, (4), Springer, 2005 référence BibTeX
Variable neighborhood search for extremal graphs XI. Bounds on algebraic connectivity
, , et
Edited by D. Avis, A. Hertz, O. Marcotte, Graph Theory and Combinatorial Optimization, Kluwer Academic Publishers, 1–16, 2005 référence BibTeX
On the Complexity of Testing Hypermetric, Negative Type, k-gonal and Gap Inequalities
Discrete and Computational Geometry, Lecture Notes in Computer Science, 2866, 51–59, 2003 référence BibTeX

Actes de conférence

An enhanced optimization model for scheduling freight trains
, , , et
Joint Rail Conference JRC, Knoxville, TN, US. April 15-18, 2013, 1–10, 2013 référence BibTeX
Output feedback passivity-based controller for microalgae cultivation
, et
Computer Applications in Biotechnology, 12th IFAC Symposium on Computer Applications in Biotechnology, 12(1), 279–284, 2013 référence BibTeX
Location and allocation of switching equipment (splitters/AWGs) in a WDM PON network
et
2011 Proceedings of 20th International Conference on Computer Communications and Networks (ICCCN), 1–8, 2012 référence BibTeX
An iterative scheme for valid polynomial inequality generation in binary polynomial programming
, et
Proceedings of the 15th Conference on Integer Programming and Combinatorial Optimization (IPCO XV), 655, 207–222, 2011 référence BibTeX
A viable translucent architecture for lossless OBS networks
, et
Proceedings of the IEEE International Conference on Communications (ICC), Cap Town, South Africa, 2010 référence BibTeX
An enhanced train assembly policy for loss-less OBS with CAROBS
, et
Communications Networks and Services Research (CNSR), 2010 Eighth IEEE Annual Conference, Montreal, Canada, 61–68, 2010, 11-14 mai 2010 référence BibTeX
Lower bounds for the uncapacitated facility location problem with user preferences
, et
Proceedings of 2nd International Workshop Discrete Optimization Methods in Production and Logistics, 50–55, 2004 référence BibTeX