| Publication | Date of Publication | Type |
|---|
| An exact algorithm for the service network design problem with hub capacity constraints | 2023-12-12 | Paper |
| Delivery systems with crowd‐sourced drivers: A pickup and delivery problem with transfers | 2023-11-23 | Paper |
| Biased‐randomized iterated local search for a multiperiod vehicle routing problem with price discounts for delivery flexibility | 2023-11-16 | Paper |
| Dynamic service area sizing in urban delivery | 2022-09-27 | Paper |
| Sequence independent lifting of cover inequalities | 2022-08-30 | Paper |
| Decomposition Branching for Mixed Integer Programming | 2022-08-05 | Paper |
| Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems | 2022-06-30 | Paper |
| Multivariable Branching: A 0-1 Knapsack Problem Case Study | 2022-06-28 | Paper |
| Time-Dependent Shortest Path Problems with Penalties and Limits on Waiting | 2022-06-27 | Paper |
| Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems | 2022-05-20 | Paper |
| Near real-time loadplan adjustments for less-than-truckload carriers | 2022-05-20 | Paper |
| Substitution-based equipment balancing in service networks with multiple equipment types | 2022-03-18 | Paper |
| Optimizing package express operations in China | 2022-03-11 | Paper |
| Dynamic discretization discovery for solving the continuous time inventory routing problem with out-and-back routes | 2022-03-09 | Paper |
| The vehicle routing problem with heterogeneous locker boxes | 2021-06-16 | Paper |
| System optimal routing of traffic flows with user constraints using linear programming | 2021-06-07 | Paper |
| A column generation-based heuristic for the split delivery vehicle routing problem with time windows | 2021-02-08 | Paper |
| A Criterion Space Method for Biobjective Mixed Integer Programming: The Boxed Line Method | 2020-12-11 | Paper |
| A branch-and-bound algorithm for the single machine sequence-dependent group scheduling problem with earliness and tardiness penalties | 2020-01-08 | Paper |
| Perspectives on integer programming for time-dependent models | 2019-07-11 | Paper |
| Rejoinder on: ``Perspectives on integer programming for time-dependent models | 2019-07-11 | Paper |
| Preprocessing and cut generation techniques for multi-objective binary programming | 2019-01-09 | Paper |
| Dealing with demand uncertainty in service network and load plan design | 2018-11-21 | Paper |
| A dynamic discretization discovery algorithm for the minimum duration time-dependent shortest path problem | 2018-11-21 | Paper |
| Nondominated Nash points: application of biobjective mixed integer programming | 2018-08-03 | Paper |
| A linear programming based algorithm to solve a class of optimization problems with a multi-linear objective function and affine constraints | 2018-07-11 | Paper |
| Enhancing urban mobility: integrating ride-sharing and public transit | 2018-07-11 | Paper |
| Complexity of routing problems with release dates and deadlines | 2018-05-30 | Paper |
| The generalized independent set problem: polyhedral analysis and solution approaches | 2018-05-29 | Paper |
| The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs | 2018-05-29 | Paper |
| A new method for optimizing a linear function over the efficient set of a multiobjective integer program | 2018-05-29 | Paper |
| A note on shortest path problems with forbidden paths | 2018-05-23 | Paper |
| Scheduling reclaimers serving a stock pad at a coal terminal | 2018-04-03 | Paper |
| Adaptive kernel search: a heuristic for solving mixed integer linear programs | 2018-02-06 | Paper |
| The Continuous-Time Service Network Design Problem | 2017-12-15 | Paper |
| Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks | 2017-08-04 | Paper |
| Incremental Network Design with Minimum Spanning Trees | 2017-04-05 | Paper |
| A branch-and-price guided search approach to maritime inventory routing | 2017-01-05 | Paper |
| A reclaimer scheduling problem arising in coal stockyard management | 2016-11-16 | Paper |
| Creating schedules and computing operating costs for LTL load plans | 2016-11-14 | Paper |
| Pricing for production and delivery flexibility in single-item lot-sizing | 2016-11-11 | Paper |
| A decision support tool for generating shipping data for the Hunter Valley coal chain | 2016-11-10 | Paper |
| The bi-objective mixed capacitated general routing problem with different route balance criteria | 2016-10-07 | Paper |
| Incremental network design with maximum flows | 2016-07-08 | Paper |
| The Fixed-Charge Shortest-Path Problem | 2016-06-29 | Paper |
| Incremental network design with shortest paths | 2016-06-23 | Paper |
| The \(L\)-shape search method for triobjective integer programming | 2016-06-20 | Paper |
| A Criterion Space Search Algorithm for Biobjective Mixed Integer Programming: The Triangle Splitting Method | 2016-04-25 | Paper |
| A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method | 2016-04-25 | Paper |
| EFFICIENT ALGORITHMS FOR TRAVELLING SALESMAN PROBLEMS ARISING IN WAREHOUSE ORDER PICKING | 2016-02-22 | Paper |
| Boosting the feasibility pump | 2015-09-16 | Paper |
| Pricing to accelerate demand learning in dynamic assortment planning for perishable products | 2015-02-04 | Paper |
| Restrict-and-relax search for 0-1 mixed-integer programs | 2014-09-30 | Paper |
| Optimization for dynamic ride-sharing: a review | 2014-07-27 | Paper |
| The Triangle Splitting Method for Biobjective Mixed Integer Programming | 2014-06-02 | Paper |
| Balancing fleet size and repositioning costs in LTL trucking | 2013-08-08 | Paper |
| Allocating Cost of Service to Customers in Inventory Routing | 2013-07-02 | Paper |
| Truck driver scheduling in Australia | 2012-11-15 | Paper |
| Branch-and-Price Guided Search | 2012-11-02 | Paper |
| Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem | 2012-07-28 | Paper |
| An Automated Intensity-Modulated Radiation Therapy Planning System | 2012-07-28 | Paper |
| Dynamic Programming-Based Column Generation on Time-Expanded Networks: Application to the Dial-a-Flight Problem | 2012-07-28 | Paper |
| A Branch-Price-and-Cut Algorithm for Single-Product Maritime Inventory Routing | 2012-06-18 | Paper |
| An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems | 2012-06-08 | Paper |
| A Parallel, Linear Programming-based Heuristic for Large-Scale Set Partitioning Problems | 2012-05-30 | Paper |
| Decomposing inventory routing problems with approximate value functions | 2011-01-06 | Paper |
| Fixed routes with backup vehicles for stochastic vehicle routing problems with time constraints | 2010-11-24 | Paper |
| Inventory Routing | 2010-06-02 | Paper |
| Robust Optimization for Empty Repositioning Problems | 2010-03-06 | Paper |
| Information-based branching schemes for binary linear mixed integer problems | 2010-03-01 | Paper |
| Vendor managed inventory for environments with stochastic product usage | 2009-11-27 | Paper |
| Delivery strategies for blood products supplies | 2009-09-18 | Paper |
| Approximating the stability region for binary mixed-integer programs | 2009-08-14 | Paper |
| Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements | 2008-05-16 | Paper |
| A dynamic driver management scheme for less-than-truckload carriers | 2008-04-28 | Paper |
| An optimization algorithm for the inventory routing problem with continuous moves | 2008-01-23 | Paper |
| Competitive analysis of a dispatch policy for a dynamic multi-period routing problem | 2008-01-21 | Paper |
| Competitive analysis for dynamic multiperiod uncapacitated routing problems | 2007-07-30 | Paper |
| Shipper collaboration | 2007-01-09 | Paper |
| Analysis of bounds for a capacitated single-item lot-sizing problem | 2007-01-09 | Paper |
| Inventory routing with continuous moves | 2007-01-09 | Paper |
| A generic view of Dantzig--Wolfe decomposition in mixed integer programming | 2006-06-30 | Paper |
| Integer-programming software systems | 2006-03-07 | Paper |
| The mixed vertex packing problem. | 2004-02-18 | Paper |
| Optimal Online Algorithms for Minimax Resource Scheduling | 2004-01-08 | Paper |
| Bidirected and unidirected capacity installation in telecommunication networks. | 2004-01-05 | Paper |
| Lifted Cover Inequalities for 0-1 Integer Programs: Complexity | 2003-12-16 | Paper |
| Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition | 2003-11-06 | Paper |
| On the polyhedral structure of a multi-item production planning model with setup times | 2003-10-29 | Paper |
| A multi-item production planning model with setup times: algorithms, reformulations, and polyhedral characterizations for a special case | 2003-10-29 | Paper |
| The Stochastic Inventory Routing Problem with Direct Deliveries | 2003-07-07 | Paper |
| The relation of time indexed formulations of single machine scheduling problems to the node packing problem | 2003-06-30 | Paper |
| Efficient feasibility testing for dial-a-ride problems | 2003-04-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4537752 | 2002-06-20 | Paper |
| Valid inequalities for problems with additive variable upper bounds | 2002-05-27 | Paper |
| Drive: Dynamic Routing of Independent Vehicles | 2002-03-18 | Paper |
| Scheduling projects with labor constraints | 2002-02-27 | Paper |
| Branch-and-Price: Column Generation for Solving Huge Integer Programs | 2002-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4532234 | 2002-01-01 | Paper |
| Polyhedral results for the edge capacity polytope. | 2002-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4955267 | 2001-11-08 | Paper |
| Sequence independent lifting in mixed integer programming | 2001-07-19 | Paper |
| Conflict graphs in solving integer programming problems | 2001-05-02 | Paper |
| Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs | 2000-11-12 | Paper |
| A polyhedral approach to single-machine scheduling problems. | 2000-11-12 | Paper |
| On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra | 2000-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250213 | 2000-06-21 | Paper |
| Time-Indexed Formulations for Machine Scheduling Problems: Column Generation | 2000-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263702 | 1999-11-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252336 | 1999-09-15 | Paper |
| A Computational Study of Search Strategies for Mixed Integer Programming | 1999-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4365135 | 1998-05-25 | Paper |
| A Branch-and-Price Algorithm for the Generalized Assignment Problem | 1998-04-20 | Paper |
| A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems | 1996-09-01 | Paper |
| The General Pickup and Delivery Problem | 1995-06-21 | Paper |
| MINTO, a Mixed INTeger Optimizer | 1995-02-19 | Paper |
| Preprocessing and Probing Techniques for Mixed Integer Programming Problems | 1995-01-11 | Paper |
| Sequential and parallel local search for the time-constrained traveling salesman problem | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035632 | 1993-05-18 | Paper |
| The Vehicle Routing Problem with Time Windows: Minimizing Route Duration | 1993-04-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4003232 | 1993-01-23 | Paper |
| A classification scheme for vehicle routing and scheduling problems | 1990-01-01 | Paper |
| An efficient implementation of local search algorithms for constrained routing problems | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3033585 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3783827 | 1988-01-01 | Paper |
| Edge exchanges in the degree-constrained minimum spanning tree problem | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5186732 | 1984-01-01 | Paper |
