MIPLIB
From MaRDI portal
Software:16254
swMATH4067MaRDI QIDQ16254FDOQ16254
Author name not available (Why is that?)
Official website: http://miplib.zib.de/
Cited In (only showing first 100 items - show all)
- Faster MIP solutions via new node selection rules
- Testing cut generators for mixed-integer linear programming
- Repairing MIP infeasibility through local branching
- Computational testing of a separation procedure for the knapsack set with a single continuous variable
- On the separation of disjunctive cuts
- Boolean lexicographic optimization: algorithms \& applications
- Integer programming techniques for the nurse rostering problem
- Strengthening Gomory Mixed-Integer Cuts
- Information-theoretic approaches to branching in search
- A computational study of the cutting plane tree algorithm for general mixed-integer linear programs
- A space-indexed formulation of packing boxes into a larger box
- Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems
- Efficient intelligent backtracking using linear programming
- Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
- Counting Solutions of Integer Programs Using Unrestricted Subtree Detection
- Proximity search for 0--1 mixed-integer convex programming
- Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms
- Branch-and-Bound for Biobjective Mixed-Integer Linear Programming
- Lifting inequalities: a framework for generating strong cuts for nonlinear programs
- Solving \(0/1\) integer programs with enumeration cutting planes
- Practical performance of efficient minimum cut algorithms
- Achieving MILP feasibility quickly using general disjunctions
- Recursive central rounding for mixed integer programs
- A two-stage parallel branch and bound algorithm for mixed integer programs
- Optimizing over the first Chvátal closure
- Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
- Kernel search: a general heuristic for the multi-dimensional knapsack problem
- Exterior point simplex-type algorithms for linear and network optimization problems
- Interval uncertainty-based robust optimization for convex and non-convex quadratic programs with applications in network infrastructure planning
- Branching on general disjunctions
- Noncommercial software for mixed-integer linear programming
- DASH: dynamic approach for switching heuristics
- Modeling the parallel machine scheduling problem with step deteriorating jobs
- A computational study of conflict graphs and aggressive cut separation in integer programming
- Computing tight bounds via piecewise linear functions through the example of circle cutting problems
- A heuristic to generate rank-1 GMI cuts
- An interior point cutting plane heuristic for mixed integer programming
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Heuristic algorithms for the inverse mixed integer linear programming problem
- Reduce-and-Split cuts: improving the performance of mixed-integer Gomory cuts
- Constraint Integer Programming: A New Approach to Integrate CP and MIP
- SearchCol
- Conflict graphs in solving integer programming problems
- Reduced first-level representations via the reformulation-linearization technique: Results, counterexamples, and computations
- Surrogate-RLT cuts for zero-one integer programs
- A mixed integer programming approach for the single machine problem with unequal release dates
- Model-based automatic neighborhood design by unsupervised learning
- Fix-and-relax approaches for controlled tabular adjustment
- Zero-coefficient cuts
- Cutting to the chase. Solving linear integer arithmetic
- Reformulations in mathematical programming: automatic symmetry detection and exploitation
- RENS. The optimal rounding
- On the exact separation of mixed integer knapsack cuts
- Faster integer-feasibility in mixed-integer linear programs by branching to force change
- Mixed integer programming models for job shop scheduling: A computational analysis
- ZI round, a MIP rounding heuristic
- Active-constraint variable ordering for faster feasibility of mixed integer linear programs
- Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation
- Boosting the feasibility pump
- Application-oriented mixed integer non-linear programming
- Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation
- Cutting planes in integer and mixed integer programming
- A relax-and-cut framework for Gomory mixed-integer cuts
- MIR closures of polyhedral sets
- Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set
- Numerically safe Gomory mixed-integer cuts
- Finding multiple solutions to general integer linear programs
- An in-out approach to disjunctive optimization
- Backdoor branching
- On mathematical programming with indicator constraints
- Cutting to the chase.
- Title not available (Why is that?)
- MIP: Theory and practice -- closing the gap
- Cyclic and non-cyclic crew rostering problems in public bus transit
- An exact rational mixed-integer programming solver
- Grid-enabled optimization with GAMS
- Computing with Multi-row Gomory Cuts
- Split cuts for robust mixed-integer optimization
- On optimizing over lift-and-project closures
- Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes
- Optimizing over the split closure
- Practical strategies for generating rank-1 split cuts in mixed-integer linear programming
- Incorporating bounds from decision diagrams into integer programming
- On identifying dominant cliques.
- Approximating the stability region for binary mixed-integer programs
- Computational experience with a software framework for parallel integer programming
- Progress in Academic computational integer programming
- New Variants of Lift-and-Project Cut Generation from the LP Tableau: Open Source Implementation and Testing
- Computing with multi-row gomory cuts
- 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
- Coefficient strengthening: a tool for reformulating mixed-integer programs
- A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems
- A first look at picking dual variables for maximizing reduced cost fixing
- A computational comparison of symmetry handling methods for mixed integer programs
- A Classifier to Decide on the Linearization of Mixed-Integer Quadratic Problems in CPLEX
- Orbital shrinking: theory and applications
- How Much Communication Does Parallel Branch and Bound Need?
- A branch-and-price algorithm for capacitated hypergraph vertex separation
This page was built for software: MIPLIB