MIPLIB
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Cutting plane algorithms for the inverse mixed integer linear programming problem
- Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation
- Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation
- Improving Benders decomposition using a genetic algorithm
- Feasibility pump 2.0
- Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems
- ALPS
- BPMPD
- Cutting planes for integer programs with general integer variables
- FATCOP
- gmp
- IML - Integer Matrix Library
- MADAM
- Exact SCIP
- Solving \(0/1\) integer programs with enumeration cutting planes
- PAGP
- Paramils
- Fairmandering
- BASBLib
- BASBL
- HiGHS
- SeaPearl
- PaPILO
- Distributed versus centralized storage and control for parallel branch and bound: Mixed integer programming on the CM-5
- SNDlib
- VRPH
- SCIP
- SCIL
- A distributed processing algorithm for solving integer programs using a cluster of workstations
- The integral basis method for integer programming
- The long step rule in the bounded-variable dual simplex method: Numerical experiments
- A primal all-integer algorithm based on irreducible solutions
- On the facets of the mixed-integer knapsack polyhedron
- SatEx
- LaGO
- PICO
- GEMPACK
- ABACUS
- Lifted flow cover inequalities for mixed 0-1 integer programs
- Advances in design and implementation of optimization software
- UG
- polyDB: a database for polytopes and related objects
- Intersection cuts for single row corner relaxations
- SoPlex
- Zimpl
- TTPLib
- SteinLib
- CPLEX
- Gurobi
- OR-Library
- Best practices for comparing optimization algorithms
- PVM
- Theoretical challenges towards cutting-plane selection
- SelfSplit parallelization for mixed-integer linear programming
- Netlib
- HTCondor MW
- Cbc
- Solving MIPs via scaling-based augmentation
- Improvement and its computer implementation of an artificial-free simplex-type algorithm by Arsham
- Using diversification, communication and parallelism to solve mixed-integer linear programs
- GLPK
- MINTO
- COIN-OR
- Benchmarks for Optimization Software
- PBS
- An abstract model for branching and its application to mixed integer programming
- Automatic integer programming reformulation using variable neighborhood search
- SYMPHONY
- QSopt_ex
- Knapsack
- Concorde
- Adaptive kernel search: a heuristic for solving mixed integer linear programs
- FEASPUMP
- JOBSHOP
- XPRESS
- Finding all multiple stable fixpoints of \(n\)-species Lotka-Volterra competition models
- LocalSolver
- PORTA
- An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver
- Mosel
- SIP
- LINGO
- GAMS
- BonsaiG
- OPBDP
- CLP
- QSopt-Exact
- FIR toolbox
- Thinner is not always better: cascade knapsack problems
- Generation of feasible integer solutions on a massively parallel computer using the feasibility pump
- A computational comparison of symmetry handling methods for mixed integer programs
- Computing feasible points for binary MINLPs with MPECs
- Staff assignment with lexicographically ordered acceptance levels
- BPPLIB: a library for bin packing and cutting stock problems
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
- A multi-item approach to repairable stocking and expediting in a fluctuating demand environment
- A new lift-and-project operator
- A relax-and-cut framework for Gomory mixed-integer cuts
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Orbital shrinking: theory and applications
This page was built for software: MIPLIB
