MIPLIB2003
From MaRDI portal
Software:19693
No author found.
Related Items (only showing first 100 items - show all)
Improving branch-and-cut performance by random sampling ⋮ How to select a small set of diverse solutions to mixed integer programming problems ⋮ Algorithms to separate \(\{0,\frac{1}{2}\}\)-Chvátal-Gomory cuts ⋮ Branching rules revisited ⋮ Pruning Moves ⋮ Two-Step MIR Inequalities for Mixed Integer Programs ⋮ Predicting the Solution Time of Branch-and-Bound Algorithms for Mixed-Integer Programs ⋮ Lifted Tableaux Inequalities for 0–1 Mixed-Integer Programs: A Computational Study ⋮ MIPping closures: An instant survey ⋮ Solving Hard Mixed-Integer Programming Problems with Xpress-MP: A MIPLIB 2003 Case Study ⋮ Grid-Enabled Optimization with GAMS ⋮ Computational Experience with a Software Framework for Parallel Integer Programming ⋮ A Simplex-Based Extension of Fourier-Motzkin for Solving Linear Integer Arithmetic ⋮ Adaptive large neighborhood search for mixed integer programming ⋮ Separation algorithms for 0-1 knapsack polytopes ⋮ Recursive central rounding for mixed integer programs ⋮ On optimizing over lift-and-project closures ⋮ Local cuts for mixed-integer programming ⋮ An empirical evaluation of walk-and-round heuristics for mixed integer linear programs ⋮ Optimizing over the first Chvátal closure ⋮ Partial hyperplane activation for generalized intersection cuts ⋮ On learning and branching: a survey ⋮ On the enumerative nature of Gomory's dual cutting plane method ⋮ Practical strategies for generating rank-1 split cuts in mixed-integer linear 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? ⋮ A heuristic to generate rank-1 GMI cuts ⋮ Using the analytic center in the feasibility pump ⋮ 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 ⋮ An interior point cutting plane heuristic for mixed integer programming ⋮ A computational study of the cutting plane tree algorithm for general mixed-integer linear programs ⋮ Facet Generating Techniques ⋮ An algorithm for the separation of two-row cuts ⋮ Split cuts for robust mixed-integer optimization ⋮ Lexicography and degeneracy: Can a pure cutting plane algorithm work? ⋮ 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 ⋮ Generation of feasible integer solutions on a massively parallel computer using the feasibility pump ⋮ Reformulations in mathematical programming: automatic symmetry detection and exploitation ⋮ Stabilizer-based symmetry breaking constraints for mathematical programs ⋮ Repairing MIP infeasibility through local branching ⋮ Boosting the feasibility pump ⋮ A computational comparison of symmetry handling methods for mixed integer programs ⋮ Unnamed Item ⋮ Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation ⋮ An Exact Rational Mixed-Integer Programming Solver ⋮ On the strength of Gomory mixed-integer cuts as group cuts ⋮ How tight is the corner relaxation? ⋮ Conflict analysis in mixed integer programming ⋮ A feasibility pump heuristic for general mixed-integer problems ⋮ Improving the feasibility pump ⋮ A computational study of primal heuristics inside an MI(NL)P solver ⋮ Generalized coefficient strengthening cuts for mixed integer programming ⋮ Feasibility and infeasibility in optimization. Algorithms and computational methods. ⋮ Shift-and-propagate ⋮ A relax-and-cut framework for Gomory mixed-integer cuts ⋮ Computing with multi-row gomory cuts ⋮ On the exact separation of mixed integer knapsack cuts ⋮ Branching on general disjunctions ⋮ 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 ⋮ A computational study of parametric tabu search for 0-1 mixed integer programs ⋮ Faster MIP solutions via new node selection rules ⋮ Active-constraint variable ordering for faster feasibility of mixed integer linear programs ⋮ Pivot-and-reduce cuts: an approach for improving Gomory mixed-integer cuts ⋮ 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 ⋮ A hybrid branch-and-bound approach for exact rational mixed-integer programming ⋮ RENS. The optimal rounding ⋮ 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 ⋮ A First Implementation of ParaXpress: Combining Internal and External Parallelization to Solve MIPs on Supercomputers ⋮ MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library ⋮ Ap-cone sequential relaxation procedure for 0-1 integer programs ⋮ Feasibility pump 2.0 ⋮ The feasibility pump ⋮ A New Class of Functions for Measuring Solution Integrality in the Feasibility Pump Approach ⋮ The Second Chvatal Closure Can Yield Better Railway Timetables ⋮ Cutting to the chase. ⋮ Integer-programming software systems ⋮ Estimating the Size of Branch-and-Bound Trees
This page was built for software: MIPLIB2003
