MIPLIB

swMATH4067MaRDI QIDQ16254FDOQ16254

Author name not available (Why is that?)

Described by source

• MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
• MIPLIB 2003

Cited In (only showing first 100 items - show all)

• Computing Feasible Points of Bilevel Problems with a Penalty Alternating Direction Method
• Exploring the numerics of branch-and-cut for mixed integer linear optimization
• Improving the accuracy of linear programming solvers with iterative refinement
• An algorithm-independent measure of progress for linear constraint propagation
• 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
• Estimating the Size of Branch-and-Bound Trees
• Optimal base encodings for pseudo-Boolean constraints
• 2DPackLib: a two-dimensional cutting and packing library
• Further results on an abstract model for branching and its application to mixed integer programming
• Four Good Reasons to Use an Interior Point Solver Within a MIP Solver
• Experiments with conflict analysis in mixed integer programming
• Conflict-Driven Heuristics for Mixed Integer Programming
• Random sampling and machine learning to understand good decompositions
• Local cuts for mixed-integer programming
• Comparison of the number of nodes explored by cyclic best first search with depth contour and best first search
• Preprocessing and cutting planes with conflict graphs
• An enhanced branch-and-bound algorithm for bilevel integer linear programming
• Tailoring parallel alternating criteria search for domain specific MIPs: application to maritime inventory routing
• A robust optimization approach with probe-able uncertainty
• Structure Detection in Mixed-Integer Programs
• Adaptive large neighborhood search for mixed integer programming
• MIPping closures: An instant survey
• Cloud branching
• The confined primal integral: a measure to benchmark heuristic MINLP solvers against global MINLP solvers
• Enhancing MIP branching decisions by using the sample variance of pseudo costs
• Radius of Robust Feasibility for Mixed-Integer Problems
• Generating hard instances for robust combinatorial optimization
• Pivot-and-reduce cuts: an approach for improving Gomory mixed-integer cuts
• The second Chvátal closure can yield better railway timetables
• MathOptInterface: A Data Structure for Mathematical Optimization Problems
• Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem
• Inverse integer optimization with an imperfect observation
• Split cuts from sparse disjunctions
• ParaXpress: an experimental extension of the FICO Xpress-Optimizer to solve hard MIPs on supercomputers
• Partial hyperplane activation for generalized intersection cuts
• Improving the performance of MIP and MINLP solvers by integrated heuristics
• Improving the randomization step in feasibility pump
• Generation techniques for linear programming instances with controllable properties
• Evaluating and tuning \(n\)-fold integer programming
• Structure-driven fix-and-propagate heuristics for mixed integer programming
• Learn to relax: integrating \(0-1\) integer linear programming with pseudo-Boolean conflict-driven search
• A Computational Investigation on the Strength of Dantzig-Wolfe Reformulations
• Using two-dimensional projections for stronger separation and propagation of bilinear terms
• Solving Large Batches of Linear Programs
• Packing, partitioning, and covering symresacks
• Logic-based Benders decomposition with a partial assignment acceleration technique for avionics scheduling
• Worst-case analysis of clique MIPs
• Pitfalls and best practices in algorithm configuration
• PAVER 2.0: an open source environment for automated performance analysis of benchmarking data
• QPLIB: a library of quadratic programming instances
• The (not so) trivial lifting in two dimensions
• Improving branch-and-cut performance by random sampling
• Computational testing of a separation procedure for the knapsack set with a single continuous variable
• Using the analytic center in the feasibility pump
• PICO: An object-oriented framework for parallel branch and bound
• Parallelization of the FICO Xpress-Optimizer
• An algorithmic framework for convex mixed integer nonlinear programs
• Improving Benders decomposition using a genetic algorithm
• How to select a small set of diverse solutions to mixed integer programming problems
• Integer programming techniques for the nurse rostering problem
• Feasibility pump 2.0
• Valid inequalities for mixed integer linear programs
• Integer-programming software systems
• A distributed processing algorithm for solving integer programs using a cluster of workstations
• On the facets of the mixed-integer knapsack polyhedron
• Octane: A New Heuristic for Pure 0–1 Programs
• Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
• Counting Solutions of Integer Programs Using Unrestricted Subtree Detection
• Using diversification, communication and parallelism to solve mixed-integer linear programs
• Proximity search for 0--1 mixed-integer convex programming
• Mixed integer programming computation
• The group-theoretic approach in mixed integer programming
• Partial convexification of general mips by Dantzig-Wolfe reformulation
• Branch-and-Bound for Biobjective Mixed-Integer Linear Programming
• Branching rules revisited
• SDPLIB 1.2, a library of semidefinite programming test problems
• Lifting inequalities: a framework for generating strong cuts for nonlinear programs
• Computing convex hulls and counting integer points with \texttt{polymake}
• Solving \(0/1\) integer programs with enumeration cutting planes
• Achieving MILP feasibility quickly using general disjunctions
• Recursive central rounding for mixed integer programs
• Optimizing over the first Chvátal closure
• 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

This page was built for software: MIPLIB