Information for "Using separation algorithms to generate mixed integer model reformulations"

Basic information

Display title	Using separation algorithms to generate mixed integer model reformulations
Default sort key	Using separation algorithms to generate mixed integer model reformulations
Page length (in bytes)	15
Namespace ID	0
Page ID	8496225
Page content language	en - English
Page content model	wikitext
Indexing by robots	Allowed
Number of redirects to this page	1
Counted as a content page	Yes
Page views in the past month	0
MaRDI portal item ID	Q1178714

Page protection

Edit	Allow all users (infinite)
Move	Allow all users (infinite)

View the protection log for this page.

Edit history

Page creator	Import240129110155 (talk \| contribs)
Date of page creation	00:40, 30 January 2024
Latest editor	AllProfilePages260409040437 (talk \| contribs)
Date of latest edit	12:34, 12 April 2026
Total number of edits	2
Recent number of edits (within past 90 days)	1
Recent number of distinct authors	1

Page properties

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