| Publication | Date of Publication | Type |
|---|
Branch‐and‐cut algorithms for the ‐arborescence star problem
International Transactions in Operational Research | 2023-11-27 | Paper |
Configuration‐based approach for topological problems in the design of wireless sensor networks
International Transactions in Operational Research | 2023-11-16 | Paper |
| Operations research at bulk terminal: a parallel column generation approach | 2022-10-27 | Paper |
Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks
European Journal of Operational Research | 2022-03-11 | Paper |
| A hybrid heuristic for capacitated three-level lot-sizing and replenishment problems with a distribution structure | 2021-12-23 | Paper |
Coupling feasibility pump and large neighborhood search to solve the Steiner team orienteering problem
Computers & Operations Research | 2021-05-21 | Paper |
Coupling Feasibility Pump and Large Neighborhood Search to solve the Steiner team orienteering problem
(available as arXiv preprint) | 2020-12-26 | Paper |
Storage Yard Management: Modelling and Solving
Bioinspired Heuristics for Optimization | 2020-05-26 | Paper |
Corrigendum to: ``Improved combinatorial Benders decomposition for a scheduling problem with unrelated parallel machines
Journal of Applied Mathematics | 2019-03-18 | Paper |
Improved combinatorial Benders decomposition for a scheduling problem with unrelated parallel machines
Journal of Applied Mathematics | 2019-03-18 | Paper |
The \(p\)-arborescence star problem: formulations and exact solution approaches
Computers & Operations Research | 2018-12-03 | Paper |
Bi-objective data gathering path planning for vehicles with bounded curvature
Computers & Operations Research | 2018-07-11 | Paper |
A branch and price algorithm to solve the integrated production planning and scheduling in bulk ports
European Journal of Operational Research | 2018-05-25 | Paper |
| Compact and extended formulations for the virtual network embedding problem | 2018-04-11 | Paper |
The pickup and delivery problem with cross-docking
Computers & Operations Research | 2016-11-14 | Paper |
GRASP with path-relinking for facility layout
Springer Proceedings in Mathematics & Statistics | 2016-09-13 | Paper |
Branch-and-price algorithm for the resilient multi-level hop-constrained network design
European Journal of Operational Research | 2016-06-24 | Paper |
An edge-swap heuristic for generating spanning trees with minimum number of branch vertices
Optimization Letters | 2014-04-30 | Paper |
Branch-and-price algorithms for the two-echelon capacitated vehicle routing problem
Optimization Letters | 2013-11-01 | Paper |
A branch-and-price algorithm for a vehicle routing problem with cross-docking
Electronic Notes in Discrete Mathematics | 2013-07-23 | Paper |
Stronger column generation bounds for the minimum cost hop-and-root constrained forest problem
Electronic Notes in Discrete Mathematics | 2013-07-23 | Paper |
Exact algorithms for a selective vehicle routing problem where the longest route is minimized
Electronic Notes in Discrete Mathematics | 2013-07-19 | Paper |
The minimum cost hop-and-root constrained forest in wireless sensor networks
Electronic Notes in Discrete Mathematics | 2013-07-19 | Paper |
Optimization in designing complex communication networks
Handbook of Optimization in Complex Networks | 2012-09-27 | Paper |
GRASP with path-relinking for the generalized quadratic assignment problem
Journal of Heuristics | 2012-03-09 | Paper |
A novel column generation algorithm for the vehicle routing problem with cross-docking
Lecture Notes in Computer Science | 2011-09-09 | Paper |
Heuristic and exact algorithms for a min-max selective vehicle routing problem
Computers & Operations Research | 2011-01-31 | Paper |
Capacitated lot sizing and sequence dependent setup scheduling: An iterative approach for integration
Journal of Scheduling | 2010-07-24 | Paper |
A scheduling problem with unrelated parallel machines and sequence dependent setups
International Journal of Operational Research | 2010-06-01 | Paper |
A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times
Computers & Operations Research | 2009-12-22 | Paper |
Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times
Computers & Operations Research | 2008-09-01 | Paper |
Integer Programming Formulations for the k-Cardinality Tree Problem
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighbourhood search
IMA Journal of Management Mathematics | 2007-12-18 | Paper |
| Optimization issues in distribution network design | 2007-07-23 | Paper |
A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows
Computers & Operations Research | 2007-01-09 | Paper |
A performance guarantee heuristic for electronic components placement problems including thermal effects
Computers & Operations Research | 2005-06-27 | Paper |
Heuristics for distribution network design in telecommunication
Journal of Heuristics | 2005-06-22 | Paper |
Parallel algorithms for a multi-level network optimization problem
Parallel Algorithms and Applications | 2004-09-27 | Paper |
| scientific article; zbMATH DE number 1981034 (Why is no real title available?) | 2003-09-15 | Paper |
A branch-and-bound algorithm to solve a multi-level network optimization problem
JMMA. Journal of Mathematical Modelling and Algorithms | 2003-08-06 | Paper |
Model and heuristic for a generalized access network design problem
Telecommunication Systems | 2003-03-25 | Paper |
Simulation and analysis of a new mobility model for mobile communication networks
Annals of Operations Research | 2003-01-27 | Paper |
Optimal network design for wireless local area network
Annals of Operations Research | 2002-06-09 | Paper |
Algorithms for a multi-level network optimization problem
European Journal of Operational Research | 2000-05-04 | Paper |
Exact sequential choice of locations in a network
Annals of Operations Research | 1999-06-10 | Paper |
| scientific article; zbMATH DE number 1253063 (Why is no real title available?) | 1999-02-22 | Paper |
Solving to optimality the uncapacitated fixed-charge network flow problem
Computers & Operations Research | 1998-09-27 | Paper |
Dominance Criteria for the Capacitated Warehouse Location Problem
The Journal of the Operational Research Society | 1991-01-01 | Paper |
