Using separation algorithms to generate mixed integer model reformulations
From MaRDI portal
Recommendations
- Reformulation and decomposition of integer programs
- Generating Alternative Mixed-Integer Programming Models Using Variable Redefinition
- Formulations and Reformulations in Integer Programming
- Solving Mixed Integer Programming Problems Using Automatic Reformulation
- Bilevel programming and the separation problem
Cites work
- scientific article; zbMATH DE number 3815002 (Why is no real title available?)
- scientific article; zbMATH DE number 3580570 (Why is no real title available?)
- scientific article; zbMATH DE number 3422402 (Why is no real title available?)
- A Selection Problem of Shared Fixed Costs and Network Flows
- A dual ascent approach for steiner tree problems on a directed graph
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- Gainfree Leontief substitution flow problems
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Minimum cuts, modular functions, and matroid polyhedra
- Modelling with integer variables
- On cuts and matchings in planar graphs
- On the cut polytope
- Operations that preserve total dual integrality
- Reformulation of the Multiperiod MILP Model for Capacity Expansion of Chemical Processes
- Selected Applications of Minimum Cuts in Networks
- The perfectly matchable subgraph polytope of a bipartite graph
- Trees and Cuts
- Uncapacitated Lot-Sizing Problems with Start-Up Costs
- Uncapacitated lot-sizing: The convex hull of solutions
- Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems
- Valid inequalities and separation for uncapacitated fixed charge networks
Cited in
(72)- An integer program for positive semidefinite zero forcing in graphs
- The role of rationality in integer-programming relaxations
- Electrical flows over spanning trees
- Polyhedral description of the integer single node flow set with constant bounds
- Characterization of facets of the hop constrained chain polytope via dynamic programming
- Parsimonious formulations for low-diameter clusters
- Limitations of the hyperplane separation technique for bounding the extension complexity of polytopes
- An effective compact formulation of the max cut problem on sparse graphs
- Node packings on cocomparability graphs
- Separation routine and extended formulations for the stable set problem in claw-free graphs
- Circuits in extended formulations
- Connected power domination in graphs
- Extended formulations for polygons
- Exploring the tradeoffs among forest planning, roads and wildlife corridors: a new approach
- Learning in combinatorial optimization: what and how to explore
- Smaller extended formulations for spanning tree polytopes in minor-closed classes and beyond
- Valid inequalities for the single arc design problem with set-ups
- A generalization of extension complexity that captures P
- Lifts for Voronoi cells of lattices
- Mixed integer linear programming formulations for probabilistic constraints
- Ordered weighted average optimization in multiobjective spanning tree problem
- Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems
- Multiplicative updates for symmetric-cone factorizations
- On the extension complexity of scheduling polytopes
- Extended formulations of lower-truncated transversal polymatroids
- Extended formulations for sparsity matroids
- On the combinatorial lower bound for the extension complexity of the spanning tree polytope
- The optimal design of low-latency virtual backbones
- Long range planning in the process industries: A projection approach
- Sparktope: linear programs from algorithms
- Certifiably optimal sparse inverse covariance estimation
- Intermediate integer programming representations using value disjunctions
- A new integer programming formulation of the graphical traveling salesman problem
- A new integer programming formulation of the graphical traveling salesman problem
- Linear-size formulations for connected planar graph partitioning and political districting
- Uncapacitated flow-based extended formulations
- New formulations for the elementary shortest-path problem visiting a given set of nodes
- Mixed integer linear programming formulation techniques
- Integer linear programming formulations for the minimum connectivity inference problem and model reduction principles
- Computational comparisons of different formulations for the Stackelberg minimum spanning tree game
- A time-indexed LP-based approach for min-sum job-shop problems
- Lower bounds on matrix factorization ranks via noncommutative polynomial optimization
- A result on projection for the vehicle routing problem
- Improved approaches to solve the one-to-one skewgram problem
- Formulations and Reformulations in Integer Programming
- Deriving compact extended formulations via LP-based separation techniques
- Extended formulations for independence polytopes of regular matroids
- Subgraph polytopes and independence polytopes of count matroids
- Minimum spanning trees with neighborhoods: mathematical programming formulations and solution methods
- The k-Track assignment problem on partial orders
- Extended formulations for radial cones
- Optimal design of switched Ethernet networks implementing the multiple spanning tree protocol
- On the linear extension complexity of stable set polytopes for perfect graphs
- Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: complexity, properties and formulations
- Two‐phase strategies for the bi‐objective minimum spanning tree problem
- Regular matroids have polynomial extension complexity
- On Fault-Tolerant Low-Diameter Clusters in Graphs
- Generating Alternative Mixed-Integer Programming Models Using Variable Redefinition
- Compact vs. exponential-size LP relaxations
- A branch-and-cut algorithm for multiple sequence alignment
- The splitting of variables and constraints in the formulation of integer programming models
- Benders decomposition, branch-and-cut, and hybrid algorithms for the minimum connected dominating set problem
- An extended formulation for the 1‐wheel inequalities of the stable set polytope
- Some \(0/1\) polytopes need exponential size extended formulations
- Fooling sets and the spanning tree polytope
- The prize-collecting generalized minimum spanning tree problem
- Intersection Disjunctions for Reverse Convex Sets
- Deriving compact extended formulations via LP-based separation techniques
- Dendrograms, minimum spanning trees and feature selection
- Strong formulations for mixed integer programming: A survey
- Extended formulations for matroid polytopes through randomized protocols
- Smaller extended formulations for the spanning tree polytope of bounded-genus graphs
This page was built for publication: Using separation algorithms to generate mixed integer model reformulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1178714)
