| Publication | Date of Publication | Type |
|---|
A note on the largest insertion algorithm for the traveling salesman problem
Networks | 2026-01-06 | Paper |
A polynomial-time dynamic programming algorithm for an optimal picking problem in automated warehouses
Journal of Scheduling | 2024-10-16 | Paper |
Algorithms for rescheduling jobs with a LIFO buffer to minimize the weighted number of late jobs
Journal of Scheduling | 2023-07-13 | Paper |
Efficient optimization of the Held-Karp lower bound
OJMO. Open Journal of Mathematical Optimization | 2022-08-20 | Paper |
Optimally rescheduling jobs with a last-in-first-out buffer
Journal of Scheduling | 2022-01-14 | Paper |
A branch-and-cut-and-price algorithm for the electric vehicle routing problem with multiple technologies
SN Operations Research Forum | 2021-02-08 | Paper |
Mathematical Programming Algorithms for Spatial Cloaking
INFORMS Journal on Computing | 2020-12-03 | Paper |
A branch-and-bound algorithm for the prize-collecting single-machine scheduling problem with deadlines and total tardiness minimization
INFORMS Journal on Computing | 2020-11-09 | Paper |
| The prize-collecting scheduling problem with deadlines | 2017-02-14 | Paper |
A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows
Mathematical Programming Computation | 2015-11-19 | Paper |
Optimal selection of contracts and work shifts in multi-skill call centers
EURO Journal on Computational Optimization | 2015-01-28 | Paper |
Combined location and routing problems for drug distribution
Discrete Applied Mathematics | 2014-05-05 | Paper |
Modeling and solving profitable location and distribution problems
Optimization Letters | 2013-11-01 | Paper |
A column generation algorithm for the vehicle routing problem with soft time windows
4OR | 2011-05-25 | Paper |
A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint
Annals of Operations Research | 2010-12-13 | Paper |
A Pricing Algorithm for the Vehicle Routing Problem with Soft Time Windows
Lecture Notes in Economics and Mathematical Systems | 2010-01-20 | Paper |
A Branch-and-Price Algorithm for the Multilevel Generalized Assignment Problem
Operations Research | 2009-08-13 | Paper |
An Optimization Algorithm for the Ordered Open-End Bin-Packing Problem
Operations Research | 2009-08-13 | Paper |
A branch-and-price algorithm for the two-dimensional level strip packing problem
4OR | 2009-07-13 | Paper |
A computational evaluation of a general branch-and-price framework for capacitated network location problems
Annals of Operations Research | 2009-06-25 | Paper |
A dynamic programming algorithm for the single-machine scheduling problem with release dates and deteriorating processing times
Mathematical Methods of Operations Research | 2009-04-27 | Paper |
A branch-and-price algorithm for the multi-source Weber problem
International Journal of Operational Research | 2009-02-05 | Paper |
Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming
Computers & Operations Research | 2008-12-04 | Paper |
New dynamic programming algorithms for the resource constrained elementary shortest path problem
Networks | 2008-06-20 | Paper |
A branch-and-bound algorithm for the linear ordering problem with cumulative costs
European Journal of Operational Research | 2008-04-22 | Paper |
An optimization algorithm for a penalized knapsack problem
Operations Research Letters | 2008-01-15 | Paper |
Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
Discrete Optimization | 2008-01-11 | Paper |
Solving the swath segment selection problem through Lagrangean relaxation
Computers & Operations Research | 2007-10-19 | Paper |
Dynamic programming algorithms for the elementary shortest path problem with resource constraints
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
A dynamic programming algorithm for the single-machine scheduling problem with deteriorating processing times
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Computational approaches to a combinatorial optimization problem arising from text classification
Computers & Operations Research | 2007-02-19 | Paper |
Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery
Computers & Operations Research | 2006-11-15 | Paper |
| scientific article; zbMATH DE number 2230236 (Why is no real title available?) | 2005-11-18 | Paper |
A branch‐and‐price algorithm for the capacitated p‐median problem
Networks | 2005-06-01 | Paper |
A note on the approximation of the asymmetric traveling salesman problem.
European Journal of Operational Research | 2004-01-05 | Paper |
Modeling and optimizing dynamic dial-a-ride problems
International Transactions in Operational Research | 2002-01-30 | Paper |
Data-dependent bounds for the General and the Asymmetric Stacker-Crane problems
Discrete Applied Mathematics | 1999-08-17 | Paper |
| scientific article; zbMATH DE number 1253067 (Why is no real title available?) | 1999-02-22 | Paper |
A worst-case analysis of two approximate algorithms for the asymmetric travelling salesman problem
European Journal of Operational Research | 1998-08-16 | Paper |
A double annealing algorithm for discrete location/allocation problems
European Journal of Operational Research | 1998-07-14 | Paper |
Annealing algorithms for multisource absolute location problems on graph
Computational Optimization and Applications | 1997-06-04 | Paper |
Heuristics from Nature for Hard Combinatorial Optimization Problems
International Transactions in Operational Research | 1997-01-15 | Paper |
