| Publication | Date of Publication | Type |
|---|
| Aesthetic considerations for the min-max \(K\)-windy rural postman problem | 2024-05-03 | Paper |
| Estimating optimal objective values for the TSP, VRP, and other combinatorial problems using randomization | 2024-04-30 | Paper |
| An improved model for estimating optimal VRP solution values | 2024-03-27 | Paper |
| The Hot Spot Coverage Patrol Problem: Formulations and Solution Approaches | 2024-03-22 | Paper |
| The multivisit drone routing problem with edge launches: An iterative approach with discrete and continuous improvements | 2023-12-12 | Paper |
| The rendezvous vehicle routing problem | 2023-10-26 | Paper |
| The generalized close enough traveling salesman problem | 2023-07-11 | Paper |
| The paired mail carrier problem | 2023-07-10 | Paper |
| Old World VS. New World: Evolution of Nobel Prize Shares | 2023-05-05 | Paper |
| A Computational Study Of A New Heuristic For The Site-Dependent Vehicle Routing Problem | 2023-04-21 | Paper |
| Optimal TSP tour length estimation using Sammon maps | 2023-01-18 | Paper |
| Using regression models to understand the impact of route-length variability in practical vehicle routing | 2023-01-18 | Paper |
| Optimal TSP tour length estimation using standard deviation as a predictor | 2022-09-27 | Paper |
| Modeling and Solving the Intersection Inspection Rural Postman Problem | 2022-06-27 | Paper |
| A fresh look at the traveling salesman problem with a center | 2022-06-22 | Paper |
| Data-driven optimization and statistical modeling to improve meter reading for utility companies | 2022-06-22 | Paper |
| The power of linear programming: some surprising and unexpected LPs | 2021-07-14 | Paper |
| An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for The Close-Enough Traveling Salesman Problem | 2021-02-01 | Paper |
| The Mothership and Drone Routing Problem | 2021-01-07 | Paper |
| A Branch-and-Bound Approach to the Traveling Salesman Problem with a Drone | 2020-12-03 | Paper |
| An Open-Source Desktop Application for Generating Arc-Routing Benchmark Instances | 2020-11-09 | Paper |
| Experimental Graph Theory | 2020-05-04 | Paper |
| OAR lib: an open source arc routing library | 2020-02-05 | Paper |
| Multi-visit drone routing problem | 2019-11-11 | Paper |
| The bin packing problem with item fragmentation: a worst-case analysis | 2019-05-17 | Paper |
| A Steiner zone variable neighborhood search heuristic for the close-enough traveling salesman problem | 2018-12-03 | Paper |
| A two-stage solution approach for the directed rural postman problem with turn penalties | 2018-10-30 | Paper |
| A hybrid heuristic procedure for the windy rural postman problem with zigzag time windows | 2018-07-12 | Paper |
| Carousel greedy: a generalized greedy algorithm with applications in optimization | 2018-07-11 | Paper |
| The windy rural postman problem with a time-dependent zigzag option | 2018-05-25 | Paper |
| The vehicle routing problem with drones: Extended models and connections | 2018-05-23 | Paper |
| Applying queueing theory to the study of emergency department operations: a survey and a discussion of comparable simulation studies | 2018-03-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5271460 | 2017-07-11 | Paper |
| The vehicle routing problem with drones: several worst-case results | 2017-04-20 | Paper |
| A novel approach to solve the split delivery vehicle routing problem | 2017-03-16 | Paper |
| The min-max split delivery multi-depot vehicle routing problem with minimum service time requirement | 2016-11-17 | Paper |
| Plowing with precedence: a variant of the windy postman problem | 2016-11-14 | Paper |
| Min-Max vs. Min-Sum vehicle routing: a worst-case analysis | 2016-07-06 | Paper |
| The Generalized Covering Salesman Problem | 2016-06-29 | Paper |
| Comparison of heuristics for the colourful travelling salesman problem | 2015-02-23 | Paper |
| A worst-case analysis for the split delivery capacitated team orienteering problem with minimum delivery amounts | 2014-12-05 | Paper |
| The hierarchical traveling salesman problem | 2013-11-01 | Paper |
| A worst-case analysis for the split delivery vehicle routing problem with minimum delivery amounts | 2013-11-01 | Paper |
| MRSA Transmission Reduction Using Agent-Based Modeling and Simulation | 2012-07-28 | Paper |
| A Parallel Algorithm for the Vehicle Routing Problem | 2012-07-28 | Paper |
| The Multilevel Capacitated Minimum Spanning Tree Problem | 2012-06-18 | Paper |
| Heuristic Search for the Generalized Minimum Spanning Tree Problem | 2012-06-08 | Paper |
| A Genetic Algorithm-Based Approach for Building Accurate Decision Trees | 2012-05-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3084298 | 2011-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3084304 | 2011-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3084324 | 2011-03-15 | Paper |
| The balanced billing cycle vehicle routing problem | 2010-11-24 | Paper |
| A library of local search heuristics for the vehicle routing problem | 2010-10-14 | Paper |
| Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems | 2010-06-11 | Paper |
| Advances in Meter Reading: Heuristic Solution of the Close Enough Traveling Salesman Problem over a Street Network | 2010-06-02 | Paper |
| The effective application of a new approach to the generalized orienteering problem | 2010-05-21 | Paper |
| Genetically Engineered Decision Trees: Population Diversity Produces Smarter Trees | 2009-07-09 | Paper |
| The prize-collecting generalized minimum spanning tree problem | 2008-03-12 | Paper |
| Solving the one-dimensional bin packing problem with a weight annealing heuristic | 2008-01-23 | Paper |
| The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results | 2007-07-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3447236 | 2007-06-28 | Paper |
| A Genetic Algorithm for Solving the Euclidean Non-Uniform Steiner Tree Problem | 2007-05-21 | Paper |
| The Colorful Traveling Salesman Problem | 2007-05-21 | Paper |
| The Generalized Traveling Salesman Problem: A New Genetic Algorithm Approach | 2007-05-21 | Paper |
| The open vehicle routing problem: algorithms, large-scale test problems, and computational results | 2007-04-26 | Paper |
| A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem | 2007-04-13 | Paper |
| A divide-and-conquer local search heuristic for data visualization | 2006-08-14 | Paper |
| Diversification for better classification trees | 2006-08-14 | Paper |
| Very large-scale vehicle routing: new test problems, algorithms, and results | 2005-08-03 | Paper |
| Linear programming models for estimating weights in the analytic hierarchy process | 2005-04-21 | Paper |
| Worst-case behavior of the MVCA heuristic for the minimum labeling spanning tree problem | 2004-11-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736071 | 2004-08-09 | Paper |
| Visualizing group decisions in the analytic hierarchy process. | 2004-02-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4955265 | 2002-11-07 | Paper |
| A computational study of smoothing heuristics for the traveling salesman problem | 2002-01-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4532232 | 2002-01-01 | Paper |
| Using experimental design to find effective parameter settings for heuristics | 2001-01-01 | Paper |
| Predicting the success of nations at the Summer Olympics using neural networks | 1999-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4377052 | 1998-10-11 | Paper |
| The team orienteering problem | 1998-10-07 | Paper |
| A fast and effective heuristic for the orienteering problem | 1998-10-07 | Paper |
| An adaptive memory heuristic for a class of vehicle routing problems with minmax objective | 1998-03-10 | Paper |
| An Operational Analysis Of Shell Planting Strategies For Improving The Survival Of Oyster Larvae In The Chesapeake Bay | 1997-01-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5687196 | 1996-12-11 | Paper |
| Designing and reporting on computational experiments with heuristic methods | 1996-09-01 | Paper |
| A hierarchical strategy for solving traveling salesman problems using elastic nets | 1996-09-01 | Paper |
| Using artificial neural networks to solve the orienteering problem | 1996-02-26 | Paper |
| Estimating the length of the optimal TSP tour: An empirical study using regression and neural networks | 1996-02-25 | Paper |
| An improved heuristic for the period vehicle routing problem | 1996-01-16 | Paper |
| A new heuristic for the period traveling salesman problem | 1995-07-24 | Paper |
| A transportation problem formulation for the MAC airlift planning problem | 1995-05-15 | Paper |
| A New Heuristic for the Multi-Depot Vehicle Routing Problem that Improves upon Best-Known Solutions | 1995-03-15 | Paper |
| The controlled rounding problem: Complexity and computational experience | 1993-09-28 | Paper |
| Large-scale controlled rounding using tabu search with strategic oscillation | 1993-08-16 | Paper |
| Using Simulated Annealing to Solve Controlled Rounding Problems | 1993-04-01 | Paper |
| Cell suppression: Disclosure protection for sensitive tabular data | 1993-01-16 | Paper |
| The controlled rounding problem: Relaxations and complexity issues | 1992-06-25 | Paper |
| A new heuristic for the linear placement problem | 1991-01-01 | Paper |
| Controlled Rounding of Tabular Data | 1990-01-01 | Paper |
| Solving k-shortest and constrained shortest path problems efficiently | 1989-01-01 | Paper |
| Finding the most vital arcs in a network | 1989-01-01 | Paper |
| Interactive Reliability Analysis on a Microcomputer | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3795496 | 1988-01-01 | Paper |
| Simulated Annealing – An Annotated Bibliography | 1988-01-01 | Paper |
| Transforming arc routing into node routing problems | 1987-01-01 | Paper |
| The Capacitated Chinese Postman Problem: Lower Bounds and Solvable Cases | 1987-01-01 | Paper |
| Computingk-shortest path lengths in euclidean networks | 1987-01-01 | Paper |
| The orienteering problem | 1987-01-01 | Paper |
| Experimentation in optimization | 1986-01-01 | Paper |
| Microcomputer-based vehicle routing and scheduling software | 1986-01-01 | Paper |
| A new heuristic for determining fleet size and composition | 1986-01-01 | Paper |
| Using simulated annealing to solve routing and location problems | 1986-01-01 | Paper |
| Nonlinear programming on a microcomputer | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3720323 | 1985-01-01 | Paper |
| A Lagrangean relaxation heuristic for vehicle routing | 1984-01-01 | Paper |
| A decision-theoretic framework for comparing heuristics | 1984-01-01 | Paper |
| A comparison of techniques for solving the fleet size and mix vehicle routing problem | 1984-01-01 | Paper |
| The fleet size and mix vehicle routing problem | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3343723 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3725851 | 1984-01-01 | Paper |
| Stochastic vehicle routing: A comprehensive approach | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3955125 | 1982-01-01 | Paper |
| Capacitated arc routing problems | 1981-01-01 | Paper |
| A note on determining operating strategies for probabilistic vehicle routing | 1980-01-01 | Paper |
| Approximate Traveling Salesman Algorithms | 1980-01-01 | Paper |
| Interval estimation of a global optimum for large combinatorial problems | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3859549 | 1978-01-01 | Paper |
| A problem in network interdiction | 1978-01-01 | Paper |
| Shortest paths with euclidean distances: An explanatory model | 1978-01-01 | Paper |
| Point estimation of a global optimum for large combinatorial problems | 1978-01-01 | Paper |
| Technical Note—Shortest-Path Algorithms: A Comparison | 1977-01-01 | Paper |
| Deterministic network optimization: A bibliography | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4154389 | 1977-01-01 | Paper |
| A statistical approach to the tsp | 1977-01-01 | Paper |
| Counting Trees in a Certain Class of Graphs | 1975-01-01 | Paper |
| A minimum-cost multicommodity network flow problem concerning imports and exports | 1975-01-01 | Paper |
