Cited in
(only showing first 100 items - show all)- From feasibility to improvement to proof: three phases of solving mixed-integer programs
- DINS, a MIP Improvement Heuristic
- polyDB: a database for polytopes and related objects
- A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation
- Incorporating bounds from decision diagrams into integer programming
- Generating Multiple Solutions for Mixed Integer Programming Problems
- A machine learning-based approximation of strong branching
- Measuring the impact of branching rules for mixed-integer programming
- Faster MIP solutions via new node selection rules
- Feasibility Pump-like heuristics for mixed integer problems
- scientific article; zbMATH DE number 1187158 (Why is no real title available?)
- PAVER 2.0: an open source environment for automated performance analysis of benchmarking data
- Testing cut generators for mixed-integer linear programming
- Pitfalls and best practices in algorithm configuration
- Computing Feasible Points of Bilevel Problems with a Penalty Alternating Direction Method
- Experiments with two-row cuts from degenerate tableaux
- Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs
- A computational study of primal heuristics inside an MI(NL)P solver
- Generalized coefficient strengthening cuts for mixed integer programming
- The double pivot simplex method
- Thinner is not always better: cascade knapsack problems
- On identifying dominant cliques.
- 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
- A primal all-integer algorithm based on irreducible solutions
- QPLIB: a library of quadratic programming instances
- The (not so) trivial lifting in two dimensions
- Approximating the stability region for binary mixed-integer programs
- Repairing MIP infeasibility through local branching
- Progress in presolving for mixed integer programming
- On the separation of disjunctive cuts
- 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
- 2DPackLib
- Improving the accuracy of linear programming solvers with iterative refinement
- Progress in Academic computational integer programming
- Computing with multi-row gomory cuts
- An algorithm-independent measure of progress for linear constraint propagation
- New Variants of Lift-and-Project Cut Generation from the LP Tableau: Open Source Implementation and Testing
- An exploratory computational analysis of dual degeneracy in mixed-integer programming
- Two-row and two-column mixed-integer presolve using hashing-based pairing methods
- Benchmarking optimization software -- a (Hi)story
- Hierarchical solution of non-convex optimal control problems with application to autonomous driving
- On learning and branching: a survey
- Branch-and-bound algorithms for the partial inverse mixed integer linear programming problem
- PICO: An object-oriented framework for parallel branch and bound
- Parallelization of the FICO Xpress-Optimizer
- Computing feasible points for binary MINLPs with MPECs
- A feasible rounding approach for mixed-integer optimization problems
- On the practical strength of two-row tableau cuts
- Boolean lexicographic optimization: algorithms \& applications
- 2DPackLib: a two-dimensional cutting and packing library
- An algorithmic framework for convex mixed integer nonlinear programs
- Inverse Mixed Integer Optimization: Polyhedral Insights and Trust Region Methods
- Optimal base encodings for pseudo-Boolean constraints
- Estimating the Size of Branch-and-Bound Trees
- Coefficient strengthening: a tool for reformulating mixed-integer programs
- A co-operative parallel heuristic for mixed zero--one linear programming: Combining simulated annealing with branch and bound
- 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
- Improving Benders decomposition using a genetic algorithm
- Integer programming techniques for the nurse rostering problem
- Core sets and symmetric convex optimization
- Algorithms to separate \(\{0,\frac{1}{2}\}\)-Chvátal-Gomory cuts
- A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems
- Further results on an abstract model for branching and its application to mixed integer programming
- Consistency cuts for Dantzig-Wolfe reformulations
- Staff assignment with lexicographically ordered acceptance levels
- On the strength of Gomory mixed-integer cuts as group cuts
- Experiments with conflict analysis in mixed integer programming
- Information-theoretic approaches to branching in search
- Feasibility pump 2.0
- Valid inequalities for mixed integer linear programs
- An IP approach to toll enforcement optimization on German motorways
- Four Good Reasons to Use an Interior Point Solver Within a MIP Solver
- On Chubanov's Method for Linear Programming
- A first look at picking dual variables for maximizing reduced cost fixing
- Cutting planes for integer programs with general integer variables
- Conflict-Driven Heuristics for Mixed Integer Programming
- Strengthening Gomory Mixed-Integer Cuts
- 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
- Rapid learning for binary programs
- Orbital shrinking: theory and applications
- The integral basis method for integer programming
- A Classifier to Decide on the Linearization of Mixed-Integer Quadratic Problems in CPLEX
- Random sampling and machine learning to understand good decompositions
- 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
- A multi-item approach to repairable stocking and expediting in a fluctuating demand environment
- Rounding and propagation heuristics for mixed integer programming
- Equivalence of lattice orbit polytopes
- Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems
- A distributed processing algorithm for solving integer programs using a cluster of workstations
- Local cuts for mixed-integer programming
This page was built for software: MIPLIB
