Preprocessing and Probing Techniques for Mixed Integer Programming Problems
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem
- Feasibility pump 2.0
- \(O(n \log n)\) procedures for tightening cover inequalities
- Optimal scrap combination for steel production
- Cost optimal allocation of rail passenger lines
- On surrogating 0-1 knapsack constraints
- MINTO, a Mixed INTeger Optimizer
- Supernode processing of mixed-integer models
- An exact algorithm for IP column generation
- Some properties of cliques in 0-1 mixed integer programs
- Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups.
- Logic cuts for multilevel generalized assignment problems.
- BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0--1 programs.
- Advanced preprocessing techniques for linear and quadratic programming
- The multidimensional 0-1 knapsack problem: an overview.
- Advances in design and implementation of optimization software
- Minimizing makespan on parallel machines subject to release dates and delivery times
- The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design
- Branch-and-cut for linear programs with overlapping SOS1 constraints
- The green capacitated multi-item lot sizing problem with parallel machines
- Domain reduction techniques for global NLP and MINLP optimization
- A computational comparison of symmetry handling methods for mixed integer programs
- Multiple allocation hub interdiction and protection problems: model formulations and solution approaches
- Preprocessing and cut generation techniques for multi-objective binary programming
- Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem
- Design of planar articulated mechanisms using branch and bound
- How important are branching decisions: fooling MIP solvers
- On identifying dominant cliques.
- On using clique overlapping for detecting knapsack constraint redundancy and infeasibility in 0-1 mixed integer programs
- A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems
- Enhancements on the hyperplanes arrangements in mixed-integer programming techniques
- Conflict graphs in solving integer programming problems
- Strong IP formulations need large coefficients
- Preprocessing and cutting planes with conflict graphs
- Computational aspects of infeasibility analysis in mixed integer programming
- Worst-case analysis of clique MIPs
- An algorithm-independent measure of progress for linear constraint propagation
- A supervised learning-driven heuristic for solving the facility location and production planning problem
- Optimal area polygonization problems: exact solutions through geometric duality
- Transferring information across restarts in MIP
- Optimality-based domain reduction for inequality-constrained NLP and MINLP problems
- Two-row and two-column mixed-integer presolve using hashing-based pairing methods
- A novel solution approach with ML-based pseudo-cuts for the flight and maintenance planning problem
- Structure-driven fix-and-propagate heuristics for mixed integer programming
- On the structure of linear programs with overlapping cardinality constraints
- Lifting for mixed integer programs with variable upper bounds
- On handling indicator constraints in mixed integer programming
- Bound reduction using pairs of linear inequalities
- Tighter MIP formulations for the discretised unit commitment problem with MIN-stop ramping constraints
- A partial outer convexification approach to control transmission lines
- Parallel PIPS-SBB: multi-level parallelism for stochastic mixed-integer programs
- Novel formulations and modeling enhancements for the dynamic berth allocation problem
- A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem
- Conflict analysis in mixed integer programming
- A generic view of Dantzig--Wolfe decomposition in mixed integer programming
- Searching for mutually orthogonal Latin squares via integer and constraint programming
- Solving convex MINLP optimization problems using a sequential cutting plane algorithm
- Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design
- Improving strong branching by domain propagation
- Sequence independent lifting for mixed integer programs with variable upper bounds
- Extended formulation and valid inequalities for the multi-item inventory lot-sizing problem with supplier selection
- Stochastic optimization approaches for elective surgery scheduling with downstream capacity constraints: models, challenges, and opportunities
- Achieving consistency with cutting planes
- Static analysis by abstract interpretation: a mathematical programming approach
- Transformation-based preprocessing for mixed-integer quadratic programs
- Hybrid approaches for the two-scenario max-min knapsack problem
- Covering linear programming with violations
- Scheduling evacuation operations
- A computational study of conflict graphs and aggressive cut separation in integer programming
- Presolve Reductions in Mixed Integer Programming
- Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems
- A structural approach to kernels for ILPs: treewidth and total unimodularity
- Effective algorithms for a class of discrete valued optimal control problems
- Multi-Product Inventory Logistics Modeling in the Process Industries
- A multivariate adaptive regression splines cutting plane approach for solving a two-stage stochastic programming fleet assignment model
- scientific article; zbMATH DE number 1330764 (Why is no real title available?)
- scientific article; zbMATH DE number 535107 (Why is no real title available?)
- scientific article; zbMATH DE number 1538621 (Why is no real title available?)
- Automated knowledge source selection and service composition
- Exploiting Solving Phases for Mixed-Integer Programs
- Comments on ``enhancements on the hyperplanes arrangements in mixed-integer programming techniques
- Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
- A framework for solving mixed-integer semidefinite programs
- Mixed-integer programming for cycle detection in nonreversible Markov processes
- Preprocessing rules for integer programming solutions to the generalised assignment problem
- The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
- Using dual presolving reductions to reformulate cumulative constraints
- Preprocessing for a map sectorization problem by means of mathematical programming
- Boosting the feasibility pump
- Knapsack constraint reformulation: A new approach that significantly reduces the number of sub-problems in the branch and bound algorithm
- Integer constraints for enhancing interpretability in linear regression
- Convexification of queueing formulas by mixed-integer second-order cone programming: an application to a discrete location problem with congestion
- On the Exact Solution of Prize-Collecting Steiner Tree Problems
- A framework for tightening 0-1 programs based on extensions of pure 0-1 KP and SS problems
- Variable Bound Tightening and Valid Constraints for Multiperiod Blending
- A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints
- Why is maximum clique often easy in practice?
- Three enhancements for optimization-based bound tightening
- Shift-and-propagate
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)
