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