Preprocessing and Probing Techniques for Mixed Integer Programming Problems
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
- On using clique overlapping for detecting knapsack constraint redundancy and infeasibility in 0-1 mixed integer programs
- Sequence independent lifting for mixed integer programs with variable upper bounds
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects
- Structure-driven fix-and-propagate heuristics for mixed integer programming
- Stochastic optimization approaches for elective surgery scheduling with downstream capacity constraints: models, challenges, and opportunities
- Presolving linear bilevel optimization problems
- Optimal scrap combination for steel production
- Advances in design and implementation of optimization software
- Mixed-integer programming for cycle detection in nonreversible Markov processes
- Achieving consistency with cutting planes
- On the structure of linear programs with overlapping cardinality constraints
- Enhancements on the hyperplanes arrangements in mixed-integer programming techniques
- Logic cuts for multilevel generalized assignment problems.
- A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem
- scientific article; zbMATH DE number 1538621 (Why is no real title available?)
- Supernode processing of mixed-integer models
- A generic view of Dantzig--Wolfe decomposition in mixed integer programming
- Minimizing makespan on parallel machines subject to release dates and delivery times
- Improving energy aware nanosatellite task scheduling by a branch-cut-and-price algorithm
- Domain reduction techniques for global NLP and MINLP optimization
- Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems
- Integer constraints for enhancing interpretability in linear regression
- Local-MIP: efficient local search for mixed integer programming
- Some properties of cliques in 0-1 mixed integer programs
- Why is maximum clique often easy in practice?
- Worst-case analysis of clique MIPs
- Branch-and-cut for linear programs with overlapping SOS1 constraints
- A conditional logic approach for strengthening mixed 0-1 linear programs
- Logical processing for integer programming
- MINTO, a Mixed INTeger Optimizer
- Benders decomposition for the large-scale probabilistic set covering problem
- Exploiting Solving Phases for Mixed-Integer Programs
- Three enhancements for optimization-based bound tightening
- Bound reduction using pairs of linear inequalities
- Shift-and-propagate
- Preprocessing rules for integer programming solutions to the generalised assignment problem
- Incorporating bounds from decision diagrams into integer programming
- On the Exact Solution of Prize-Collecting Steiner Tree Problems
- Novel formulations and modeling enhancements for the dynamic berth allocation problem
- Scheduling evacuation operations
- A framework for solving mixed-integer semidefinite programs
- A bidirectional evolutionary structural optimization algorithm for mass minimization with multiple structural constraints
- Generalized coefficient strengthening cuts for mixed integer programming
- Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups.
- On identifying dominant cliques.
- Progress in presolving for mixed integer programming
- PILOT, GRASP, and VNS approaches for the static balancing of bicycle sharing systems
- Computational aspects of infeasibility analysis in mixed integer programming
- An exact algorithm for IP column generation
- An algorithm-independent measure of progress for linear constraint propagation
- Two-row and two-column mixed-integer presolve using hashing-based pairing methods
- Knapsack constraint reformulation: A new approach that significantly reduces the number of sub-problems in the branch and bound algorithm
- The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design
- An enumerative procedure for identifying maximal covers
- Solving convex MINLP optimization problems using a sequential cutting plane algorithm
- A multivariate adaptive regression splines cutting plane approach for solving a two-stage stochastic programming fleet assignment model
- A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints
- A partial outer convexification approach to control transmission lines
- Coefficient strengthening: a tool for reformulating mixed-integer programs
- Variable Bound Tightening and Valid Constraints for Multiperiod Blending
- Design of planar articulated mechanisms using branch and bound
- Transformation-based preprocessing for mixed-integer quadratic programs
- A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems
- Extended formulation and valid inequalities for the multi-item inventory lot-sizing problem with supplier selection
- The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
- scientific article; zbMATH DE number 1330764 (Why is no real title available?)
- Feasibility pump 2.0
- Integer-programming software systems
- A computational comparison of symmetry handling methods for mixed integer programs
- Parallel PIPS-SBB: multi-level parallelism for stochastic mixed-integer programs
- BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0--1 programs.
- \(O(n \log n)\) procedures for tightening cover inequalities
- Strong IP formulations need large coefficients
- A novel solution approach with ML-based pseudo-cuts for the flight and maintenance planning problem
- Multiple allocation hub interdiction and protection problems: model formulations and solution approaches
- Preprocessing and cut generation techniques for multi-objective binary programming
- Implications, conflicts, and reductions for Steiner trees
- A fix-propagate-repair heuristic for mixed integer programming
- Integrality gap minimization heuristics for binary mixed integer nonlinear programming
- A structural approach to kernels for ILPs: treewidth and total unimodularity
- Detecting constraint redundancy in 0-1 linear programming problems
- Second-order cover inequalities
- Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities
- Hybrid approaches for the two-scenario max-min knapsack problem
- Multi-Product Inventory Logistics Modeling in the Process Industries
- A supervised learning-driven heuristic for solving the facility location and production planning problem
- Preprocessing and cutting planes with conflict graphs
- Polylithic modeling and solution approaches using algebraic modeling systems
- Automated knowledge source selection and service composition
- Preprocessing for a map sectorization problem by means of mathematical programming
- On handling indicator constraints in mixed integer programming
- Lifting for mixed integer programs with variable upper bounds
- Tailored presolve techniques in branch‐and‐bound method for fast mixed‐integer optimal control applications
- Optimal area polygonization problems: exact solutions through geometric duality
- Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON
- On surrogating 0-1 knapsack constraints
- scientific article; zbMATH DE number 535107 (Why is no real title available?)
- The green capacitated multi-item lot sizing problem with parallel machines
- Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design
This page was built for publication: Preprocessing and Probing Techniques for Mixed Integer Programming Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4319329)
