Reformulation and decomposition of integer programs

Recommendations

Formulations and Reformulations in Integer Programming
On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
Decomposition in integer linear programming
Branch-and-price: Column generation for solving huge integer programs
The strength of Dantzig-Wolfe reformulations for the stable set and related problems

Cited in

(58)

The Steiner connectivity problem
Decomposition in integer linear programming
Decomposition of loosely coupled integer programs: a multiobjective perspective
Solving bin packing problems using VRPSolver models
Using the primal-dual interior point algorithm within the branch-price-and-cut method
scientific article; zbMATH DE number 1216241 (Why is no real title available?)
scientific article; zbMATH DE number 5506108 (Why is no real title available?)
Rectangle blanket problem: binary integer linear programming formulation and solution algorithms
Extended formulations for polygons
Integer optimization models and algorithms for the multi-period non-shareable resource allocation problem
Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix
Exponential lower bounds for polytopes in combinatorial optimization
Consistency cuts for Dantzig-Wolfe reformulations
A generic exact solver for vehicle routing and related problems
Random sampling and machine learning to understand good decompositions
High-multiplicity \(N\)-fold IP via configuration LP
The strength of Dantzig-Wolfe reformulations for the stable set and related problems
Set covering heuristics in a benders decomposition for railway timetabling
On the extension complexity of scheduling polytopes
Reformulations in Mathematical Programming: Definitions and Systematics
Extension complexity of low-dimensional polytopes
Intermediate integer programming representations using value disjunctions
A data driven Dantzig-Wolfe decomposition framework
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
Structure Detection in Mixed-Integer Programs
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
Mixed integer linear programming formulation techniques
Routing optimization with time windows under uncertainty
Matrices of optimal tree-depth and a row-invariant parameterized algorithm for integer programming
Simultaneously exploiting two formulations: an exact Benders decomposition approach
Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming
Primal Heuristics for Branch and Price: The Assets of Diving Methods
Column generation for extended formulations
The bus sightseeing problem
A shortest path-based approach to the multileaf collimator sequencing problem
Formulations and Reformulations in Integer Programming
Parameterized extension complexity of independent set and related problems
Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems
Decomposition techniques with mixed integer programming and heuristics for home healthcare planning
Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost
Multiple cost coefficients sensitivity theorems of integer linear optimization
A branch-and-price algorithm for nanosatellite task scheduling to improve mission quality-of-service
Decomposition Branching for Mixed Integer Programming
Automatic Dantzig-Wolfe reformulation of mixed integer programs
Unmanned aerial vehicle set covering problem considering fixed-radius coverage constraint
Price-and-verify: a new algorithm for recursive circle packing using Dantzig-Wolfe decomposition
Extension complexity, MSO logic, and treewidth
Generating Alternative Mixed-Integer Programming Models Using Variable Redefinition
Improving energy aware nanosatellite task scheduling by a branch-cut-and-price algorithm
A resource constrained scheduling problem with multiple independent producers and a single linking constraint: a coal supply chain example
A branch-and-bound algorithm for building optimal data gathering tree in wireless sensor networks
Lexicographical polytopes
Decomposition and dynamic cut generation in integer linear programming
A note on splitting of variables in integer programming models
Solving the temporal knapsack problem via recursive Dantzig-Wolfe reformulation

This page was built for publication: Reformulation and decomposition of integer programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3565242)