MIPLIB2003

swMATH7675MaRDI QIDQ19693FDOQ19693

Author name not available (Why is that?)

Described by source

• MIPLIB 2003

Cited In (only showing first 100 items - show all)

• Faster MIP solutions via new node selection rules
• Testing cut generators for mixed-integer linear programming
• Backdoors to Combinatorial Optimization: Feasibility and Optimality
• A computational study of primal heuristics inside an MI(NL)P solver
• Generalized coefficient strengthening cuts for mixed integer programming
• The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs
• Improving branch-and-cut performance by random sampling
• Repairing MIP infeasibility through local branching
• Computational testing of a separation procedure for the knapsack set with a single continuous variable
• Two-step MIR inequalities for mixed integer programs
• Progress in presolving for mixed integer programming
• Using the analytic center in the feasibility pump
• Parallelization of the FICO Xpress-Optimizer
• Boolean lexicographic optimization: algorithms \& applications
• An Exact Rational Mixed-Integer Programming Solver
• How to select a small set of diverse solutions to mixed integer programming problems
• An In-Out Approach to Disjunctive Optimization
• Algorithms to separate \(\{0,\frac{1}{2}\}\)-Chvátal-Gomory cuts
• On the strength of Gomory mixed-integer cuts as group cuts
• Feasibility pump 2.0
• Cutting to the Chase Solving Linear Integer Arithmetic
• Integer-programming software systems
• Generation of feasible integer solutions on a massively parallel computer using the feasibility pump
• A computational study of the cutting plane tree algorithm for general mixed-integer linear programs
• Could we use a million cores to solve an integer program?
• Lexicography and degeneracy: Can a pure cutting plane algorithm work?
• Branching rules revisited
• On the enumerative nature of Gomory's dual cutting plane method
• Recursive central rounding for mixed integer programs
• The Ubiquity Generator Framework: 7 Years of Progress in Parallelizing Branch-and-Bound
• Optimizing over the first Chvátal closure
• Title not available (Why is that?)
• Branching on general disjunctions
• A heuristic to generate rank-1 GMI cuts
• An interior point cutting plane heuristic for mixed integer programming
• Heuristic algorithms for the inverse mixed integer linear programming problem
• How tight is the corner relaxation?
• Constraint Integer Programming: A New Approach to Integrate CP and MIP
• FiberSCIP—A Shared Memory Parallelization of SCIP
• An empirical evaluation of walk-and-round heuristics for mixed integer linear programs
• A feasibility pump heuristic for general mixed-integer problems
• Conflict analysis in mixed integer programming
• Improving the feasibility pump
• Reformulations in mathematical programming: automatic symmetry detection and exploitation
• The feasibility pump
• Separation algorithms for 0-1 knapsack polytopes
• RENS. The optimal rounding
• How much do we ``pay for using default parameters?
• On the exact separation of mixed integer knapsack cuts
• Faster integer-feasibility in mixed-integer linear programs by branching to force change
• A new class of functions for measuring solution integrality in the feasibility pump approach
• ZI round, a MIP rounding heuristic
• Active-constraint variable ordering for faster feasibility of mixed integer linear programs
• SCIP: solving constraint integer programs
• Pruning moves
• Solving hard mixed-integer programming problems with Xpress-MP: a MIPLIB 2003 case study
• Stabilizer-based symmetry breaking constraints for mathematical programs
• Automatic Generation of Symmetry-Breaking Constraints
• Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation
• Boosting the feasibility pump
• Cutting plane algorithms for the inverse mixed integer linear programming problem
• A relax-and-cut framework for Gomory mixed-integer cuts
• Information-based branching schemes for binary linear mixed integer problems
• A Relax-and-Cut Framework for Gomory’s Mixed-Integer Cuts
• Feasibility and infeasibility in optimization. Algorithms and computational methods.
• Cutting to the chase.
• Facet Generating Techniques
• Grid-enabled optimization with GAMS
• Split cuts for robust mixed-integer optimization
• On optimizing over lift-and-project closures
• An algorithm for the separation of two-row cuts
• MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
• Practical strategies for generating rank-1 split cuts in mixed-integer linear programming
• A New Approach to the Feasibility Pump in Mixed Integer Programming
• Shift-and-propagate
• Feasibility Pump-like heuristics for mixed integer problems
• Primal Heuristics for Branch-and-Price Algorithms
• A Simplex-Based Extension of Fourier-Motzkin for Solving Linear Integer Arithmetic
• Computational experience with a software framework for parallel integer programming
• Branching on Multi-aggregated Variables
• Improving Strong Branching by Propagation
• An exploratory computational analysis of dual degeneracy in mixed-integer programming
• Computing with multi-row gomory cuts
• Cloud Branching
• Ap-cone sequential relaxation procedure for 0-1 integer programs
• On learning and branching: a survey
• Branch-and-bound algorithms for the partial inverse mixed integer linear programming problem
• A feasible rounding approach for mixed-integer optimization problems
• Estimating the Size of Branch-and-Bound Trees
• A computational study of parametric tabu search for 0-1 mixed integer programs
• Experiments with conflict analysis in mixed integer programming
• Conflict-Driven Heuristics for Mixed Integer Programming
• A computational comparison of symmetry handling methods for mixed integer programs
• Enhancing MIP Branching Decisions by Using the Sample Variance of Pseudo Costs
• Random sampling and machine learning to understand good decompositions
• Local cuts for mixed-integer programming
• Polytopes associated with symmetry handling
• Structure Detection in Mixed-Integer Programs
• Adaptive large neighborhood search for mixed integer programming
• The strength of multi-row models

This page was built for software: MIPLIB2003