MIPLIB2003
From MaRDI portal
Cited in
(only showing first 100 items - show all)- From feasibility to improvement to proof: three phases of solving mixed-integer programs
- A machine learning-based approximation of strong branching
- A New Approach to the Feasibility Pump in Mixed Integer Programming
- Faster MIP solutions via new node selection rules
- Feasibility Pump-like heuristics for mixed integer problems
- Testing cut generators for mixed-integer linear programming
- Primal Heuristics for Branch-and-Price Algorithms
- 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
- Backdoors to Combinatorial Optimization: Feasibility and Optimality
- Repairing MIP infeasibility through local branching
- Progress in presolving for mixed integer programming
- Exploring the numerics of branch-and-cut for mixed integer linear optimization
- Computational testing of a separation procedure for the knapsack set with a single continuous variable
- Two-step MIR inequalities for mixed integer programs
- Computational experience with a software framework for parallel integer programming
- Using the analytic center in the feasibility pump
- Computing with multi-row gomory cuts
- An exploratory computational analysis of dual degeneracy in mixed-integer programming
- On learning and branching: a survey
- Branch-and-bound algorithms for the partial inverse mixed integer linear programming problem
- Ap-cone sequential relaxation procedure for 0-1 integer programs
- Finding feasible solutions to hard mixed-integer programming problems using hybrid heuristics
- Parallelization of the FICO Xpress-Optimizer
- A feasible rounding approach for mixed-integer optimization problems
- Boolean lexicographic optimization: algorithms \& applications
- Estimating the Size of Branch-and-Bound Trees
- A computational study of parametric tabu search for 0-1 mixed integer programs
- 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
- On the strength of Gomory mixed-integer cuts as group cuts
- Experiments with conflict analysis in mixed integer programming
- Feasibility pump 2.0
- Conflict-Driven Heuristics for Mixed Integer Programming
- Integer-programming software systems
- 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
- Random sampling and machine learning to understand good decompositions
- A computational study of the cutting plane tree algorithm for general mixed-integer linear programs
- Local cuts for mixed-integer programming
- Could we use a million cores to solve an integer program?
- A first implementation of ParaXpress: combining internal and external parallelization to solve MIPs on supercomputers
- Lexicography and degeneracy: Can a pure cutting plane algorithm work?
- Branching on multi-aggregated variables
- Polytopes associated with symmetry handling
- Partial convexification of general mips by Dantzig-Wolfe reformulation
- A relax-and-cut framework for Gomory's mixed-integer cuts
- Branching rules revisited
- On the enumerative nature of Gomory's dual cutting plane method
- Recursive central rounding for mixed integer programs
- Optimizing over the first Chvátal closure
- Adaptive large neighborhood search for mixed integer programming
- Structure Detection in Mixed-Integer Programs
- The strength of multi-row models
- FATCOP
- PAGP
- SNDlib
- SCIP
- SCIL
- PICO
- GEMPACK
- CPLEX
- MIPLIB
- UG
- SoPlex
- Zimpl
- Cbc
- Benchmarks for Optimization Software
- COIN-OR
- Concorde
- FEASPUMP
- QSopt_ex
- BonsaiG
- CLP
- QSopt-Exact
- XPRESS
- mkc7
- DipPy
- BiCePS
- BLIS
- FiberSCIP
- ParaSCIP
- Valse-XT
- CHiPPS
- Branching on general disjunctions
- OPIUM
- Cgllandp
- FortMP
- MOPS
- BaPCod
- DIP
- PermLib
- DINS
- GCG
- CORAL
- hMETIS
- Cgl
- COIN/BCP
This page was built for software: MIPLIB2003
