| Publication | Date of Publication | Type |
|---|
A blockchain-based framework to optimize shipping container flows in the hinterland
International Transactions in Operational Research | 2024-06-25 | Paper |
Exact and heuristic approaches for maximizing flows in UAV-enabled wireless cellular networks with multi-hop backhauls
RAIRO - Operations Research | 2024-02-02 | Paper |
Lower and upper bounding procedures for the bin packing problem with concave loading cost
European Journal of Operational Research | 2023-11-14 | Paper |
A variable neighborhood search for parcel delivery by vehicle with drone cycles
Computers & Operations Research | 2023-09-13 | Paper |
The transportation problem with packing constraints
Computers & Operations Research | 2023-07-03 | Paper |
Optimal design of a district cooling grid: structure, technology integration, and operation
Engineering Optimization | 2022-12-23 | Paper |
A simulation-optimization approach for the stochastic discrete cost multicommodity flow problem
Engineering Optimization | 2022-12-23 | Paper |
Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem
INFORMS Journal on Computing | 2022-06-27 | Paper |
Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem
INFORMS Journal on Computing | 2022-06-27 | Paper |
A matheuristic for the robust integrated airline fleet assignment, aircraft routing, and crew pairing problem
Computers & Operations Research | 2022-03-09 | Paper |
An exact approach for the multicommodity network optimization problem with a step cost function
RAIRO - Operations Research | 2019-11-20 | Paper |
A Primal Decomposition Algorithm for the Two-dimensional Bin Packing Problem
(available as arXiv preprint) | 2019-09-15 | Paper |
A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem
RAIRO - Operations Research | 2018-11-01 | Paper |
A hybrid simulation-optimization approach for the robust discrete time/cost trade-off problem
Applied Mathematics and Computation | 2018-06-07 | Paper |
Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems
European Journal of Operational Research | 2018-02-06 | Paper |
A matheuristic for the asymmetric capacitated vehicle routing problem
Discrete Applied Mathematics | 2017-12-20 | Paper |
Solving a large-scale integrated fleet assignment and crew pairing problem
Annals of Operations Research | 2017-08-22 | Paper |
An assignment-based lower bound for a class of two-machine flow shop problems
Computers & Operations Research | 2016-11-10 | Paper |
Enhanced compact models for the connected subgraph problem and for the shortest path problem in digraphs with negative cycles
Computers & Operations Research | 2016-11-10 | Paper |
An optimization-based heuristic for the machine reassignment problem
Annals of Operations Research | 2016-11-07 | Paper |
Optimization-based very large-scale neighborhood search for generalized assignment problems with location/allocation considerations
INFORMS Journal on Computing | 2016-11-01 | Paper |
Exact solution methods for a generalized assignment problem with location/allocation considerations
INFORMS Journal on Computing | 2016-11-01 | Paper |
Optimization models for a single-plant district cooling system
European Journal of Operational Research | 2016-10-06 | Paper |
The Steiner tree problem with delays: a compact formulation and reduction procedures
Discrete Applied Mathematics | 2015-09-22 | Paper |
A preemptive bound for the resource constrained project scheduling problem
Journal of Scheduling | 2014-08-18 | Paper |
A Benders decomposition approach for an integrated airline schedule design and fleet assignment problem with flight retiming, schedule balance, and demand recapture
Annals of Operations Research | 2014-03-31 | Paper |
| Exact method for robotic cell problem | 2013-11-08 | Paper |
| A computational study of lower bounds for the two dimensional bin packing problem | 2013-11-08 | Paper |
| Climbing discrepancy search for flowshop and jobshop scheduling with time lags | 2013-11-08 | Paper |
Algorithmic expedients for the prize collecting Steiner tree problem
Discrete Optimization | 2013-05-31 | Paper |
Tight compact models and comparative analysis for the prize collecting Steiner tree problem
Discrete Applied Mathematics | 2013-03-12 | Paper |
A branch-and-cut algorithm for the Steiner tree problem with delays
Optimization Letters | 2012-12-28 | Paper |
Enhanced energetic reasoning-based lower bounds for the resource constrained project scheduling problem
Computers & Operations Research | 2012-11-15 | Paper |
Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions
RAIRO - Operations Research | 2012-10-10 | Paper |
Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions
RAIRO - Operations Research | 2012-10-10 | Paper |
Integrated airline schedule design and fleet assignment: polyhedral analysis and Benders' decomposition approach
INFORMS Journal on Computing | 2012-07-28 | Paper |
IP-based energetic reasoning for the resource constrained project scheduling problem
Electronic Notes in Discrete Mathematics | 2012-05-13 | Paper |
An exact algorithm for the Steiner tree problem with delays
Electronic Notes in Discrete Mathematics | 2012-05-13 | Paper |
Strength of three MIP formulations for the prize collecting Steiner tree problem with a quota constraint
Electronic Notes in Discrete Mathematics | 2012-05-13 | Paper |
Exact methods for the robotic cell problem
Flexible Services and Manufacturing Journal | 2012-01-26 | Paper |
Bounding strategies for the hybrid flow shop scheduling problem
Applied Mathematics and Computation | 2011-06-24 | Paper |
Exact approaches for integrated aircraft fleeting and routing at TunisAir
Computational Optimization and Applications | 2011-06-03 | Paper |
Climbing Depth-Bounded Adjacent Discrepancy Search for Solving Hybrid Flow Shop Scheduling Problems with Multiprocessor Tasks
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems | 2011-05-26 | Paper |
Relaxations and exact solution of the variable sized bin packing problem
Computational Optimization and Applications | 2011-05-11 | Paper |
| scientific article; zbMATH DE number 5842437 (Why is no real title available?) | 2011-01-28 | Paper |
Robust scheduling and robustness measures for the discrete time/cost trade-off problem
European Journal of Operational Research | 2010-09-09 | Paper |
Discrepancy search for the flexible job shop scheduling problem
Computers & Operations Research | 2010-09-07 | Paper |
An optimization-based heuristic for the robotic cell problem
European Journal of Operational Research | 2009-11-27 | Paper |
Discrete time/cost trade-off problem: a decomposition-based solution algorithm for the budget version
Computers & Operations Research | 2009-11-27 | Paper |
Energetic reasoning revisited: Application to parallel machine scheduling
Journal of Scheduling | 2009-08-28 | Paper |
Maximizing the minimum completion time on parallel machines
4OR | 2009-07-13 | Paper |
Approximation algorithms for single machine scheduling with one unavailability period
4OR | 2009-06-22 | Paper |
Heuristics for the variable sized bin-packing problem
Computers & Operations Research | 2009-05-19 | Paper |
Optimal solution of the discrete cost multicommodity network design problem
Applied Mathematics and Computation | 2009-01-16 | Paper |
Network flow-based approaches for integrated aircraft fleeting and routing
European Journal of Operational Research | 2008-12-02 | Paper |
Tight bounds for the identical parallel machine‐scheduling problem: Part II
International Transactions in Operational Research | 2008-05-22 | Paper |
The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches
Computational Optimization and Applications | 2008-05-13 | Paper |
Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements
Optimization Letters | 2008-01-25 | Paper |
Minimizing maximum lateness in a flow shop subject to release dates
The Journal of the Operational Research Society | 2007-06-25 | Paper |
Supplier selection and order lot sizing modeling: a review
Computers & Operations Research | 2007-06-04 | Paper |
Tight bounds for the identical parallel machine scheduling problem
International Transactions in Operational Research | 2007-03-30 | Paper |
Optimal scheduling of a two-stage hybrid flow shop
Mathematical Methods of Operations Research | 2007-01-05 | Paper |
An approximate decomposition algorithm for scheduling on parallel machines with heads and tails
Computers & Operations Research | 2006-10-27 | Paper |
A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem
Computers & Operations Research | 2006-06-30 | Paper |
Upper and lower bounding strategies for the generalized minimum spanning tree problem
European Journal of Operational Research | 2006-03-16 | Paper |
Fast lifting procedures for the bin packing problem
Discrete Optimization | 2006-01-09 | Paper |
Solving the generalized minimum spanning tree problem by a branch-and-bound algorithm
The Journal of the Operational Research Society | 2005-06-21 | Paper |
A computational study of the permutation flow shop problem based on a tight lower bound
Computers & Operations Research | 2005-05-12 | Paper |
Optimal parallel machines scheduling with availability constraints
Discrete Applied Mathematics | 2005-05-04 | Paper |
A branch-and-bound-based local search method for the flow shop problem
The Journal of the Operational Research Society | 2005-04-04 | Paper |
A probabilistic greedy search algorithm for combinatorial optimisation with application to the set covering problem
The Journal of the Operational Research Society | 2005-03-14 | Paper |
Minimising Maximum Lateness in a Two-Machine Flowshop
The Journal of the Operational Research Society | 2005-01-10 | Paper |
Lower bounds for scheduling on identical parallel machines with heads and tails
Annals of Operations Research | 2004-08-10 | Paper |
Ant-Tree: an ant colony optimization approach to the generalized minimum spanning tree problem
Journal of Experimental & Theoretical Artificial Intelligence | 2003-08-25 | Paper |
An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines
Operations Research Letters | 2003-05-04 | Paper |
Minimizing makespan on parallel machines subject to release dates and delivery times
Journal of Scheduling | 2002-08-08 | Paper |
Generalized Steiner problems and other variants
Journal of Combinatorial Optimization | 2002-03-12 | Paper |
Optimal cropping patterns under water deficits.
European Journal of Operational Research | 2001-01-01 | Paper |
Generalized spanning trees
European Journal of Operational Research | 2000-09-14 | Paper |
Optimal scheduling of the 3-machine assembly-type flow shop
RAIRO - Operations Research | 2000-08-24 | Paper |
Heuristic algorithms for the two-stage hybrid flowshop problem
Operations Research Letters | 1997-11-06 | Paper |
Plus court chemin avec dépendance horaire : résolution et application aux problèmes de tournées
RAIRO - Operations Research | 1997-07-27 | Paper |
Les problèmes de tournées avec contraintes de fenêtres de temps, l'état de l'art
RAIRO - Operations Research | 1990-01-01 | Paper |
