Information for "Cutting planes in integer and mixed integer programming"

Basic information

Display title	Cutting planes in integer and mixed integer programming
Default sort key	Cutting planes in integer and mixed integer programming
Page length (in bytes)	15
Namespace ID	0
Page ID	8789525
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	None
Central description	scientific article; zbMATH DE number 1801739

Page protection

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

View the protection log for this page.

Edit history

Page creator	Import240129110113 (talk \| contribs)
Date of page creation	10:51, 30 January 2024
Latest editor	AllProfilePages260409040437 (talk \| contribs)
Date of latest edit	17:36, 11 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 (17)	Pages included on this page: Template:Badge (view source) Template:DeepChat (view source) Template:Publication (view source) Template:ReportABug (view source) Module:BacklinksList (view source) Module:HelperMethods (view source) Module:HelperStrConverter (view source) Module:PublicationCitesWork (view source) Module:PublicationContainsTheoremList (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	zbMATH Keywords Miscellaneous (e.g. entity existence) Label: en 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 Cutting plane algorithms for the inverse mixed integer linear programming problem Title A linearization framework for unconstrained quadratic (0-1) problems Title A real coded genetic algorithm for solving integer and mixed integer optimization problems Title Valid inequalities for mixed 0-1 programs Title Label: en A surrogate cutting plane algorithm for all-integer programming Title Valid inequalities and separation for capacitated economic lot sizing Title Label: en Submodularity and valid inequalities in capacitated fixed charge networks Title Label: en A generalization of antiwebs to independence systems and their canonical facets Title Label: en On the facial structure of the set covering polytope Title Label: en Facets and lifting procedures for the set covering polytope Title Label: en Geometric algorithms and combinatorial optimization Title Label: en The application of preprocessing and cutting plane techniques for a class of production planning problems Title Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems Title Capacitated facility location: Separation algorithms and computational experience Label: en Title Minimum cost capacity installation for multicommodity network flows Title Label: en Cutting planes for integer programs with general integer variables Label: en Title The 0-1 knapsack problem with a single continuous variable Title Label: en Logic cuts for processing networks with fixed charges Title Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems Title Label: en The Steiner tree polytope and related polyhedra Title Label: en MINTO, a Mixed INTeger Optimizer Title Label: en A cutting plane approach to capacitated lot-sizing with start-up costs Title Label: en On the \(0/1\) knapsack polytope Title Label: en Primal cutting plane algorithms revisited Title Strong formulations for mixed integer programs: valid inequalities and extended formulations Title T-space and cutting planes Title Cutting planes from a mixed integer Farkas lemma. Title ABACUS Title Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs Title Label: en MIPLIB Label: en Title CPLEX Title OR-Library Title Theoretical challenges towards cutting-plane selection Title MINTO Title Constrained integer fractional programming problem with box constraints Title Laurence A. Wolsey Label: en Title Fiber cable network design in tree networks Title Local search inequalities Title Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning Title Valid inequalities for a single constrained 0-1 MIP set intersected with a conflict graph Title New linearizations of quadratic assignment problems Title Aggregation-based cutting-planes for packing and covering integer programs Title Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation Title Label: en Lifting valid inequalities for the precedence constrained knapsack problem Title Label: en A recursive procedure to generate all cuts for 0-1 mixed integer programs Title Label: en \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts Title Label: en On capacitated network design cut-set polyhedra Title Label: en Solving pseudo-convex mixed integer optimization problems by cutting plane techniques Title \(bc\)-\(opt\): A branch-and-cut code for mixed integer programs Title Label: en Conflict graphs in solving integer programming problems Title Label: en Sequence independent lifting in mixed integer programming Title Label: en An outer-approximation guided optimization approach for constrained neural network inverse problems Title Robert Weismantel Label: en Title Transferring information across restarts in MIP Title On disks of the triangular grid: an application of optimization theory in discrete geometry Title Generating valid linear inequalities for nonlinear programs via sums of squares Title A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation Title A more efficient cutting planes approach for the green vehicle routing problem with capacitated alternative fuel stations Title Design and verify: a new scheme for generating cutting-planes Title bc-prod Title Designing flexible loop-based material handling AGV paths with cell-adjacency priorities: an efficient cutting-plane algorithm Title Feasibility pump algorithm for sparse representation under Laplacian noise Title The green vehicle routing problem with capacitated alternative fuel stations Title On cutting planes for cardinality-constrained linear programs Title An iterative graph expansion approach for the scheduling and routing of airplanes Title A lift-and-project cutting plane algorithm for mixed 0-1 programs Title Label: en Sawing planning using a multicriteria approach Title Local cuts for mixed-integer programming Title Fuzzy clustering: more than just fuzzification Title Parallel PIPS-SBB: multi-level parallelism for stochastic mixed-integer programs Title A bilinear reduction based algorithm for solving capacitated multi-item dynamic pricing problems Title Sequential pairing of mixed integer inequalities Title Edmonds polytopes and a hierarchy of combinatorial problems Title Label: en Gomory cuts revisited Title Label: en Sequence independent lifting for mixed integer programs with variable upper bounds Title Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints Title Label: en A compact formulation of a mixed-integer set Title Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2 Title Design and verify: A new scheme for generating cutting-planes Title Disjunctive cuts for mixed integer nonlinear programming problems Title bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems Title Label: en A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems Title Label: en Matroid Intersection Title Label: en Alexander Martin Label: en Title Outline of an algorithm for integer solutions to linear programs Title Label: en Q3274590 Title bc-opt Title Q3340498 Title Solving Multi-Item Lot-Sizing Problems Using Strong Cutting Planes Title Label: en Pseudo-valid cutting planes for two-stage mixed-integer stochastic programs with right-hand-side uncertainty Title A deterministic method for the unit commitment problem in power systems Title Spherical cuts for integer programming problems Title Polyhedral approaches to mixed integer linear programming Label: en Title Zero-coefficient cuts Title Aggregation and Mixed Integer Rounding to Solve MIPs Title Label: en Challenges in Enterprise Wide Optimization for the Process Industries Title Degree-two Inequalities, Clique Facets, and Biperfect Graphs Title Label: en Solving Large-Scale Zero-One Linear Programming Problems Title Label: en Valid Linear Inequalities for Fixed Charge Problems Title Label: en Subset Coefficient Reduction Cuts for 0/1 Mixed-Integer Programming Title On the redundancy of cutting planes for linear complementarity problems Title Strong Formulations for Multi-Item Capacitated Lot Sizing Title Label: en Generalizations of Cliques, Odd Cycles and Anticycles and Their Relation to Independence System Polyhedra Title Label: en Q3818127 Title Q3840363 Title Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study Title Label: en On Cutting Planes Title Label: en Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms Title Label: en Cones of Matrices and Set-Functions and 0–1 Optimization Title Label: en A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing Title Label: en Q4054818 Title Technical Note—A Note on Zero-One Programming Title Label: en Faces for a linear inequality in 0–1 variables Title Label: en Facet of regular 0–1 polytopes Title Label: en Facets of the knapsack polytope Title Label: en Q4132247 Title Facets of the Knapsack Polytope From Minimal Covers Title Label: en On the Shannon capacity of a graph Title Label: en Valid Inequalities and Superadditivity for 0–1 Integer Programs Title Label: en Disjunctive Programming Title Label: en Q4207787 Title Solving Airline Crew Scheduling Problems by Branch-and-Cut Title Label: en Lot-Sizing with Constant Batches: Formulation and Valid Inequalities Title Label: en Fenchel Cutting Planes for Integer Programs Title Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework Title Label: en Q4398361 Title Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition Title Label: en Q4518860 Title Solving Quadratic Programming by Cutting Planes Title Test sets and inequalities for integer programs Title Q4667214 Title Solving Mixed Integer Programming Problems Using Automatic Reformulation Title Label: en Properties of vertex packing and independence system polyhedra Title Label: en Modeling and Solving the Two-Facility Capacitated Network Loading Problem Title Label: en Q4840772 Title Q4845372 Title Capacitated Facility Location: Valid Inequalities and Facets Title Label: en Network Design Using Cut Inequalities Title Label: en Solving Multiple Knapsack Problems by Cutting Planes Title Label: en Routing Through Virtual Paths in Layered Telecommunication Networks Title Label: en Cutting planes from extended LP formulations Title Short Proofs Are Hard to Find Title An Image-Based Approach to Detecting Structural Similarity Among Mixed Integer Programs Title Learning data manifolds with a cutting plane method Title On the facial structure of set packing polyhedra Title Label: en Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs Title Computational Integer Programming and Cutting Planes Label: en Title Q5629416 Title Q5645210 Title Blocking and anti-blocking pairs of polyhedra Title Label: en Matroids and the greedy algorithm Title Label: en Capacitated Network Design—Polyhedral Structure and Computation Title Label: en Facets of the Complementarity Knapsack Polytope Title Label: en Beating the SDP bound for the floor layout problem: a simple combinatorial idea Title Classical cuts for mixed-integer programming and branch-and-cut Title Classical cuts for mixed-integer programming and branch-and-cut Label: en Title A disjunctive cutting plane procedure for general mixed-integer linear programs Title Label: en Elementary closures for integer programs. Title Mixing mixed-integer inequalities Title Label: en Continuous cutting plane algorithms in integer programming Title An integer linear programming model for tilings Title Inversion of Band-Limited Discrete Fourier Transforms of Binary Images: Uniqueness and Algorithms Title Adaptive cut selection in mixed-integer linear programming Title An interior point cutting plane heuristic for mixed integer programming Title A note on the split rank of intersection cuts Title Enhancing cut selection through reinforcement learning Title Two-set inequalities for the binary knapsack polyhedra Title Hugues Marchand Label: en Title Cutting planes in integer and mixed integer programming Title Miscellaneous (e.g. entity existence) Label: en Sitelink Some statements Mixing polyhedra with two non divisible coefficients Title Testing cut generators for mixed-integer linear programming Title A combinatorial optimization approach to the selection of statistical units Title Knapsack polytopes: a survey Title Polyhedral results on single node variable upper-bound flow models with allowed configurations Title Generating cuts in integer programming with families of special ordered sets Title Chvátal closures for mixed integer programming problems Label: en Title The mixing-MIR set with divisible capacities Title Discrete Applied Mathematics Label: en Relations between facets of low- and high-dimensional group problems Title Cutting plane algorithms for \(0-1\) programming based on cardinality cuts Title Valid inequalities for mixed integer linear programs Title