| Publication | Date of Publication | Type |
|---|
A fast and robust algorithm for solving biobjective mixed integer programs
Mathematical Methods of Operations Research | 2024-10-09 | Paper |
An exact algorithm for the service network design problem with hub capacity constraints
Networks | 2023-12-12 | Paper |
Delivery systems with crowd‐sourced drivers: A pickup and delivery problem with transfers
Networks | 2023-11-23 | Paper |
Biased‐randomized iterated local search for a multiperiod vehicle routing problem with price discounts for delivery flexibility
International Transactions in Operational Research | 2023-11-16 | Paper |
Dynamic service area sizing in urban delivery
OR Spectrum | 2022-09-27 | Paper |
Sequence independent lifting of cover inequalities
Integer Programming and Combinatorial Optimization | 2022-08-30 | Paper |
Decomposition Branching for Mixed Integer Programming
Operations Research | 2022-08-05 | Paper |
Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems
INFORMS Journal on Computing | 2022-06-30 | Paper |
Multivariable Branching: A 0-1 Knapsack Problem Case Study
INFORMS Journal on Computing | 2022-06-28 | Paper |
Time-dependent shortest path problems with penalties and limits on waiting
INFORMS Journal on Computing | 2022-06-27 | Paper |
Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems
European Journal of Operational Research | 2022-05-20 | Paper |
Near real-time loadplan adjustments for less-than-truckload carriers
European Journal of Operational Research | 2022-05-20 | Paper |
Substitution-based equipment balancing in service networks with multiple equipment types
European Journal of Operational Research | 2022-03-18 | Paper |
Optimizing package express operations in China
European Journal of Operational Research | 2022-03-11 | Paper |
Dynamic discretization discovery for solving the continuous time inventory routing problem with out-and-back routes
Computers & Operations Research | 2022-03-09 | Paper |
The vehicle routing problem with heterogeneous locker boxes
CEJOR. Central European Journal of Operations Research | 2021-06-16 | Paper |
System optimal routing of traffic flows with user constraints using linear programming
European Journal of Operational Research | 2021-06-07 | Paper |
Hyperconnected Megacity Parcel Logistic: Joint Parcel Routing and Containerized Consolidation
| 2021-03-02 | Paper |
A column generation-based heuristic for the split delivery vehicle routing problem with time windows
SN Operations Research Forum | 2021-02-08 | Paper |
A Criterion Space Method for Biobjective Mixed Integer Programming: The Boxed Line Method
INFORMS Journal on Computing | 2020-12-11 | Paper |
A branch-and-bound algorithm for the single machine sequence-dependent group scheduling problem with earliness and tardiness penalties
Applied Mathematical Modelling | 2020-01-08 | Paper |
Perspectives on integer programming for time-dependent models
Top | 2019-07-11 | Paper |
Rejoinder on: ``Perspectives on integer programming for time-dependent models
Top | 2019-07-11 | Paper |
Preprocessing and cut generation techniques for multi-objective binary programming
European Journal of Operational Research | 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
4OR | 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
Computers & Operations Research | 2018-07-11 | Paper |
Enhancing urban mobility: integrating ride-sharing and public transit
Computers & Operations Research | 2018-07-11 | Paper |
Complexity of routing problems with release dates and deadlines
European Journal of Operational Research | 2018-05-30 | Paper |
The generalized independent set problem: polyhedral analysis and solution approaches
European Journal of Operational Research | 2018-05-29 | Paper |
The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs
European Journal of Operational Research | 2018-05-29 | Paper |
A new method for optimizing a linear function over the efficient set of a multiobjective integer program
European Journal of Operational Research | 2018-05-29 | Paper |
A note on shortest path problems with forbidden paths
Networks | 2018-05-23 | Paper |
Scheduling reclaimers serving a stock pad at a coal terminal
Journal of Scheduling | 2018-04-03 | Paper |
Adaptive kernel search: a heuristic for solving mixed integer linear programs
European Journal of Operational Research | 2018-02-06 | Paper |
The Continuous-Time Service Network Design Problem
Operations Research | 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
Journal of Graph Algorithms and Applications | 2017-04-05 | Paper |
A branch-and-price guided search approach to maritime inventory routing
Computers & Operations Research | 2017-01-05 | Paper |
A reclaimer scheduling problem arising in coal stockyard management
Journal of Scheduling | 2016-11-16 | Paper |
Creating schedules and computing operating costs for LTL load plans
Computers & Operations Research | 2016-11-14 | Paper |
Pricing for production and delivery flexibility in single-item lot-sizing
Computers & Operations Research | 2016-11-11 | Paper |
A decision support tool for generating shipping data for the Hunter Valley coal chain
Computers & Operations Research | 2016-11-10 | Paper |
The bi-objective mixed capacitated general routing problem with different route balance criteria
European Journal of Operational Research | 2016-10-07 | Paper |
The vehicle routing problem with occasional drivers
European Journal of Operational Research | 2016-10-07 | Paper |
Incremental network design with maximum flows
European Journal of Operational Research | 2016-07-08 | Paper |
The fixed-charge shortest-path problem
INFORMS Journal on Computing | 2016-06-29 | Paper |
Incremental network design with shortest paths
European Journal of Operational Research | 2016-06-23 | Paper |
The \(L\)-shape search method for triobjective integer programming
Mathematical Programming Computation | 2016-06-20 | Paper |
A criterion space search algorithm for biobjective integer programming: the balanced box method
INFORMS Journal on Computing | 2016-04-25 | Paper |
A criterion space search algorithm for biobjective mixed integer programming: the triangle splitting method
INFORMS Journal on Computing | 2016-04-25 | Paper |
Efficient algorithms for travelling salesman problems arising in warehouse order picking
The ANZIAM Journal | 2016-02-22 | Paper |
Boosting the feasibility pump
Mathematical Programming Computation | 2015-09-16 | Paper |
Stratified Patient Appointment Scheduling for Community-based Chronic Disease Management Programs
| 2015-05-28 | Paper |
Exploration of models for a cargo assembly planning problem
| 2015-04-02 | Paper |
Pricing to accelerate demand learning in dynamic assortment planning for perishable products
European Journal of Operational Research | 2015-02-04 | Paper |
Restrict-and-relax search for 0-1 mixed-integer programs
EURO Journal on Computational Optimization | 2014-09-30 | Paper |
Optimization for dynamic ride-sharing: a review
European Journal of Operational Research | 2014-07-27 | Paper |
The triangle splitting method for biobjective mixed integer programming
Integer Programming and Combinatorial Optimization | 2014-06-02 | Paper |
Balancing fleet size and repositioning costs in LTL trucking
Annals of Operations Research | 2013-08-08 | Paper |
Allocating cost of service to customers in inventory routing
Operations Research | 2013-07-02 | Paper |
Truck driver scheduling in Australia
Computers & Operations Research | 2012-11-15 | Paper |
Branch-and-Price Guided Search
Lecture Notes in Computer Science | 2012-11-02 | Paper |
Combining exact and heuristic approaches for the capacitated fixed-charge network flow problem
INFORMS Journal on Computing | 2012-07-28 | Paper |
Dynamic programming-based column generation on time-expanded networks: application to the dial-a-flight problem
INFORMS Journal on Computing | 2012-07-28 | Paper |
An automated intensity-modulated radiation therapy planning system
INFORMS Journal on Computing | 2012-07-28 | Paper |
A branch-price-and-cut algorithm for single-product maritime inventory routing
Operations Research | 2012-06-18 | Paper |
An experimental study of LP-based approximation algorithms for scheduling problems
INFORMS Journal on Computing | 2012-06-08 | Paper |
A parallel, linear programming-based heuristic for large-scale set partitioning problems
INFORMS Journal on Computing | 2012-05-30 | Paper |
Decomposing inventory routing problems with approximate value functions
Naval Research Logistics | 2011-01-06 | Paper |
Fixed routes with backup vehicles for stochastic vehicle routing problems with time constraints
Networks | 2010-11-24 | Paper |
Inventory routing
Operations Research/Computer Science Interfaces | 2010-06-02 | Paper |
Robust optimization for empty repositioning problems
Operations Research | 2010-03-06 | Paper |
Information-based branching schemes for binary linear mixed integer problems
Mathematical Programming Computation | 2010-03-01 | Paper |
Vendor managed inventory for environments with stochastic product usage
European Journal of Operational Research | 2009-11-27 | Paper |
Delivery strategies for blood products supplies
OR Spectrum | 2009-09-18 | Paper |
Approximating the stability region for binary mixed-integer programs
Operations Research Letters | 2009-08-14 | Paper |
Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements
Discrete Optimization | 2008-05-16 | Paper |
A dynamic driver management scheme for less-than-truckload carriers
Computers & Operations Research | 2008-04-28 | Paper |
An optimization algorithm for the inventory routing problem with continuous moves
Computers & Operations Research | 2008-01-23 | Paper |
Competitive analysis of a dispatch policy for a dynamic multi-period routing problem
Operations Research Letters | 2008-01-21 | Paper |
Competitive analysis for dynamic multiperiod uncapacitated routing problems
Networks | 2007-07-30 | Paper |
Shipper collaboration
Computers & Operations Research | 2007-01-09 | Paper |
Inventory routing with continuous moves
Computers & Operations Research | 2007-01-09 | Paper |
Analysis of bounds for a capacitated single-item lot-sizing problem
Computers & Operations Research | 2007-01-09 | Paper |
A generic view of Dantzig--Wolfe decomposition in mixed integer programming
Operations Research Letters | 2006-06-30 | Paper |
Integer-programming software systems
Annals of Operations Research | 2006-03-07 | Paper |
The mixed vertex packing problem.
Mathematical Programming. Series A. Series B | 2004-02-18 | Paper |
Optimal Online Algorithms for Minimax Resource Scheduling
SIAM Journal on Discrete Mathematics | 2004-01-08 | Paper |
Bidirected and unidirected capacity installation in telecommunication networks.
Discrete Applied Mathematics | 2004-01-05 | Paper |
Lifted Cover Inequalities for 0-1 Integer Programs: Complexity
INFORMS Journal on Computing | 2003-12-16 | Paper |
Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
INFORMS Journal on Computing | 2003-11-06 | Paper |
On the polyhedral structure of a multi-item production planning model with setup times
Mathematical Programming. Series A. Series B | 2003-10-29 | Paper |
A multi-item production planning model with setup times: algorithms, reformulations, and polyhedral characterizations for a special case
Mathematical Programming. Series A. Series B | 2003-10-29 | Paper |
The Stochastic Inventory Routing Problem with Direct Deliveries
Transportation Science | 2003-07-07 | Paper |
The relation of time indexed formulations of single machine scheduling problems to the node packing problem
Mathematical Programming. Series A. Series B | 2003-06-30 | Paper |
Efficient feasibility testing for dial-a-ride problems
Operations Research Letters | 2003-04-02 | Paper |
scientific article; zbMATH DE number 1757964 (Why is no real title available?)
| 2002-06-20 | Paper |
Valid inequalities for problems with additive variable upper bounds
Mathematical Programming. Series A. Series B | 2002-05-27 | Paper |
DRIVE: Dynamic routing of independent vehicles
Operations Research | 2002-03-18 | Paper |
Scheduling projects with labor constraints
Discrete Applied Mathematics | 2002-02-27 | Paper |
Branch-and-price: Column generation for solving huge integer programs
Operations Research | 2002-02-07 | Paper |
A branch and cut approach to the cardinality constrained circuit problem.
Mathematical Programming. Series A. Series B | 2002-01-01 | Paper |
Polyhedral results for the edge capacity polytope.
Mathematical Programming. Series A. Series B | 2002-01-01 | Paper |
scientific article; zbMATH DE number 1749231 (Why is no real title available?)
| 2002-01-01 | Paper |
scientific article; zbMATH DE number 1452995 (Why is no real title available?)
| 2001-11-08 | Paper |
Sequence independent lifting in mixed integer programming
Journal of Combinatorial Optimization | 2001-07-19 | Paper |
Conflict graphs in solving integer programming problems
European Journal of Operational Research | 2001-05-02 | Paper |
A polyhedral approach to single-machine scheduling problems.
Mathematical Programming. Series A. Series B | 2000-11-12 | Paper |
Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
Mathematical Programming. Series A. Series B | 2000-11-12 | Paper |
On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra
European Journal of Operational Research | 2000-09-14 | Paper |
scientific article; zbMATH DE number 1303587 (Why is no real title available?)
| 2000-06-21 | Paper |
Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
INFORMS Journal on Computing | 2000-01-01 | Paper |
scientific article; zbMATH DE number 1342120 (Why is no real title available?)
| 1999-11-21 | Paper |
scientific article; zbMATH DE number 1305450 (Why is no real title available?)
| 1999-09-15 | Paper |
A Computational Study of Search Strategies for Mixed Integer Programming
INFORMS Journal on Computing | 1999-01-01 | Paper |
scientific article; zbMATH DE number 1082108 (Why is no real title available?)
| 1998-05-25 | Paper |
A Branch-and-Price Algorithm for the Generalized Assignment Problem
Operations Research | 1998-04-20 | Paper |
A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems
Journal of Heuristics | 1996-09-01 | Paper |
The General Pickup and Delivery Problem
Transportation Science | 1995-06-21 | Paper |
MINTO, a Mixed INTeger Optimizer
Operations Research Letters | 1995-02-19 | Paper |
Preprocessing and Probing Techniques for Mixed Integer Programming Problems
ORSA Journal on Computing | 1995-01-11 | Paper |
Sequential and parallel local search for the time-constrained traveling salesman problem
Discrete Applied Mathematics | 1993-06-29 | Paper |
scientific article; zbMATH DE number 176470 (Why is no real title available?)
| 1993-05-18 | Paper |
The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
ORSA Journal on Computing | 1993-04-01 | Paper |
scientific article; zbMATH DE number 52971 (Why is no real title available?)
| 1993-01-23 | Paper |
A classification scheme for vehicle routing and scheduling problems
European Journal of Operational Research | 1990-01-01 | Paper |
An efficient implementation of local search algorithms for constrained routing problems
European Journal of Operational Research | 1990-01-01 | Paper |
scientific article; zbMATH DE number 4131978 (Why is no real title available?)
| 1989-01-01 | Paper |
scientific article; zbMATH DE number 4047423 (Why is no real title available?)
| 1988-01-01 | Paper |
Edge exchanges in the degree-constrained minimum spanning tree problem
Computers & Operations Research | 1985-01-01 | Paper |
scientific article; zbMATH DE number 3894472 (Why is no real title available?)
| 1984-01-01 | Paper |
