Reformulation and Decomposition of Integer Programs
From MaRDI portal
Publication:3565242
DOI10.1007/978-3-540-68279-0_13zbMath1187.90207MaRDI QIDQ3565242
Laurence A. Wolsey, François Vanderbeck
Publication date: 3 June 2010
Published in: 50 Years of Integer Programming 1958-2008 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-68279-0_13
Related Items
Multiple cost coefficients sensitivity theorems of integer linear optimization, Consistency Cuts for Dantzig-Wolfe Reformulations, Extension complexity of low-dimensional polytopes, A Branch-and-Bound Algorithm for Building Optimal Data Gathering Tree in Wireless Sensor Networks, Decomposition Branching for Mixed Integer Programming, Structure Detection in Mixed-Integer Programs, Primal Heuristics for Branch and Price: The Assets of Diving Methods, Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems, Solving the temporal knapsack problem via recursive Dantzig-Wolfe reformulation, Matrices of Optimal Tree-Depth and a Row-Invariant Parameterized Algorithm for Integer Programming, High-multiplicity \(N\)-fold IP via configuration LP, Set covering heuristics in a benders decomposition for railway timetabling, The bus sightseeing problem, A data driven Dantzig-Wolfe decomposition framework, Improving energy aware nanosatellite task scheduling by a branch-cut-and-price algorithm, A branch-price-and-cut method for the vegetable crop rotation scheduling problem with minimal plot sizes, A branch-cut-and-price algorithm for the piecewise linear transportation problem, Using the primal-dual interior point algorithm within the branch-price-and-cut method, Mixed-integer linear optimization for optimal lift-gas allocation with well-separator routing, Strong and compact relaxations in the original space using a compact extended formulation, Extended formulations for polygons, A shortest path-based approach to the multileaf collimator sequencing problem, Decomposition techniques with mixed integer programming and heuristics for home healthcare planning, Lexicographical polytopes, Rectangle blanket problem: binary integer linear programming formulation and solution algorithms, Solving bin packing problems using VRPSolver models, The vehicle allocation problem: alternative formulation and branch-and-price method, Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost, Unmanned aerial vehicle set covering problem considering fixed-radius coverage constraint, A generic exact solver for vehicle routing and related problems, Random sampling and machine learning to understand good decompositions, Price-and-verify: a new algorithm for recursive circle packing using Dantzig-Wolfe decomposition, Parameterized extension complexity of independent set and related problems, Routing optimization with time windows under uncertainty, The Steiner connectivity problem, A resource constrained scheduling problem with multiple independent producers and a single linking constraint: a coal supply chain example, Automatic Dantzig-Wolfe reformulation of mixed integer programs, On the extension complexity of scheduling polytopes, A branch-and-price algorithm for nanosatellite task scheduling to improve mission quality-of-service, Exponential Lower Bounds for Polytopes in Combinatorial Optimization, Mixed Integer Linear Programming Formulation Techniques, Column Generation for Extended Formulations, Unnamed Item
