| Publication | Date of Publication | Type |
|---|
The minimum area spanning tree problem: formulations, Benders decomposition and branch-and-cut algorithms
Computational Geometry | 2021-09-17 | Paper |
Dynamic intersection of multiple implicit Dantzig-Wolfe decompositions applied to the adjacent only quadratic minimum spanning tree problem
European Journal of Operational Research | 2020-05-07 | Paper |
Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem
European Journal of Operational Research | 2019-09-09 | Paper |
Exact solution approaches for the multi-period degree constrained minimum spanning tree problem
European Journal of Operational Research | 2018-07-25 | Paper |
Reformulations and branch-and-price algorithm for the minimum cost hop-and-root constrained forest problem
Computers & Operations Research | 2018-07-12 | Paper |
Optimally solving the joint order batching and picker routing problem
European Journal of Operational Research | 2017-12-06 | Paper |
Modelling and solving the joint order batching and picker routing problem in inventories
Lecture Notes in Computer Science | 2016-11-30 | Paper |
Lower bounds and exact algorithms for the quadratic minimum spanning tree problem
Computers & Operations Research | 2016-11-17 | Paper |
The pickup and delivery problem with cross-docking
Computers & Operations Research | 2016-11-14 | Paper |
| A branch-and-cut-and-price algorithm for the Stackelberg minimum spanning tree game | 2016-10-18 | Paper |
Optimality cuts and a branch-and-cut algorithm for the \(k\)-rooted mini-max spanning forest problem
European Journal of Operational Research | 2016-10-06 | Paper |
Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem
Computational Optimization and Applications | 2016-04-04 | Paper |
The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm
Discrete Applied Mathematics | 2015-09-22 | Paper |
Polyhedral results and a branch-and-cut algorithm for the \(k\)-cardinality tree problem
Mathematical Programming. Series A. Series B | 2014-02-03 | 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 |
A parallel Lagrangian relaxation algorithm for the min-degree constrained minimum spanning tree problem
Lecture Notes in Computer Science | 2012-11-02 | Paper |
Optimization in designing complex communication networks
Handbook of Optimization in Complex Networks | 2012-09-27 | Paper |
A new Lagrangian based branch and bound algorithm for the 0-1 knapsack problem
Electronic Notes in Discrete Mathematics | 2012-05-13 | Paper |
Finding min-degree constrained spanning trees faster with a branch-and-cut algorithm
Electronic Notes in Discrete Mathematics | 2012-05-13 | 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 |
A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs
Discrete Applied Mathematics | 2009-06-23 | Paper |
Integer Programming Formulations for the k-Cardinality Tree Problem
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
Stronger upper and lower bounds for a hard batching problem to feed assembly lines
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
Lower and upper bounds for the degree-constrained minimum spanning tree problem
Networks | 2007-07-20 | Paper |
| scientific article; zbMATH DE number 5158530 (Why is no real title available?) | 2007-05-29 | Paper |
