| Publication | Date of Publication | Type |
|---|
| On the relationship between the value function and the efficient frontier of a mixed integer linear optimization problem | 2024-10-09 | Paper |
| A fast and robust algorithm for solving biobjective mixed integer programs | 2024-10-09 | Paper |
| An exact algorithm for the service network design problem with hub capacity constraints | 2023-12-12 | Paper |
| Analysis of the weighted Tchebycheff weight set decomposition for multiobjective discrete optimization problems | 2023-06-28 | Paper |
| On the Relationship Between the Value Function and the Efficient Frontier of a Mixed Integer Linear Optimization Problem | 2023-03-01 | Paper |
| Decomposition of loosely coupled integer programs: a multiobjective perspective | 2022-11-14 | 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 |
| Dynamic discretization discovery for solving the continuous time inventory routing problem with out-and-back routes | 2022-03-09 | Paper |
| Corrigendum to “A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems,” INFORMS Journal on Computing 28(1):14–30, 2016 | 2021-06-23 | Paper |
| Sampling Scenario Set Partition Dual Bounds for Multistage Stochastic Programs | 2020-12-11 | Paper |
| A Criterion Space Method for Biobjective Mixed Integer Programming: The Boxed Line Method | 2020-12-11 | 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 |
| 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 |
| Scheduling unit time arc shutdowns to maximize network flow over time: Complexity results | 2018-05-11 | 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 |
| New multi-commodity flow formulations for the pooling problem | 2017-04-27 | Paper |
| Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions | 2017-03-23 | Paper |
| A polynomially solvable case of the pooling problem | 2017-03-03 | Paper |
| Scheduling network maintenance jobs with release dates and deadlines to maximize total flow over time: bounds and solution strategies | 2016-11-17 | Paper |
| A decision support tool for generating shipping data for the Hunter Valley coal chain | 2016-11-10 | Paper |
| Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period | 2016-10-12 | Paper |
| The \(L\)-shape search method for triobjective integer programming | 2016-06-20 | Paper |
| Minimum cardinality non-anticipativity constraint sets for multistage stochastic programming | 2016-06-06 | Paper |
| A bucket indexed formulation for nonpreemptive single machine scheduling problems | 2016-05-19 | Paper |
| A criterion space search algorithm for biobjective integer programming: the balanced box method | 2016-04-25 | Paper |
| A criterion space search algorithm for biobjective mixed integer programming: the triangle splitting method | 2016-04-25 | Paper |
| A trust region method for the solution of the surrogate dual in integer programming | 2015-12-14 | Paper |
| Boosting the feasibility pump | 2015-09-16 | Paper |
| On the augmented Lagrangian dual for integer programming | 2015-04-16 | 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 | 2015-02-04 | Paper |
| Scheduling arc maintenance jobs in a network to maximize total flow over time | 2014-09-08 | Paper |
| The Triangle Splitting Method for Biobjective Mixed Integer Programming | 2014-06-02 | Paper |
| A New Approach to the Feasibility Pump in Mixed Integer Programming | 2013-01-04 | Paper |
| Solving shortest path problems with a weight constraint and replenishment arcs | 2012-11-15 | Paper |
| A new sequential extraction heuristic for optimizing the delivery of cancer radiation treatment using multileaf collimators | 2012-07-28 | Paper |
| Clique-based facets for the precedence constrained knapsack problem | 2012-06-26 | Paper |
| Efficient intelligent backtracking using linear programming | 2012-05-30 | Paper |
| CP and IP approaches to cancer radiotherapy delivery optimization | 2011-05-25 | Paper |
| Simultaneous solution of Lagrangean dual problems interleaved with preprocessing for the weight constrained shortest path problem | 2010-11-24 | Paper |
| A strengthened formulation and cutting planes for the open pit mine production scheduling problem | 2010-03-18 | Paper |
| Convergent Network Approximation for the Continuous Euclidean Length Constrained Minimum Cost Path Problem | 2010-03-17 | Paper |
| Minimum Cardinality Matrix Decomposition into Consecutive-Ones Matrices: CP and IP Approaches | 2009-03-10 | Paper |
| LP-based disaggregation approaches to solving the open pit mining production scheduling problem with block processing selectivity | 2008-12-04 | Paper |
| Mixed integer programming approaches to exact minimization of total treatment time in cancer radiotherapy using multileaf collimators | 2008-11-20 | Paper |
| New integer linear programming approaches for course timetabling | 2008-01-23 | Paper |
| Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs | 2007-09-21 | Paper |
| Path inequalities for the vehicle routing problem with time windows | 2007-07-30 | Paper |
| Exact procedures for solving the discrete ordered median problem | 2006-08-14 | Paper |
| Facets of the polytope of the asymmetric travelling salesman problem with replenishment arcs | 2006-06-30 | Paper |
| Accelerated label setting algorithms for the elementary resource constrained shortest path problem | 2006-01-18 | Paper |
| Minimizing beam-on time in cancer radiation treatment using multileaf collimators | 2004-08-04 | Paper |
| Preprocessing and cutting for multiple allocation hub location problems. | 2004-03-14 | Paper |
| Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem | 2003-10-29 | Paper |
| A column generation approach to delivery planning over time with inhomogeneous service providers and service interval constraints | 2002-08-20 | Paper |
| Algorithms for the weight constrained shortest path problem | 2002-07-23 | Paper |
| The capacitated multiple allocation hub location problem: Formulations and algorithms | 2002-06-03 | Paper |
| Flight string models for aircraft fleeting and routing | 2002-04-17 | Paper |
| An outer approximate subdifferential method for piecewise affine optimization | 2001-05-06 | Paper |
| The asymmetric traveling salesman problem with replenishment arcs | 2000-01-01 | Paper |
| A dual-active-set algorithm for positive semi-definite quadratic programming | 1997-11-25 | Paper |
| Optimal Two-commodity Flows with Non-linear Cost Functions | 1996-10-03 | Paper |
| A faster version of the ASG algorithm | 1995-09-14 | Paper |
| An Algorithm for Non-Linear Network Programming: Implementation, Results and Comparisons | 1993-01-17 | Paper |
| An algorithm for solving quadratic network flow problems | 1992-06-25 | Paper |
| New methods for multi-commodity flows | 1990-01-01 | Paper |
