Mixed integer programming computation
From MaRDI portal
Recommendations
Cited in
(49)- Progress in mathematical programming solvers from 2001 to 2020
- Improving branch-and-cut performance by random sampling
- \textsc{OptiMathSAT}: a tool for optimization modulo theories
- scientific article; zbMATH DE number 2196290 (Why is no real title available?)
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II
- Progress in Academic computational integer programming
- On learning and branching: a survey
- Optimization modulo theories with linear rational costs
- Last fifty years of integer linear programming: a focus on recent practical advances
- Estimating the Size of Branch-and-Bound Trees
- Fifty-plus years of combinatorial integer programming
- Maximizing the robustness for simple assembly lines with fixed cycle time and limited number of workstations
- A first look at picking dual variables for maximizing reduced cost fixing
- Joint optimization of transition rules and the premium scale in a bonus-malus system
- An exact algorithmic framework for a class of mixed-integer programs with equilibrium constraints
- Generation of feasible integer solutions on a massively parallel computer using the feasibility pump
- Hybrid zonotopes: A new set representation for reachability analysis of mixed logical dynamical systems
- A Classifier to Decide on the Linearization of Mixed-Integer Quadratic Problems in CPLEX
- Convex hull of two quadratic or a conic quadratic and a quadratic inequality
- Efficient presolving methods for solving maximal covering and partial set covering location problems
- A fix-and-optimize heuristic for the high school timetabling problem
- Nonnegative partial s-goodness for the equivalence of a 0-1 linear program to weighted linear programming
- Mixed integer programming: analyzing 12 years of progress
- Feasibility jump: an LP-free Lagrangian MIP heuristic
- A bit-vector differential model for the modular addition by a constant
- Heuristic approaches for biobjective mixed 0-1 integer linear programming problems
- A recombination‐based matheuristic for mixed integer programming problems with binary variables
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- scientific article; zbMATH DE number 1264409 (Why is no real title available?)
- Aggregation-based cutting-planes for packing and covering integer programs
- Mixed integer linear programming formulation techniques
- A bit-vector differential model for the modular addition by a constant and its applications to differential and impossible-differential cryptanalysis
- Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
- An integer linear programming approach to solving the Eternity puzzle
- Measures of balance in combinatorial optimization
- Aggregation and Mixed Integer Rounding to Solve MIPs
- Solving hard mixed-integer programming problems with Xpress-MP: a MIPLIB 2003 case study
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II
- A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming
- Structure-driven fix-and-propagate heuristics for mixed integer programming
- Evaluating and tuning n-fold integer programming
- Complexity of optimizing over the integers
- Rejoinder on: ``On learning and branching: a survey
- Structured learning modulo theories
- scientific article; zbMATH DE number 2084777 (Why is no real title available?)
- The split closure of a strictly convex body
- Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs
- Continuous cutting plane algorithms in integer programming
- scientific article; zbMATH DE number 4043631 (Why is no real title available?)
This page was built for publication: Mixed integer programming computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3565245)
