Preprocessing and Probing Techniques for Mixed Integer Programming Problems
From MaRDI portal
Publication:4319329
DOI10.1287/ijoc.6.4.445zbMath0814.90093OpenAlexW2106106289MaRDI QIDQ4319329
Publication date: 11 January 1995
Published in: ORSA Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/9b5d26d391724ae49aeda072769658b9319d8887
Related Items
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, Improving energy aware nanosatellite task scheduling by a branch-cut-and-price algorithm, Presolving linear bilevel optimization problems, Tailored presolve techniques in branch‐and‐bound method for fast mixed‐integer optimal control applications, Constraint Integer Programming: A New Approach to Integrate CP and MIP, A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints, Why Is Maximum Clique Often Easy in Practice?, A framework for solving mixed-integer semidefinite programs, Mixed-Integer Programming for Cycle Detection in Nonreversible Markov Processes, The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization, Optimization, Implications, conflicts, and reductions for Steiner trees, 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, Incorporating bounds from decision diagrams into integer programming, Minotaur: a mixed-integer nonlinear optimization toolkit, MINTO, a Mixed INTeger Optimizer, Supernode processing of mixed-integer models, On handling indicator constraints in mixed integer programming, A supervised learning-driven heuristic for solving the facility location and production planning problem, A Structural Approach to Kernels for ILPs: Treewidth and Total Unimodularity, Scheduling evacuation operations, Coefficient strengthening: a tool for reformulating mixed-integer programs, Optimal area polygonization problems: exact solutions through geometric duality, A computational study of conflict graphs and aggressive cut separation in integer programming, Branch-and-cut for linear programs with overlapping SOS1 constraints, Hybrid approaches for the two-scenario max-min knapsack problem, An exact algorithm for IP column generation, The green capacitated multi-item lot sizing problem with parallel machines, Bound reduction using pairs of linear inequalities, Some properties of cliques in 0-1 mixed integer programs, Tighter MIP formulations for the discretised unit commitment problem with MIN-stop ramping constraints, Transferring information across restarts in MIP, \(O(n \log n)\) procedures for tightening cover inequalities, A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems, Covering Linear Programming with Violations, 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, Optimality-based domain reduction for inequality-constrained NLP and MINLP problems, PILOT, GRASP, and VNS approaches for the static balancing of bicycle sharing systems, 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, Achieving consistency with cutting planes, A multivariate adaptive regression splines cutting plane approach for solving a two-stage stochastic programming fleet assignment model, Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups., Logic cuts for multilevel generalized assignment problems., Progress in presolving for mixed integer programming, Domain reduction techniques for global NLP and MINLP optimization, BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0--1 programs., Automated knowledge source selection and service composition, Two-row and two-column mixed-integer presolve using hashing-based pairing methods, The multidimensional 0-1 knapsack problem: an overview., Second-order cover inequalities, Conflict graphs in solving integer programming problems, Using dual presolving reductions to reformulate cumulative constraints, Preprocessing for a map sectorization problem by means of mathematical programming, 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 dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem, Boosting the feasibility pump, A computational comparison of symmetry handling methods for mixed integer programs, A novel solution approach with ML-based pseudo-cuts for the flight and maintenance planning problem, Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities, Conflict analysis in mixed integer programming, Generalized coefficient strengthening cuts for mixed integer programming, Three enhancements for optimization-based bound tightening, Multiple allocation hub interdiction and protection problems: model formulations and solution approaches, Shift-and-propagate, Preprocessing and cut generation techniques for multi-objective binary programming, Polylithic modeling and solution approaches using algebraic modeling systems, Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem, Unnamed Item, On the exact separation of mixed integer knapsack cuts, Alternating control tree search for knapsack/covering problems, Effective Algorithms for a Class of Discrete Valued Optimal Control Problems, A generic view of Dantzig--Wolfe decomposition in mixed integer programming, Searching for mutually orthogonal Latin squares via integer and constraint programming, Strong IP formulations need large coefficients, Design of planar articulated mechanisms using branch and bound, Integrality gap minimization heuristics for binary mixed integer nonlinear programming, Preprocessing and cutting planes with conflict graphs, How important are branching decisions: fooling MIP solvers, 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, SCIP: solving constraint integer programs, Structure-driven fix-and-propagate heuristics for mixed integer programming, On the structure of linear programs with overlapping cardinality constraints, RENS. The optimal rounding, Solving an integrated job-shop problem with human resource constraints, Static Analysis by Abstract Interpretation: A Mathematical Programming Approach, On identifying dominant cliques., Presolve Reductions in Mixed Integer Programming, On using clique overlapping for detecting knapsack constraint redundancy and infeasibility in 0-1 mixed integer programs, Multi-Product Inventory Logistics Modeling in the Process Industries, Computational aspects of infeasibility analysis in mixed integer programming, Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems, Optimal scrap combination for steel production, An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem, Feasibility pump 2.0, Worst-case analysis of clique MIPs, Cost optimal allocation of rail passenger lines, On surrogating 0-1 knapsack constraints, Sequence independent lifting for mixed integer programs with variable upper bounds, Lifting for mixed integer programs with variable upper bounds, Advances in design and implementation of optimization software, An algorithm-independent measure of progress for linear constraint propagation, Minimizing makespan on parallel machines subject to release dates and delivery times, The multidimensional 0-1 knapsack problem -- bounds and computational aspects, A conditional logic approach for strengthening mixed 0-1 linear programs, Integer-programming software systems, Logical processing for integer programming
Uses Software
