Mixed Integer Programming Computation
From MaRDI portal
Publication:3565245
DOI10.1007/978-3-540-68279-0_16zbMath1187.90206OpenAlexW2187435247MaRDI QIDQ3565245
Publication date: 3 June 2010
Published in: 50 Years of Integer Programming 1958-2008 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-68279-0_16
Mixed integer programming (90C11) Biographies, obituaries, personalia, bibliographies (01A70) History of operations research and mathematical programming (90-03)
Related Items
Improving branch-and-cut performance by random sampling, Convex hull of two quadratic or a conic quadratic and a quadratic inequality, Maximizing the robustness for simple assembly lines with fixed cycle time and limited number of workstations, Heuristic approaches for biobjective mixed 0-1 integer linear programming problems, A Classifier to Decide on the Linearization of Mixed-Integer Quadratic Problems in CPLEX, Bin packing and cutting stock problems: mathematical models and exact algorithms, A fix-and-optimize heuristic for the high school timetabling problem, A bit-vector differential model for the modular addition by a constant and its applications to differential and impossible-differential cryptanalysis, Measures of balance in combinatorial optimization, Estimating the Size of Branch-and-Bound Trees, On learning and branching: a survey, Rejoinder on: ``On learning and branching: a survey, Optimization Modulo Theories with Linear Rational Costs, Continuous cutting plane algorithms in integer programming, An integer linear programming approach to solving the Eternity puzzle, Progress in mathematical programming solvers from 2001 to 2020, Complexity of optimizing over the integers, Efficient presolving methods for solving maximal covering and partial set covering location problems, Nonnegative partial \(s\)-goodness for the equivalence of a 0-1 linear program to weighted linear programming, Hybrid zonotopes: A new set representation for reachability analysis of mixed logical dynamical systems, Feasibility jump: an LP-free Lagrangian MIP heuristic, A bit-vector differential model for the modular addition by a constant, Generation of feasible integer solutions on a massively parallel computer using the feasibility pump, 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, Structured learning modulo theories, A first look at picking dual variables for maximizing reduced cost fixing, The split closure of a strictly convex body, Aggregation-based cutting-planes for packing and covering integer programs, Intersection cuts for nonlinear integer programming: convexification techniques for structured sets, Mixed Integer Linear Programming Formulation Techniques, Structure-driven fix-and-propagate heuristics for mixed integer programming, Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs, \textsc{OptiMathSAT}: a tool for optimization modulo theories, Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II, Unnamed Item, A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming
Uses Software
