Cutting planes in integer and mixed integer programming

DOI10.1016/S0166-218X(01)00348-1zbMath1130.90370OpenAlexW2134656724MaRDI QIDQ697578

Alexander Martin, Robert Weismantel, Hugues Marchand, 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

zbMATH Keywords

Cutting planes Mixed integer programming

Mathematics Subject Classification ID

Integer programming (90C10) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items

Beating the SDP bound for the floor layout problem: a simple combinatorial idea, Knapsack polytopes: a survey, Theoretical challenges towards cutting-plane selection, A deterministic method for the unit commitment problem in power systems, Polyhedral results on single node variable upper-bound flow models with allowed configurations, Fuzzy clustering: more than just fuzzification, Transferring information across restarts in MIP, On disks of the triangular grid: an application of optimization theory in discrete geometry, Parallel PIPS-SBB: multi-level parallelism for stochastic mixed-integer programs, Constrained integer fractional programming problem with box constraints, An Image-Based Approach to Detecting Structural Similarity Among Mixed Integer Programs, An integer linear programming model for tilings, Inversion of Band-Limited Discrete Fourier Transforms of Binary Images: Uniqueness and Algorithms, Adaptive cut selection in mixed-integer linear programming, Generating valid linear inequalities for nonlinear programs via sums of squares, A note on the split rank of intersection cuts, A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation, The mixing-MIR set with divisible capacities, A more efficient cutting planes approach for the green vehicle routing problem with capacitated alternative fuel stations, A bilinear reduction based algorithm for solving capacitated multi-item dynamic pricing problems, Classical cuts for mixed-integer programming and branch-and-cut, Learning Data Manifolds with a Cutting Plane Method, Fiber cable network design in tree networks, Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning, Relations between facets of low- and high-dimensional group problems, New linearizations of quadratic assignment problems, Elementary closures for integer programs., Mixing polyhedra with two non divisible coefficients, A compact formulation of a mixed-integer set, Aggregation-based cutting-planes for packing and covering integer programs, Designing flexible loop-based material handling AGV paths with cell-adjacency priorities: an efficient cutting-plane algorithm, Testing cut generators for mixed-integer linear programming, Feasibility pump algorithm for sparse representation under Laplacian noise, A combinatorial optimization approach to the selection of statistical units, Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs, Pseudo-Valid Cutting Planes for Two-Stage Mixed-Integer Stochastic Programs with Right-Hand-Side Uncertainty, Challenges in Enterprise Wide Optimization for the Process Industries, Short Proofs Are Hard to Find, A linearization framework for unconstrained quadratic (0-1) problems, A real coded genetic algorithm for solving integer and mixed integer optimization problems, The green vehicle routing problem with capacitated alternative fuel stations, An iterative graph expansion approach for the scheduling and routing of airplanes, An outer-approximation guided optimization approach for constrained neural network inverse problems, Sequence independent lifting for mixed integer programs with variable upper bounds

Uses Software

Cites Work