swMATH7675MaRDI QIDQ19693FDOQ19693
Author name not available (Why is that?)
Official website: http://miplib.zib.de/miplib2003/
Cited In (only showing first 100 items - show all)
- Feasibility Pump-like heuristics for mixed integer problems
- 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
- Two-step MIR inequalities for mixed integer programs
- Computational experience with a software framework for parallel integer programming
- Progress in presolving for mixed integer programming
- Computing with multi-row gomory cuts
- 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
- Boolean lexicographic optimization: algorithms \& applications
- A computational study of parametric tabu search for 0-1 mixed integer programs
- Algorithms to separate \(\{0,\frac{1}{2}\}\)-Chvátal-Gomory cuts
- On the strength of Gomory mixed-integer cuts as group cuts
- A computational comparison of symmetry handling methods for mixed integer programs
- 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?
- Polytopes associated with symmetry handling
- A relax-and-cut framework for Gomory's mixed-integer cuts
- On the enumerative nature of Gomory's dual cutting plane method
- The strength of multi-row models
- A hybrid branch-and-bound approach for exact rational mixed-integer programming
- On the safety of Gomory cut generators
- How tight is the corner relaxation?
- Cut generation through binarization
- Facet generating techniques
- Lifted tableaux inequalities for \(0\)-\(1\) mixed-integer programs: a computational study
- How much do we ``pay for using default parameters?
- ZI round, a MIP rounding heuristic
- Decomposition Branching for Mixed Integer Programming
- 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
- Boosting the feasibility pump
- Automatic Dantzig-Wolfe reformulation of mixed integer programs
- An abstract model for branching and its application to mixed integer programming
- Cutting plane algorithms for the inverse mixed integer linear programming problem
- Automatic integer programming reformulation using variable neighborhood search
- Predicting the solution time of branch-and-bound algorithms for mixed-integer programs
- Information-based branching schemes for binary linear mixed integer problems
- A simplex-based extension of Fourier-Motzkin for solving linear integer arithmetic
- Split cuts for robust mixed-integer optimization
- An algorithm for the separation of two-row cuts
- Practical strategies for generating rank-1 split cuts in mixed-integer linear programming
- Computational experience with hypergraph-based methods for automatic decomposition in discrete optimization
- A machine learning-based approximation of strong branching
- Shift-and-propagate
- Primal Heuristics for Branch-and-Price Algorithms
- Exploring the numerics of branch-and-cut for mixed integer linear optimization
- An exploratory computational analysis of dual degeneracy in mixed-integer programming
- Finding feasible solutions to hard mixed-integer programming problems using hybrid heuristics
- Estimating the Size of Branch-and-Bound Trees
- Experiments with conflict analysis in mixed integer programming
- Conflict-Driven Heuristics for Mixed Integer Programming
- Random sampling and machine learning to understand good decompositions
- Local cuts for mixed-integer programming
- A first implementation of ParaXpress: combining internal and external parallelization to solve MIPs on supercomputers
- Branching on multi-aggregated variables
- Structure Detection in Mixed-Integer Programs
- Adaptive large neighborhood search for mixed integer programming
- MIPping closures: An instant survey
- Improving strong branching by propagation
- Cloud branching
- Enhancing MIP branching decisions by using the sample variance of pseudo costs
- Pivot-and-reduce cuts: an approach for improving Gomory mixed-integer cuts
- The second Chvátal closure can yield better railway timetables
- Split cuts from sparse disjunctions
- ParaXpress: an experimental extension of the FICO Xpress-Optimizer to solve hard MIPs on supercomputers
- Partial hyperplane activation for generalized intersection cuts
- Improving strong branching by domain propagation
- When Lift-and-Project Cuts Are Different
- Structure-driven fix-and-propagate heuristics for mixed integer programming
- A Computational Investigation on the Strength of Dantzig-Wolfe Reformulations
- Title not available (Why is that?)
- From feasibility to improvement to proof: three phases of solving mixed-integer programs
- Faster MIP solutions via new node selection rules
- 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
- Using the analytic center in the feasibility pump
- Parallelization of the FICO Xpress-Optimizer
- How to select a small set of diverse solutions to mixed integer programming problems
- Feasibility pump 2.0
- Integer-programming software systems
- Partial convexification of general mips by Dantzig-Wolfe reformulation
- Branching rules revisited
- Recursive central rounding for mixed integer programs
- 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
This page was built for software: MIPLIB2003
