Reformulation and Decomposition of Integer Programs
From MaRDI portal
Publication:3565242
DOI10.1007/978-3-540-68279-0_13zbMath1187.90207OpenAlexW2097192020MaRDI 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 (43)
Multiple cost coefficients sensitivity theorems of integer linear optimization ⋮ Consistency Cuts for Dantzig-Wolfe Reformulations ⋮ 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 ⋮ The vehicle allocation problem: alternative formulation and branch-and-price method ⋮ Using the primal-dual interior point algorithm within the branch-price-and-cut method ⋮ Extension complexity of low-dimensional polytopes ⋮ Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost ⋮ A Branch-and-Bound Algorithm for Building Optimal Data Gathering Tree in Wireless Sensor Networks ⋮ On the extension complexity of scheduling polytopes ⋮ Unmanned aerial vehicle set covering problem considering fixed-radius coverage constraint ⋮ Decomposition Branching for Mixed Integer Programming ⋮ Parameterized extension complexity of independent set and related problems ⋮ Routing optimization with time windows under uncertainty ⋮ A branch-and-price algorithm for nanosatellite task scheduling to improve mission quality-of-service ⋮ 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 generic exact solver for vehicle routing and related problems ⋮ Decomposition techniques with mixed integer programming and heuristics for home healthcare planning ⋮ The Steiner connectivity problem ⋮ Mixed-integer linear optimization for optimal lift-gas allocation with well-separator routing ⋮ Lexicographical polytopes ⋮ Unnamed Item ⋮ Strong and compact relaxations in the original space using a compact extended formulation ⋮ 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 ⋮ Rectangle blanket problem: binary integer linear programming formulation and solution algorithms ⋮ Extended formulations for polygons ⋮ Exponential Lower Bounds for Polytopes in Combinatorial Optimization ⋮ Solving bin packing problems using VRPSolver models ⋮ Solving the temporal knapsack problem via recursive Dantzig-Wolfe reformulation ⋮ Random sampling and machine learning to understand good decompositions ⋮ Price-and-verify: a new algorithm for recursive circle packing using Dantzig-Wolfe decomposition ⋮ 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 ⋮ Mixed Integer Linear Programming Formulation Techniques ⋮ A shortest path-based approach to the multileaf collimator sequencing problem ⋮ Column Generation for Extended Formulations ⋮ Matrices of Optimal Tree-Depth and a Row-Invariant Parameterized Algorithm for Integer Programming
This page was built for publication: Reformulation and Decomposition of Integer Programs
