MIPLIB 2003
From MaRDI portal
Publication:2466583
DOI10.1016/j.orl.2005.07.009zbMath1133.90300OpenAlexW2914109978MaRDI QIDQ2466583
Thorsten Koch, Alexander Martin, Tobias Achterberg
Publication date: 15 January 2008
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2005.07.009
Mixed integer programming (90C11) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Related Items
MIPping closures: An instant survey, Adaptive large neighborhood search for mixed integer programming, Separation algorithms for 0-1 knapsack polytopes, Estimating the Size of Branch-and-Bound Trees, Partial hyperplane activation for generalized intersection cuts, On learning and branching: a survey, Practical strategies for generating rank-1 split cuts in mixed-integer linear programming, Decomposition Branching for Mixed Integer Programming, Polytopes associated with symmetry handling, An abstract model for branching and its application to mixed integer programming, A feasible rounding approach for mixed-integer optimization problems, Automatic integer programming reformulation using variable neighborhood search, Could we use a million cores to solve an integer program?, The Chebyshev center as an alternative to the analytic center in the feasibility pump, Monoidal strengthening of simple \(\mathcal{V} \)-polyhedral disjunctive cuts, A heuristic to generate rank-1 GMI cuts, Computing with Multi-row Gomory Cuts, A data driven Dantzig-Wolfe decomposition framework, Cut generation through binarization, How much do we ``pay for using default parameters?, Split cuts from sparse disjunctions, Boolean lexicographic optimization: algorithms \& applications, Progress in presolving for mixed integer programming, Branch-and-bound algorithms for the partial inverse mixed integer linear programming problem, Faster integer-feasibility in mixed-integer linear programs by branching to force change, A computational study of the cutting plane tree algorithm for general mixed-integer linear programs, An algorithm for the separation of two-row cuts, Split cuts for robust mixed-integer optimization, FiberSCIP—A Shared Memory Parallelization of SCIP, Heuristic algorithms for the inverse mixed integer linear programming problem, An exploratory computational analysis of dual degeneracy in mixed-integer programming, Feasibility Pump-like heuristics for mixed integer problems, Structure Detection in Mixed-Integer Programs, Constraint Integer Programming: A New Approach to Integrate CP and MIP, Generation of feasible integer solutions on a massively parallel computer using the feasibility pump, Heuristics of the Branch-Cut-and-Price-Framework SCIP, From feasibility to improvement to proof: three phases of solving mixed-integer programs, A computational comparison of symmetry handling methods for mixed integer programs, Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation, Conflict analysis in mixed integer programming, Improving the feasibility pump, A computational study of primal heuristics inside an MI(NL)P solver, Generalized coefficient strengthening cuts for mixed integer programming, Shift-and-propagate, Computing with multi-row gomory cuts, Primal Heuristics for Branch-and-Price Algorithms, Experiments with conflict analysis in mixed integer programming, ZI round, a MIP rounding heuristic, Information-based branching schemes for binary linear mixed integer problems, The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs, Pivot-and-reduce cuts: an approach for improving Gomory mixed-integer cuts, Exploring the Numerics of Branch-and-Cut for Mixed Integer Linear Optimization, Cutting to the Chase Solving Linear Integer Arithmetic, Improving strong branching by domain propagation, Random sampling and machine learning to understand good decompositions, SCIP: solving constraint integer programs, Testing cut generators for mixed-integer linear programming, Automatic Dantzig-Wolfe reformulation of mixed integer programs, The strength of multi-row models, Structure-driven fix-and-propagate heuristics for mixed integer programming, On the safety of Gomory cut generators, Computational Testing of a Separation Procedure for the Knapsack Set with a Single Continuous Variable, Cutting plane algorithms for the inverse mixed integer linear programming problem, When Lift-and-Project Cuts Are Different, MIPLIB, MIPLIB2003, MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library, Conflict-Driven Heuristics for Mixed Integer Programming, The feasibility pump, Cutting to the chase., A Computational Investigation on the Strength of Dantzig-Wolfe Reformulations
Uses Software
Cites Work
