Search Results - "Wolsey, Laurence A"

Convex hull results for generalizations of the constant capacity single node flow set by Wolsey, Laurence A., Yaman, Hande

“…For single node flow sets with fixed costs and constant capacities on the inflow and outflow arcs, a family of constant capacity flow covers are known to…”
Get full text

Single-Period Cutting Planes for Inventory Routing Problems by Avella, Pasquale, Boccia, Maurizio, Wolsey, Laurence A

“…The Inventory Routing Problem (IRP) involves the distribution of one or more products from a supplier to a set of clients over a discrete planning horizon…”
Get full text

Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing by Weninger, Dieter, Wolsey, Laurence A.

“…•Three Benders-type algorithms in which the subproblem is a mixed integer program.•Results on instances for capacitated facility location with…”
Get full text

A study of lattice reformulations for integer programming by Aardal, Karen, Scavuzzo, Lara, Wolsey, Laurence A.

“…Branch-and-bound for integer optimization typically uses single-variable disjunctions. Enumerative methods for integer optimization with theoretical guarantees…”
Get full text

bc -- prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems by Belvaux, Gaetan, Wolsey, Laurence A

“…bc — prod is a prototype modelling and optimization system designed and able to tackle a wide variety of the discrete-time lot-sizing problems arising both in…”
Get full text

“Facet” separation with one linear program by Conforti, Michele, Wolsey, Laurence A.

“…Given polyhedron P and and a point x ∗ , the separation problem for polyhedra asks to certify that x ∗ ∈ P and if not, to determine an inequality that is…”
Get full text

Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times by Brahimi, Nadjib, Dauzere-Peres, Stéphane, Wolsey, Laurence A.

“…In this paper, we solve the capacitated multi item lot-sizing problem with non-customer specific production time windows and setup times using two approaches:…”
Get full text

Tight MIP formulations for bounded up/down times and interval-dependent start-ups by Queyranne, Maurice, Wolsey, Laurence A.

“…Switching machines on and off is an important aspect of unit commitment problems and production planning problems, among others. Here we study tight mixed…”
Get full text

Erratum: A tight formulation for uncapacitated lot-sizing with stock upper bounds by Wolsey, Laurence A.

“…For an n -period uncapacitated lot-sizing problem with stock upper bounds, stock fixed costs, stock overload and backlogging, we present a tight extended…”
Get full text

Strong and compact relaxations in the original space using a compact extended formulation by Van Vyve, Mathieu, Wolsey, Laurence A.

“…For certain integer programs, one way to obtain a strong dual bound is to use an extended formulation and then solve the associated linear programming…”
Get full text

Single-item reformulations for a vendor managed inventory routing problem: Computational experience with benchmark instances by Avella, Pasquale, Boccia, Maurizio, Wolsey, Laurence A.

“…The inventory routing problem (IRP) involves the distribution of one or more products from a supplier to a set of customers over a discrete planning horizon…”
Get full text

Continuous knapsack sets with divisible capacities by Wolsey, Laurence A., Yaman, Hande

“…We study two continuous knapsack sets Y ≥ and Y ≤ with n integer, one unbounded continuous and m bounded continuous variables in either ≥ or ≤ form. When the…”
Get full text

Optimum turn-restricted paths, nested compatibility, and optimum convex polygons by Queyranne, Maurice, Wolsey, Laurence A.

“…We consider two apparently unrelated classes of combinatorial and geometric optimization problems. First, we give compact extended formulations, i.e.,…”
Get full text

Relaxations for two-level multi-item lot-sizing problems by Van Vyve, Mathieu, Wolsey, Laurence A., Yaman, Hande

“…We consider several variants of the two-level lot-sizing problem with one item at the upper level facing dependent demand, and multiple items or clients at the…”
Get full text

Two row mixed-integer cuts via lifting by Dey, Santanu S., Wolsey, Laurence A.

“…Recently Andersen et al. [1], Borozan and Cornuéjols [6] and Cornuéjols and Margot [9] have characterized the extreme valid inequalities of a mixed integer set…”
Get full text

MIP formulations and heuristics for two-level production-transportation problems by Melo, Rafael A., Wolsey, Laurence A.

“…A two-level supply chain with multiple items, production sites and client areas and a discrete time horizon is considered. After introducing different mixed…”
Get full text

Two “well-known” properties of subgradient optimization by Anstreicher, Kurt M., Wolsey, Laurence A.

“…The subgradient method is both a heavily employed and widely studied algorithm for non-differentiable optimization. Nevertheless, there are some basic…”
Get full text

The continuous knapsack set by Dash, Sanjeeb, Günlük, Oktay, Wolsey, Laurence A.

“…We study the convex hull of the continuous knapsack set which consists of a single inequality constraint with n non-negative integer and m non-negative bounded…”
Get full text

Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation by Wolsey, Laurence A

“…Based on research on the polyhedral structure of lot-sizing models over the last 20 years, we claim that there is a nontrivial fraction of practical lot-sizing…”
Get full text

Multi-item lot-sizing with joint set-up costs by Anily, Shoshana, Tzur, Michal, Wolsey, Laurence A.

“…We consider a multi-item lot-sizing problem with joint set-up costs and constant capacities. Apart from the usual per unit production and storage costs for…”
Get full text