| Publication | Date of Publication | Type |
|---|
Modeling the flying sidekick traveling salesman problem with multiple drones
Networks | 2023-12-11 | Paper |
Exact models for the flying sidekick traveling salesman problem
International Transactions in Operational Research | 2023-11-27 | Paper |
| Parallel drone scheduling vehicle routing problems with collective drones | 2023-07-07 | Paper |
| Constraint Programming models for the parallel drone scheduling vehicle routing problem | 2023-07-06 | Paper |
Precedence-constrained arborescences
European Journal of Operational Research | 2023-07-04 | Paper |
A branch-and-bound algorithm for the precedence-constrained minimum-cost arborescence problem
Computers & Operations Research | 2023-07-04 | Paper |
Matheuristic algorithms for the parallel drone scheduling traveling salesman problem
Annals of Operations Research | 2022-07-26 | Paper |
| Learning the Quality of Machine Permutations in Job Shop Scheduling | 2022-07-07 | Paper |
Drone-assisted deliveries: new formulations for the flying sidekick traveling salesman problem
Optimization Letters | 2021-07-08 | Paper |
Scheduling jobs with release dates on identical parallel machines by minimizing the total weighted completion time
Computers & Operations Research | 2021-04-20 | Paper |
A branch-and-price algorithm for the temporal bin packing problem
Computers & Operations Research | 2019-11-19 | Paper |
| Models and algorithms for the Flying Sidekick Traveling Salesman Problem | 2019-10-04 | Paper |
On \(f\)-domination: polyhedral and algorithmic results
Mathematical Methods of Operations Research | 2019-09-19 | Paper |
On total \(f\)-domination: polyhedral and algorithmic results
Discrete Applied Mathematics | 2019-03-22 | Paper |
Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines
European Journal of Operational Research | 2019-01-18 | Paper |
Mathematical models and decomposition methods for the multiple knapsack problem
European Journal of Operational Research | 2019-01-09 | Paper |
Exact algorithms for the bin packing problem with fragile objects
Discrete Optimization | 2018-08-17 | Paper |
Scheduling cleaning activities on trains by minimizing idle times
Journal of Scheduling | 2018-04-04 | Paper |
A destroy and repair algorithm for the bike sharing rebalancing problem
Computers & Operations Research | 2016-11-17 | Paper |
Friendly bin packing instances without integer round-up property
Mathematical Programming. Series A. Series B | 2015-04-16 | Paper |
Combinatorial Benders' cuts for the strip packing problem
Operations Research | 2014-12-22 | Paper |
Lower and upper bounds for the bin packing problem with fragile objects
Discrete Applied Mathematics | 2014-09-08 | Paper |
The bin packing problem with precedence constraints
Operations Research | 2013-03-12 | Paper |
| Assignment problems. | 2013-01-17 | Paper |
Heuristic and exact algorithms for the identical parallel machine scheduling problem
INFORMS Journal on Computing | 2012-07-28 | Paper |
Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading
Computers & Operations Research | 2009-12-22 | Paper |
Heuristic algorithms for the multi-depot ring-star problem
European Journal of Operational Research | 2009-12-07 | Paper |
The Capacitated m-Ring-Star Problem
Operations Research | 2009-08-13 | Paper |
The single-finger keyboard layout problem
Computers & Operations Research | 2009-06-18 | Paper |
Shortest paths in piecewise continuous time-dependent networks
Operations Research Letters | 2009-01-09 | Paper |
| Assignment Problems | 2008-10-31 | Paper |
Lower bounds and heuristic algorithms for the \(k_i\)-partitioning problem
European Journal of Operational Research | 2006-03-22 | Paper |
Comparing metaheuristic algorithms for SONET network design problems
Journal of Heuristics | 2005-11-07 | Paper |
| scientific article; zbMATH DE number 2209661 (Why is no real title available?) | 2005-09-28 | Paper |
| scientific article; zbMATH DE number 2209649 (Why is no real title available?) | 2005-09-28 | Paper |
New bounds for optimum traffic assignment in satellite communication.
Computers & Operations Research | 2003-09-07 | Paper |
The base-matroid and inverse combinatorial optimization problems.
Discrete Applied Mathematics | 2003-06-10 | Paper |
A linear time algorithm for scheduling outforests with communication delays on three processors
Journal of Algorithms | 2003-05-14 | Paper |
Solution of large weighted equicut problems
European Journal of Operational Research | 2002-08-18 | Paper |
A lower bound for the non-oriented two-dimensional bin packing problem
Discrete Applied Mathematics | 2002-05-15 | Paper |
Bounds for the cardinality constrained \(P \|C_{max}\) problem
Journal of Scheduling | 2001-08-27 | Paper |
Reduction of the three-partition problem
Journal of Combinatorial Optimization | 2001-02-09 | Paper |
Combining linear and nonlinear objectives in spanning tree problems
Journal of Combinatorial Optimization | 2000-10-30 | Paper |
Exact solution of the SONET ring loading problem
Operations Research Letters | 2000-01-31 | Paper |
Algorithms and codes for dense assignment problems: The state of the art
Discrete Applied Mathematics | 2000-01-30 | Paper |
Solution of the cumulative assignment problem with a well-structured tabu search method
Journal of Heuristics | 1999-11-08 | Paper |
A Lagrangian heuristic for the Prize Collecting Travelling Salesman Problem
Annals of Operations Research | 1998-09-27 | Paper |
| scientific article; zbMATH DE number 1175960 (Why is no real title available?) | 1998-07-19 | Paper |
The \(k\)-cardinality assignment problem
Discrete Applied Mathematics | 1998-03-10 | Paper |
Algorithm 750: CDT
ACM Transactions on Mathematical Software | 1998-01-26 | Paper |
Exact solution of large-scale, asymmetric traveling salesman problems
ACM Transactions on Mathematical Software | 1998-01-26 | Paper |
Shop Problems With Two Machines and Time Lags
Operations Research | 1998-01-25 | Paper |
| scientific article; zbMATH DE number 1054945 (Why is no real title available?) | 1997-10-27 | Paper |
| scientific article; zbMATH DE number 1054964 (Why is no real title available?) | 1997-08-28 | Paper |
Optimal Scheduling of Tasks on Identical Parallel Processors
ORSA Journal on Computing | 1997-03-25 | Paper |
Open shop, satellite communication and a theorem by Egerváry (1931)
Operations Research Letters | 1997-02-11 | Paper |
On Prize‐collecting Tours and the Asymmetric Travelling Salesman Problem
International Transactions in Operational Research | 1997-01-06 | Paper |
| Complexity of spanning tree problems with leaf-dependent objectives | 1996-08-05 | Paper |
On some multicriteria arborescence problems: Complexity and algorithms
Discrete Applied Mathematics | 1996-07-07 | Paper |
Minimizing the sum of weighted completion times with unrestricted weights
Discrete Applied Mathematics | 1995-12-03 | Paper |
Heuristic Algorithms for the Multiple Depot Vehicle Scheduling Problem
Management Science | 1993-09-15 | Paper |
Applying tabu search to the job-shop scheduling problem
Annals of Operations Research | 1993-08-16 | Paper |
A branch and bound algorithm for the multiple depot vehicle scheduling problem
Networks | 1989-01-01 | Paper |
Self-Labeling the Job Shop Scheduling Problem
(available as arXiv preprint) | N/A | Paper |
