The following pages link to MIPLIB (Q16254):
Displaying 50 items.
- Gomory cuts revisited (Q2564234) (← links)
- The feasibility pump (Q2571001) (← links)
- Separation algorithms for 0-1 knapsack polytopes (Q2638369) (← links)
- Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms (Q2642636) (← links)
- Sampling from the complement of a polyhedron: an MCMC algorithm for data augmentation (Q2661558) (← links)
- Inverse integer optimization with an imperfect observation (Q2661562) (← links)
- Logic-based benders decomposition with a partial assignment acceleration technique for avionics scheduling (Q2676319) (← links)
- Achieving consistency with cutting planes (Q2687054) (← links)
- Fractional decomposition tree algorithm: a tool for studying the integrality gap of integer programs (Q2688462) (← links)
- Random projections of linear and semidefinite problems with linear inequalities (Q2689146) (← links)
- MIP: Theory and practice -- closing the gap (Q2712822) (← links)
- PICO: An object-oriented framework for parallel branch and bound (Q2768018) (← links)
- Exact and fast algorithms for mixed-integer nonlinear programming (Q2802655) (← links)
- Detecting Semantic Groups in MIP Models (Q2815122) (← links)
- Computational testing of a separation procedure for the knapsack set with a single continuous variable (Q2815436) (← links)
- Parallelization of the FICO Xpress-Optimizer (Q2819224) (← links)
- Efficient intelligent backtracking using linear programming (Q2884543) (← links)
- Generating cutting planes for mixed integer programming problems in a parallel computing environment (Q2890402) (← links)
- A column-generation approach to the multiple knapsack problem with color constraints (Q2892278) (← links)
- (Q2897314) (← links)
- Numerically safe Gomory mixed-integer cuts (Q2899029) (← links)
- Pruning moves (Q2899042) (← links)
- Two-step MIR inequalities for mixed integer programs (Q2899057) (← links)
- Predicting the solution time of branch-and-bound algorithms for mixed-integer programs (Q2899130) (← links)
- Lifted tableaux inequalities for \(0\)-\(1\) mixed-integer programs: a computational study (Q2899134) (← links)
- Experiments with two-row cuts from degenerate tableaux (Q2899149) (← links)
- Solving hard mixed-integer programming problems with Xpress-MP: a MIPLIB 2003 case study (Q2901067) (← links)
- Grid-enabled optimization with GAMS (Q2901071) (← links)
- Computational experience with a software framework for parallel integer programming (Q2901073) (← links)
- Reconsidering Mixed Integer Programming and MIP-Based Hybrids for Scheduling (Q2902928) (← links)
- The second Chvátal closure can yield better railway timetables (Q2917362) (← links)
- Using Zimpl for Modeling Production Planning Problems (Q2917388) (← links)
- Mixed integer rounding cuts and master group polyhedra (Q2928706) (← links)
- Computational Experiments with Cross and Crooked Cross Cuts (Q2940067) (← links)
- On the Practical Strength of Two-Row Tableau Cuts (Q2962551) (← links)
- On Chubanov's Method for Linear Programming (Q2962562) (← links)
- Facet Generating Techniques (Q2971603) (← links)
- Optimal Base Encodings for Pseudo-Boolean Constraints (Q3000648) (← links)
- Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation (Q3009749) (← links)
- An Exact Rational Mixed-Integer Programming Solver (Q3009754) (← links)
- Backdoor Branching (Q3009762) (← links)
- Reduce-and-Split Cuts: Improving the Performance of Mixed-Integer Gomory Cuts (Q3115940) (← links)
- (Q3372341) (← links)
- A server for automated performance analysis of benchmarking data (Q3377976) (← links)
- When Lift-and-Project Cuts Are Different (Q3386803) (← links)
- (Q3429161) (← links)
- Computing with Multi-row Gomory Cuts (Q3503849) (← links)
- Can Pure Cutting Plane Algorithms Work? (Q3503863) (← links)
- Mixed Integer Programming Computation (Q3565245) (← links)
- The Group-Theoretic Approach in Mixed Integer Programming (Q3565248) (← links)
