601 research outputs found
Arc flow formulations based on dynamic programming: Theoretical foundations and applications
Network flow formulations are among the most successful tools to solve optimization problems. Such formulations correspond to determining an optimal flow in a network. One particular class of network flow formulations is the arc flow, where variables represent flows on individual arcs of the network. For NP-hard problems, polynomial-sized arc flow models typically provide weak linear relaxations and may have too much symmetry to be efficient in practice. Instead, arc flow models with a pseudo-polynomial size usually provide strong relaxations and are efficient in practice. The interest in pseudo-polynomial arc flow formulations has grown considerably in the last twenty years, in which they have been used to solve many open instances of hard problems. A remarkable advantage of pseudo-polynomial arc flow models is the possibility to solve practical-sized instances directly by a Mixed Integer Linear Programming solver, avoiding the implementation of complex methods based on column generation. In this survey, we present theoretical foundations of pseudo-polynomial arc flow formulations, by showing a relation between their network and Dynamic Programming (DP). This relation allows a better understanding of the strength of these formulations, through a link with models obtained by Dantzig-Wolfe decomposition. The relation with DP also allows a new perspective to relate state-space relaxation methods for DP with arc flow models. We also present a dual point of view to contrast the linear relaxation of arc flow models with that of models based on paths and cycles. To conclude, we review the main solution methods and applications of arc flow models based on DP in several domains such as cutting, packing, scheduling, and routing
Reformulation and decomposition of integer programs
In this survey we examine ways to reformulate integer and mixed integer programs. Typically, but not exclusively, one reformulates so as to obtain stronger linear programming relaxations, and hence better bounds for use in a branch-and-bound based algorithm. First we cover in detail reformulations based on decomposition, such as Lagrangean relaxation, Dantzig-Wolfe column generation and the resulting branch-and-price algorithms. This is followed by an examination of Benders’ type algorithms based on projection. Finally we discuss in detail extended formulations involving additional variables that are based on problem structure. These can often be used to provide strengthened a priori formulations. Reformulations obtained by adding cutting planes in the original variables are not treated here.Integer program, Lagrangean relaxation, column generation, branch-and-price, extended formulation, Benders' algorithm
The two-dimensional bin packing problem with variable bin sizes and costs
AbstractThe two-dimensional variable sized bin packing problem (2DVSBPP) is the problem of packing a set of rectangular items into a set of rectangular bins. The bins have different sizes and different costs, and the objective is to minimize the overall cost of bins used for packing the rectangles. We present an integer-linear formulation of the 2DVSBPP and introduce several lower bounds for the problem. By using Dantzig–Wolfe decomposition we are able to obtain lower bounds of very good quality. The LP-relaxation of the decomposed problem is solved through delayed column generation, and an exact algorithm based on branch-and-price is developed. The paper is concluded with a computational study, comparing the tightness of the various lower bounds, as well as the performance of the exact algorithm for instances with up to 100 items
Accelerated Benders Decomposition for Variable-Height Transport Packaging Optimisation
This paper tackles the problem of finding optimal variable-height transport
packaging. The goal is to reduce the empty space left in a box when shipping
goods to customers, thereby saving on filler and reducing waste. We cast this
problem as a large-scale mixed integer problem (with over seven billion
variables) and demonstrate various acceleration techniques to solve it
efficiently in about three hours on a laptop. We present a KD-Tree algorithm to
avoid exhaustive grid evaluation of the 3D-bin-packing, provide analytical
transformations to accelerate the Benders decomposition, and an efficient
implementation of the Benders sub problem for significant memory savings and a
three order of magnitude runtime speedup
Price-and-verify: a new algorithm for recursive circle packing using Dantzig–Wolfe decomposition
This is the author accepted manuscript. The final version is available from Springer via the DOI in this record Packing rings into a minimum number of rectangles is an optimization problem which appears naturally in the logistics operations of the tube industry. It encompasses two major difficulties, namely the positioning of rings in rectangles and the recursive packing of rings into other rings. This problem is known as the Recursive Circle Packing Problem (RCPP). We present the first dedicated method for solving RCPP that provides strong dual bounds based on an exact Dantzig–Wolfe reformulation of a nonconvex mixed-integer nonlinear programming formulation. The key idea of this reformulation is to break symmetry on each recursion level by enumerating one-level packings, i.e., packings of circles into other circles, and by dynamically generating packings of circles into rectangles. We use column generation techniques to design a “price-and-verify” algorithm that solves this reformulation to global optimality. Extensive computational experiments on a large test set show that our method not only computes tight dual bounds, but often produces primal solutions better than those computed by heuristics from the literature.Federal Ministry of Education and Researc
Scaling the semidefinite program solver SDPB
We present enhancements to SDPB, an open source, parallelized, arbitrary
precision semidefinite program solver designed for the conformal bootstrap. The
main enhancement is significantly improved performance and scalability using
the Elemental library and MPI. The result is a new version of SDPB that runs on
multiple nodes with hundreds of cores with excellent scaling, making it
practical to solve larger problems. We demonstrate performance on a
moderate-size problem in the 3d Ising CFT and a much larger problem in the
Model.Comment: 13 pages plus references, 2 figure
- …