Group for Research in Decision Analysis

Publications

Combinatorial optimization, Combinatorics, Graph theory

Articles

A Branch-Price-and-Cut algorithm for a production-routing problem with short-lifespan products
and
To appear in: Transportation Science, 2018 BibTeX reference
A bi-objective vehicle routing problem integrating routing operations into tactical clustering decisions
, , , and
Submitted to: Applied Soft Computing, 2018 BibTeX reference
RWA problem with geodesics in realistic OTN topologies
, , , , and
Optical Switching and Networking, 15, 18–28, 2015 BibTeX reference
A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands
, , and
Computers & Operations Research, 50, 141–153, 2014 BibTeX reference
Globally optimal clusterwise regression by column generation enhanced with heuristics, sequencing and ending subset optimization
, , and
Journal of Classification, 31(2), 219–241, 2014 BibTeX reference
On the Weber facility location problem with limited distances and side constraints
, , , , and
Optimization Letters, 8(2), 407–424, 2014 BibTeX reference
Improving heuristics for network modularity maximization using an exact algorithm
, , and
Discrete Applied Mathematics, 163(1), 65–72, 2014 BibTeX reference
Variable neighborhood search for minimum sum-of-squares clustering on networks
, , and
European Journal of Operational Research, 230(2), 356–363, 2013 BibTeX reference
IP restoration vs. optical protection: Which one has the least bandwidth requirements?
, , , and
Optical Switching and Networking, 10(3), 261–273, 2013 BibTeX reference
Two Laplacians for the distance matrix of a graph
and
Linear Algebra and its Applications, 439(1), 21–33, 2013 BibTeX reference
Observer-based backstepping controller for microalgae cultivation
, , and
Industrial & Engineering Chemistry Research, 52(22), 7482–7491, 2013 BibTeX reference
A Tabu-search algorithm for the location of data centers and software components in green cloud computing networks
and
IEEE Transactions on Cloud Computing, 1(1), 22–35, 2013 BibTeX reference
Variable neighborhood search for the travelling deliveryman problem
, , and
4OR, 11(1), 57–73, 2013 BibTeX reference
Packing unit spheres into the smallest sphere using VNS and NLP
, , and
Computers & Operations Research, 40(2), 603–615, 2013 BibTeX reference
Network descriptors based on betweenness centrality and transmission and their extremal values
and
Discrete Applied Mathematics, 161(16-17), 2678–2686, 2013 BibTeX reference
Design and dimensioning of logical survivable topologies against multiple failures
and
IEEE/OSA Journal of Optical Communications and Networking, 5(1), 23–36, 2013 BibTeX reference
Subgradient optimization in nonsmooth optimization (including the Soviet Revolution)
Documenta Math., Extra Volume ISMP , 277–290, 2012 BibTeX reference
Coordination in a two-stage production system: Complexity, conflict and cooperation
, , and
Computers & Operations Research, 39, 1245–1256, 2012 BibTeX reference
Estimation of the mixed logit likelihood function by randomized quasi-Monte Carlo
, , , and
Transportation Research Part B: Methodological, 4(2), 305–320, 2012 BibTeX reference
Integer linear programming models for a cement delivery problem
, , and
European Journal of Operational Research, 222(3), 623–631, 2012 BibTeX reference
Extensions to the repetitive branch and bound algorithm for globally optimal clusterwise regression
, , and
Computers & Operations Research, 39(11), 2748–2762, 2012 BibTeX reference
Centrality and betweenness: Vertex and edge decomposition of the Wiener index
, , , and
MATCH, Communications in Mathematical and in Computer Chemistry, 68(1), 293–302, 2012 BibTeX reference
The normalized revised Szeged index
and
MATCH, Communications in Mathematical and in Computer Chemistry, 67(2), 369–381, 2012 BibTeX reference
A branch-price-and-cut method for a ship routing and scheduling problem with split loads
, , , , and
Computers & Operations Research, 39(12), 3361–3375, 2012 BibTeX reference
CAPEX/OPEX effective optical wide area network design
, , and
Telecommunications Systems, 49(3), 329–344, 2012 BibTeX reference
Using size for bounding expressions of graph invariants
, , and
Annals of Operations Research, 188(1), 415–427, 2011 BibTeX reference
Designing robust rapid transit networks with alternative routes
, , , and
Journal of Advanced Transportation, 45, 54–65, 2011 BibTeX reference
Maximizing edge-ratio is NP-complete
, , and
Discrete Applied Mathematics, 159(18), 2276–2280, 2011 BibTeX reference
Bounds on the index of the signless Laplacian of a graph
, , , and
Discrete Applied Mathematics, 158(4), 355–360, 2010 BibTeX reference
Variable neighborhood search for bandwidth reduction
, , , and
European Journal of Operational Research, 200, 14–27, 2010 BibTeX reference
Branch-and-price-and-cut for the split delivery vehicle routing problem with time windows
Operations Research, 58(1), 179–192, 2010 BibTeX reference
Nordhaus-Gaddum relations for proximity and remoteness in graphs
and
Computers & Mathematics with Applications, 59(8), 2827–2835, 2010 BibTeX reference
A continuous analysis framework for the solution of location-allocation problems with dense demand
, , and
Computers & Operations Research, 37, 123–136, 2010 BibTeX reference
Clique inequalities applied to the vehicle routing problem with time windows
and
INFOR, 48(1), 53–67, 2010 BibTeX reference
European driver rules in vehicle routing with time windows
, , , and
Transportation Science, 44(4), 455–473, 2010 BibTeX reference
A survey of automated conjectures in spectral graph theory
and
Linear Algebra and its Applications, 432(9), 2293–2322, 2010 BibTeX reference
A branch-and-price algorithm for the vehicle routing problem with deliveries, selective pickups and time windows
, , , and
European Journal of Operational Research, 206(2), 341–349, 2010 BibTeX reference
A sharp upper bound on algebraic connectivity using domination number
, , and
Linear Algebra and its Applications, 432(11), 2879–2893, 2010 BibTeX reference
Bounds and conjectures for the signless Laplacian index of graphs
and
Linear Algebra and its Applications, 432(12), 3319–3336, 2010 BibTeX reference
The traveling salesman problem, the vehicle routing problem, and their impact on combinatorial optimization
International Journal of Strategic Decision Sciences, 1, 82–92, 2010 BibTeX reference
A variable neighborhood search based algorithm for finite-horizon Markov decision processes
, , and
Applied Mathematics and Computation, 217, 3480–3492, 2010 BibTeX reference
Confection de calendriers de matchs pour le sport universitaire et collégial au Québec
and
INFOR, 48, 181–189, 2010 BibTeX reference
About Equivalent Interval Colorings of Weighted Graphs
, , and
Discrete Applied Mathematics, 157(17), 3615–3624, 2009 BibTeX reference
Variable neighborhood search for extremal graphs. 17. Further conjectures and results about the index
, , and
Discussiones Mathematicae : Graph Theory, 29, 15–37, 2009 BibTeX reference
Comparison of heuristic approaches for the multiple depot vehicle scheduling problem
, , , and
Journal of Scheduling, 12(1), 17–30, 2009 BibTeX reference
Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem
and
Discrete Applied Mathematics, 157(6), 1267–1290, 2009 BibTeX reference
An anytime deduction algorithm for the probabilistic logic and entailment problems
and
International Journal of Approximate Reasoning, 50(1), 92–103, 2009 BibTeX reference
Using meta-heuristics to find minimal unsatisfiable subformulas in satisfiability problems
, , , and
Journal of Combinatorial Optimization, 18, 124–150, 2009 BibTeX reference
The capacitated team orienteering and profitable tour problems
, , , and
Journal of the Operational Research Society, 60, 831–842, 2009 BibTeX reference
Bounding average distance using order and minimum degree
and
Graph Theory Notes of New York, LVI, 21–29, 2009 BibTeX reference
A magnetic procedure for the stability number
and
Graphs and Combinatorics, 25, 707–716, 2009 BibTeX reference
An inequality for the signless Laplacian index of a graph using the chromatic number
and
Graph Theory Notes of New-York, LVII, 39–42, 2009 BibTeX reference
Locating objects in the plane using global optimization techniques
, , and
Mathematics of Operations Research, 34(4), 837–879, 2009 BibTeX reference
Variable neighborhood search for minimum cost berth allocation
, , and
European Journal of Operational Research, 191(3), 636–649, 2008 BibTeX reference
Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph
, , , , , , and
European Journal of Operational Research, 191(3), 661–676, 2008 BibTeX reference
Variable neighborhood search for extremal graphs. 25. Products of connectivity and distance measures
, , , and
Graph Theory Notes of New York, 55, 6–13, 2008 BibTeX reference
Primal-dual variable neighborhood search for the simple plant location problem
, , , and
INFORMS Journal on Computing, 19(4), 552–564, 2007 BibTeX reference
Exact and heuristic procedures for the material handling circular flow path design problem
, , and
European Journal of Operational Research, 176(2), 707–726, 2007 BibTeX reference
Variable Neighborhood Search for Extremal Graphs. 20. Automated Comparison of Graph Invariants
, , and
MATCH, Communications in Mathematical and in Computer Chemistry, 58(2), 365–384, 2007 BibTeX reference
Parking buses in a depot using block patterns: A Benders decomposition approach for minimizing type mismatches
, , and
Computers & Operations Research, 34(11), 3362–3379, 2007 BibTeX reference
On a conjecture about the Randic index
and
Discrete Applied Mathematics, 307(2), 262–265, 2007 BibTeX reference
Variable neighbourhood search for colour image quantization
, , and
IMA Journal of Management Mathematics, 18(2), 207–221, 2007 BibTeX reference
Variable neighborhood search for extremal graphs. 19. Further conjectures and results about the Randic index
, , and
MATCH, Communications in Mathematical and in Computer Chemistry, 58(1), 83–102, 2007 BibTeX reference
Augmenting chains in graphs without a skew star
, , and
Journal of Combinatorial Theory, 96(3), 352–366, 2006 BibTeX reference
A survey of local search methods for graph coloring
and
Computers & Operations Research, 33(9), 2547–2562, 2006 BibTeX reference
Variable neighborhood search and local branching
, , and
Computers & Operations Research, 33(10), 3034–3045, 2006 BibTeX reference
Automated conjectures on upper bounds for the largest Laplacian eigenvalue of graphs
, , and
Linear Algebra and its Applications, 414(2-3), 407–424, 2006 BibTeX reference
Variable neighborhood search for extremal graphs. 18. Conjectures and results about the Randic index
, , and
MATCH, Communications in Mathematical and in Computer Chemistry, 56(3), 541–550, 2006 BibTeX reference
Loop based facility planning and material handling
and
European Journal of Operational Research, 164, 1–11, 2005 BibTeX reference
Lower bounding and Tabu search procedures for the frequency assignment problem with polarization constraints
, , and
4OR: Quarterly Journal of the Belgian, French and Italian Operations Research Societies , 139–161, 2005 BibTeX reference
Variable neighborhood search for extremal graphs. 12. A note on the variance of bounded degrees in graphs
, , and
MATCH, Communications in Mathematical and in Computer Chemistry, 54, 221–232, 2005 BibTeX reference
Recherche à voisinage variable de graphes extrémaux. 13. À propos de la maille
and
RAIRO-Operations Research, 39(4), 275–293, 2005 BibTeX reference
Permutation-based genetic, Tabu and variable neighborhood search heuristics for multiprocessor scheduling with communication delays
, , and
Asia-Pacific Journal of Operational Research, 22(3), 297–326, 2005 BibTeX reference
Solving the hierarchical chinese postman problem as a rural postman problem
, , , and
European Journal of Operational Research, 155, 40–50, 2004 BibTeX reference
A general multi-shift scheduling system
and
Journal of the Operational Research Society, 55(11), 1208–1217, 2004 BibTeX reference
Exact algorithms for the job sequencing and tool switching problem
, , and
IIE Transactions, 36(1), 37–45, 2004 BibTeX reference
A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem
, , and
European Journal of Operational Research, 158, 793–795, 2004 BibTeX reference
On some interconnections between combinatorial optimization and extremal graph theory
, , and
Yugoslav Journal of Operations Research, 14, 147–159, 2004 BibTeX reference
Ambulance location and relocation models
, , and
European Journal of Operational Research, 147, 451–468, 2003 BibTeX reference

Book chapters

Graph colouring variations
and
To appear in: Topics in Algorithmic Graph Theory, Cambridge University Press, 2019 BibTeX reference
GENCOL : Une équipe et un logiciel d'optimisation
Bui, A. and Tseveendorj, I., Combinatorial Optimization in Practice, 8(2), 61–96, 2010 BibTeX reference
Recent models and algorithms for one-to-one pickup and delivery problems
, , and
B. L., Golden, S. Raghavan and E. A. Wasil, The Vehicle Routing: Latest Advances and Challenges, 43, 327–357, 2008 BibTeX reference
Using local search to speed up filtering algorithms for some NP-hard constraints
, , , and
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 BibTeX reference
Variable neighborhood search for extremal graphs. 14. The AutoGraphiX 2 system
, , , , , , , and
L. Liberty, N. Maculan (eds.), Global Optimization from Theory to Implementation, 84, 231–310, 2006 BibTeX reference
The maximum independent set problem and augmenting graphs
and
Eds Avis, D, Hertz, A & Marcotte, O, Graph Theory and Combinatorial Optimization, (4), Springer, 2005 BibTeX reference
Variable neighborhood search for extremal graphs XI. Bounds on algebraic connectivity
, , , and
Edited by D. Avis, A. Hertz, O. Marcotte, Graph Theory and Combinatorial Optimization, Kluwer Academic Publishers, 1–16, 2005 BibTeX reference
Parallel Variable Neighborhood Search
, , and
E. Alba, Parallel Metaheuristics: A New Class of Algorithms, Wiley, 247–266, 2005 BibTeX reference
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 BibTeX reference

Proceedings

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