The following pages link to Natashia Boland (Q291040):
Displaying 50 items.
- Minimum cardinality non-anticipativity constraint sets for multistage stochastic programming (Q291043) (← links)
- The \(L\)-shape search method for triobjective integer programming (Q298165) (← links)
- Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period (Q326488) (← links)
- A decision support tool for generating shipping data for the Hunter Valley coal chain (Q337259) (← links)
- Scheduling network maintenance jobs with release dates and deadlines to maximize total flow over time: bounds and solution strategies (Q342075) (← links)
- Scheduling arc maintenance jobs in a network to maximize total flow over time (Q406493) (← links)
- Clique-based facets for the precedence constrained knapsack problem (Q431007) (← links)
- Boosting the feasibility pump (Q495939) (← links)
- A polynomially solvable case of the pooling problem (Q513170) (← links)
- Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions (Q517317) (← links)
- New multi-commodity flow formulations for the pooling problem (Q524906) (← links)
- CP and IP approaches to cancer radiotherapy delivery optimization (Q538316) (← links)
- (Q896174) (redirect page) (← links)
- A trust region method for the solution of the surrogate dual in integer programming (Q896175) (← links)
- New methods for multi-commodity flows (Q920829) (← links)
- Mixed integer programming approaches to exact minimization of total treatment time in cancer radiotherapy using multileaf collimators (Q955615) (← links)
- LP-based disaggregation approaches to solving the open pit mining production scheduling problem with block processing selectivity (Q958440) (← links)
- An algorithm for solving quadratic network flow problems (Q1175149) (← links)
- (Q1343520) (redirect page) (← links)
- A faster version of the ASG algorithm (Q1343522) (← links)
- A dual-active-set algorithm for positive semi-definite quadratic programming (Q1373722) (← links)
- Preprocessing and cutting for multiple allocation hub location problems. (Q1427587) (← links)
- The asymmetric traveling salesman problem with replenishment arcs (Q1569947) (← links)
- The capacitated multiple allocation hub location problem: Formulations and algorithms (Q1579501) (← links)
- A column generation approach to delivery planning over time with inhomogeneous service providers and service interval constraints (Q1610898) (← links)
- Dealing with demand uncertainty in service network and load plan design (Q1626706) (← links)
- A dynamic discretization discovery algorithm for the minimum duration time-dependent shortest path problem (Q1626744) (← links)
- The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs (Q1753507) (← links)
- A new method for optimizing a linear function over the efficient set of a multiobjective integer program (Q1753509) (← links)
- Preprocessing and cut generation techniques for multi-objective binary programming (Q1755381) (← links)
- Solving shortest path problems with a weight constraint and replenishment arcs (Q1762066) (← links)
- An outer approximate subdifferential method for piecewise affine optimization (Q1970296) (← links)
- Perspectives on integer programming for time-dependent models (Q2001858) (← links)
- Rejoinder on: ``Perspectives on integer programming for time-dependent models'' (Q2001860) (← links)
- Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks (Q2011598) (← links)
- Decomposition of loosely coupled integer programs: a multiobjective perspective (Q2097645) (← links)
- Substitution-based equipment balancing in service networks with multiple equipment types (Q2116916) (← links)
- Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems (Q2140266) (← links)
- Near real-time loadplan adjustments for less-than-truckload carriers (Q2140287) (← links)
- A strengthened formulation and cutting planes for the open pit mine production scheduling problem (Q2270449) (← links)
- On the augmented Lagrangian dual for integer programming (Q2340340) (← links)
- Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs (Q2384394) (← links)
- New integer linear programming approaches for course timetabling (Q2468480) (← links)
- Facets of the polytope of the asymmetric travelling salesman problem with replenishment arcs (Q2494811) (← links)
- Exact procedures for solving the discrete ordered median problem (Q2499160) (← links)
- Pricing to accelerate demand learning in dynamic assortment planning for perishable products (Q2514887) (← links)
- Accelerated label setting algorithms for the elementary resource constrained shortest path problem (Q2583711) (← links)
- Dynamic discretization discovery for solving the continuous time inventory routing problem with out-and-back routes (Q2669743) (← links)
- Algorithms for the Weight Constrained Shortest Path Problem (Q2767722) (← links)
- Flight String Models for Aircraft Fleeting and Routing (Q2783808) (← links)
