The following pages link to MIPLIB (Q16254):
Displaying 50 items.
- SelfSplit parallelization for mixed-integer linear programming (Q1652584) (← links)
- Solving MIPs via scaling-based augmentation (Q1662107) (← links)
- Improvement and its computer implementation of an artificial-free simplex-type algorithm by Arsham (Q1663601) (← links)
- Using diversification, communication and parallelism to solve mixed-integer linear programs (Q1667215) (← links)
- An abstract model for branching and its application to mixed integer programming (Q1683695) (← links)
- Automatic integer programming reformulation using variable neighborhood search (Q1687624) (← links)
- Adaptive kernel search: a heuristic for solving mixed integer linear programs (Q1694819) (← links)
- Finding all multiple stable fixpoints of \(n\)-species Lotka-Volterra competition models (Q1700550) (← links)
- An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver (Q1704912) (← links)
- Thinner is not always better: cascade knapsack problems (Q1727953) (← links)
- Generation of feasible integer solutions on a massively parallel computer using the feasibility pump (Q1728378) (← links)
- A computational comparison of symmetry handling methods for mixed integer programs (Q1741126) (← links)
- Computing feasible points for binary MINLPs with MPECs (Q1741127) (← links)
- Staff assignment with lexicographically ordered acceptance levels (Q1743648) (← links)
- BPPLIB: a library for bin packing and cutting stock problems (Q1746064) (← links)
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) (← links)
- A multi-item approach to repairable stocking and expediting in a fluctuating demand environment (Q1752175) (← links)
- A new lift-and-project operator (Q1752818) (← links)
- A relax-and-cut framework for Gomory mixed-integer cuts (Q1762453) (← links)
- Exploring relaxation induced neighborhoods to improve MIP solutions (Q1769074) (← links)
- Orbital shrinking: theory and applications (Q1786877) (← links)
- Polyhedral approximation of ellipsoidal uncertainty sets via extended formulations: a computational case study (Q1789594) (← links)
- HMS: a hybrid multi-start algorithm for solving binary linear programs (Q1791895) (← links)
- Optimal decision trees for feature based parameter tuning: integer programming model and VNS heuristic (Q1791966) (← links)
- On the use of intersection cuts for bilevel optimization (Q1800991) (← links)
- Computational experience with parallel mixed integer programming in a distributed environment (Q1808186) (← links)
- On identifying dominant cliques. (Q1811147) (← links)
- Branching rules revisited (Q1886796) (← links)
- A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems (Q1922639) (← links)
- Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set (Q1926486) (← links)
- Could we use a million cores to solve an integer program? (Q1935943) (← links)
- Branch-and-bound algorithms for the partial inverse mixed integer linear programming problem (Q1945502) (← links)
- \(bc\)-\(opt\): A branch-and-cut code for mixed integer programs (Q1961983) (← links)
- Conflict graphs in solving integer programming problems (Q1969889) (← links)
- Practical performance of efficient minimum cut algorithms (Q1969951) (← links)
- Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes (Q1972019) (← links)
- Reduced first-level representations via the reformulation-linearization technique: Results, counterexamples, and computations (Q1975377) (← links)
- Learning when to use a decomposition (Q2011591) (← links)
- Experiments with conflict analysis in mixed integer programming (Q2011593) (← links)
- A first look at picking dual variables for maximizing reduced cost fixing (Q2011594) (← links)
- Comparison of the number of nodes explored by cyclic best first search with depth contour and best first search (Q2026990) (← links)
- Preprocessing and cutting planes with conflict graphs (Q2027062) (← links)
- An enhanced branch-and-bound algorithm for bilevel integer linear programming (Q2030724) (← links)
- The confined primal integral: a measure to benchmark heuristic MINLP solvers against global MINLP solvers (Q2044966) (← links)
- Learn to relax: integrating \(0-1\) integer linear programming with pseudo-Boolean conflict-driven search (Q2074664) (← links)
- Worst-case analysis of clique MIPs (Q2089781) (← links)
- An exact projection-based algorithm for bilevel mixed-integer problems with nonlinearities (Q2089867) (← links)
- Political districting to minimize cut edges (Q2099493) (← links)
- An algorithm-independent measure of progress for linear constraint propagation (Q2112621) (← links)
- 2DPackLib: a two-dimensional cutting and packing library (Q2115308) (← links)
