Reformulation and decomposition of integer programs
From MaRDI portal
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
(65)- Using separation algorithms to generate mixed integer model reformulations
- The splitting of variables and constraints in the formulation of integer programming models
- Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix
- 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
- The strength of Dantzig-Wolfe reformulations for the stable set and related problems
- A note on splitting of variables in integer programming models
- Solving bin packing problems using VRPSolver models
- Decomposition of loosely coupled integer programs: a multiobjective perspective
- 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
- Decomposition and dynamic cut generation in integer linear programming
- 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
- Simultaneously exploiting two formulations: an exact Benders decomposition approach
- 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
- 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
- Decomposition in integer linear programming
- Extension complexity, MSO logic, and treewidth
- scientific article; zbMATH DE number 5506108 (Why is no real title available?)
- Reformulations in Mathematical Programming: Definitions and Systematics
- Generating Alternative Mixed-Integer Programming Models Using Variable Redefinition
- scientific article; zbMATH DE number 1216241 (Why is no real title available?)
- 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
- 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
- Formulations and Reformulations in Integer Programming
- Matrices of optimal tree-depth and a row-invariant parameterized algorithm for integer programming
- Solving the temporal knapsack problem via recursive Dantzig-Wolfe reformulation
- 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
- Integer optimization models and algorithms for the multi-period non-shareable resource allocation problem
- Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming
- The storage location assignment and picker routing problem: a generic branch-cut-and-price algorithm
- Last fifty years of integer linear programming: a focus on recent practical advances
- Extended formulations for polygons
- Integrated operating room scheduling and surgical instrument inventory management: models, algorithms, and cost-saving insights
- Algorithms and complexity results for the 0-1 knapsack problem with group fairness
- An augmented Lagrangian decomposition method for the single-source capacitated facility location problem
- A shortest path-based approach to the multileaf collimator sequencing problem
- Intermediate integer programming representations using value disjunctions
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)
