Person:291040: Difference between revisions

From MaRDI portal
Person:291040
Created automatically from import230924090903
 
m AuthorDisambiguator moved page Natashia Boland to Natashia Boland: Duplicate
 
(No difference)

Latest revision as of 14:40, 10 December 2023

Available identifiers

zbMath Open boland.natashia-lDBLP98/218WikidataQ27928079 ScholiaQ27928079MaRDI QIDQ291040

List of research outcomes





PublicationDate of PublicationType
On the relationship between the value function and the efficient frontier of a mixed integer linear optimization problem2024-10-09Paper
A fast and robust algorithm for solving biobjective mixed integer programs2024-10-09Paper
An exact algorithm for the service network design problem with hub capacity constraints2023-12-12Paper
Analysis of the weighted Tchebycheff weight set decomposition for multiobjective discrete optimization problems2023-06-28Paper
On the Relationship Between the Value Function and the Efficient Frontier of a Mixed Integer Linear Optimization Problem2023-03-01Paper
Decomposition of loosely coupled integer programs: a multiobjective perspective2022-11-14Paper
Decomposition Branching for Mixed Integer Programming2022-08-05Paper
Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems2022-06-30Paper
Multivariable Branching: A 0-1 Knapsack Problem Case Study2022-06-28Paper
Time-Dependent Shortest Path Problems with Penalties and Limits on Waiting2022-06-27Paper
Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems2022-05-20Paper
Near real-time loadplan adjustments for less-than-truckload carriers2022-05-20Paper
Substitution-based equipment balancing in service networks with multiple equipment types2022-03-18Paper
Dynamic discretization discovery for solving the continuous time inventory routing problem with out-and-back routes2022-03-09Paper
Corrigendum to “A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems,” INFORMS Journal on Computing 28(1):14–30, 20162021-06-23Paper
A Criterion Space Method for Biobjective Mixed Integer Programming: The Boxed Line Method2020-12-11Paper
Sampling Scenario Set Partition Dual Bounds for Multistage Stochastic Programs2020-12-11Paper
Perspectives on integer programming for time-dependent models2019-07-11Paper
Rejoinder on: ``Perspectives on integer programming for time-dependent models2019-07-11Paper
Preprocessing and cut generation techniques for multi-objective binary programming2019-01-09Paper
Dealing with demand uncertainty in service network and load plan design2018-11-21Paper
A dynamic discretization discovery algorithm for the minimum duration time-dependent shortest path problem2018-11-21Paper
The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs2018-05-29Paper
A new method for optimizing a linear function over the efficient set of a multiobjective integer program2018-05-29Paper
Scheduling unit time arc shutdowns to maximize network flow over time: Complexity results2018-05-11Paper
The Continuous-Time Service Network Design Problem2017-12-15Paper
Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks2017-08-04Paper
New multi-commodity flow formulations for the pooling problem2017-04-27Paper
Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions2017-03-23Paper
A polynomially solvable case of the pooling problem2017-03-03Paper
Scheduling network maintenance jobs with release dates and deadlines to maximize total flow over time: bounds and solution strategies2016-11-17Paper
A decision support tool for generating shipping data for the Hunter Valley coal chain2016-11-10Paper
Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period2016-10-12Paper
The \(L\)-shape search method for triobjective integer programming2016-06-20Paper
Minimum cardinality non-anticipativity constraint sets for multistage stochastic programming2016-06-06Paper
A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems2016-05-19Paper
A Criterion Space Search Algorithm for Biobjective Mixed Integer Programming: The Triangle Splitting Method2016-04-25Paper
A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method2016-04-25Paper
A trust region method for the solution of the surrogate dual in integer programming2015-12-14Paper
Boosting the feasibility pump2015-09-16Paper
On the augmented Lagrangian dual for integer programming2015-04-16Paper
Exploration of models for a cargo assembly planning problem2015-04-02Paper
Pricing to accelerate demand learning in dynamic assortment planning for perishable products2015-02-04Paper
Scheduling arc maintenance jobs in a network to maximize total flow over time2014-09-08Paper
The Triangle Splitting Method for Biobjective Mixed Integer Programming2014-06-02Paper
A New Approach to the Feasibility Pump in Mixed Integer Programming2013-01-04Paper
Solving shortest path problems with a weight constraint and replenishment arcs2012-11-15Paper
Clique-based facets for the precedence constrained knapsack problem2012-06-26Paper
Efficient Intelligent Backtracking Using Linear Programming2012-05-30Paper
CP and IP approaches to cancer radiotherapy delivery optimization2011-05-25Paper
Simultaneous solution of Lagrangean dual problems interleaved with preprocessing for the weight constrained shortest path problem2010-11-24Paper
A strengthened formulation and cutting planes for the open pit mine production scheduling problem2010-03-18Paper
Convergent Network Approximation for the Continuous Euclidean Length Constrained Minimum Cost Path Problem2010-03-17Paper
Minimum Cardinality Matrix Decomposition into Consecutive-Ones Matrices: CP and IP Approaches2009-03-10Paper
LP-based disaggregation approaches to solving the open pit mining production scheduling problem with block processing selectivity2008-12-04Paper
Mixed integer programming approaches to exact minimization of total treatment time in cancer radiotherapy using multileaf collimators2008-11-20Paper
New integer linear programming approaches for course timetabling2008-01-23Paper
Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs2007-09-21Paper
Path inequalities for the vehicle routing problem with time windows2007-07-30Paper
Exact procedures for solving the discrete ordered median problem2006-08-14Paper
Facets of the polytope of the asymmetric travelling salesman problem with replenishment arcs2006-06-30Paper
Accelerated label setting algorithms for the elementary resource constrained shortest path problem2006-01-18Paper
Minimizing beam-on time in cancer radiation treatment using multileaf collimators2004-08-04Paper
Preprocessing and cutting for multiple allocation hub location problems.2004-03-14Paper
Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem2003-10-29Paper
A column generation approach to delivery planning over time with inhomogeneous service providers and service interval constraints2002-08-20Paper
Algorithms for the Weight Constrained Shortest Path Problem2002-07-23Paper
The capacitated multiple allocation hub location problem: Formulations and algorithms2002-06-03Paper
Flight String Models for Aircraft Fleeting and Routing2002-04-17Paper
An outer approximate subdifferential method for piecewise affine optimization2001-05-06Paper
The asymmetric traveling salesman problem with replenishment arcs2000-01-01Paper
A dual-active-set algorithm for positive semi-definite quadratic programming1997-11-25Paper
Optimal Two-commodity Flows with Non-linear Cost Functions1996-10-03Paper
A faster version of the ASG algorithm1995-09-14Paper
An Algorithm for Non-Linear Network Programming: Implementation, Results and Comparisons1993-01-17Paper
An algorithm for solving quadratic network flow problems1992-06-25Paper
New methods for multi-commodity flows1990-01-01Paper

Research outcomes over time

This page was built for person: Natashia Boland