MIPLIB
From MaRDI portal
Software:16254
No author found.
Related Items (only showing first 100 items - show all)
Branching rules revisited ⋮ MIPping closures: An instant survey ⋮ On handling indicator constraints in mixed integer programming ⋮ Adaptive large neighborhood search for mixed integer programming ⋮ Finding multiple solutions to general integer linear programs ⋮ SelfSplit parallelization for mixed-integer linear programming ⋮ On optimizing over lift-and-project closures ⋮ Local cuts for mixed-integer programming ⋮ Computing convex hulls and counting integer points with \texttt{polymake} ⋮ Solving MIPs via scaling-based augmentation ⋮ Improvement and its computer implementation of an artificial-free simplex-type algorithm by Arsham ⋮ Verifying integer programming results ⋮ Using diversification, communication and parallelism to solve mixed-integer linear programs ⋮ A branch-and-price algorithm for capacitated hypergraph vertex separation ⋮ Partial hyperplane activation for generalized intersection cuts ⋮ On learning and branching: a survey ⋮ A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems ⋮ Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set ⋮ Polytopes associated with symmetry handling ⋮ An abstract model for branching and its application to mixed integer programming ⋮ A feasible rounding approach for mixed-integer optimization problems ⋮ Automatic integer programming reformulation using variable neighborhood search ⋮ Could we use a million cores to solve an integer program? ⋮ Packing, partitioning, and covering symresacks ⋮ Adaptive kernel search: a heuristic for solving mixed integer linear programs ⋮ Split cuts from sparse disjunctions ⋮ Branch-and-bound algorithms for the partial inverse mixed integer linear programming problem ⋮ Finding all multiple stable fixpoints of \(n\)-species Lotka-Volterra competition models ⋮ An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver ⋮ An algorithm for the separation of two-row cuts ⋮ \(bc\)-\(opt\): A branch-and-cut code for mixed integer programs ⋮ Two-row and two-column mixed-integer presolve using hashing-based pairing methods ⋮ An exploratory computational analysis of dual degeneracy in mixed-integer programming ⋮ Feasibility Pump-like heuristics for mixed integer problems ⋮ Generation techniques for linear programming instances with controllable properties ⋮ A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation ⋮ Exploiting symmetry in integer convex optimization using core points ⋮ Measuring the impact of primal heuristics ⋮ Conflict graphs in solving integer programming problems ⋮ Practical performance of efficient minimum cut algorithms ⋮ Thinner is not always better: cascade knapsack problems ⋮ Generation of feasible integer solutions on a massively parallel computer using the feasibility pump ⋮ Benchmarking optimization software -- a (Hi)story ⋮ Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes ⋮ Reduced first-level representations via the reformulation-linearization technique: Results, counterexamples, and computations ⋮ Repairing MIP infeasibility through local branching ⋮ Further results on an abstract model for branching and its application to mixed integer programming ⋮ 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 ⋮ Global sensitivity analysis via a statistical tolerance approach ⋮ A robust optimization approach with probe-able uncertainty ⋮ BPPLIB: a library for bin packing and cutting stock problems ⋮ Conflict analysis in mixed integer programming ⋮ A feasibility pump heuristic for general mixed-integer problems ⋮ Improving the feasibility pump ⋮ 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 ⋮ PAVER 2.0: an open source environment for automated performance analysis of benchmarking data ⋮ Optimizing over the split closure ⋮ A relax-and-cut framework for Gomory mixed-integer cuts ⋮ Cyclic and non-cyclic crew rostering problems in public bus transit ⋮ Self-scheduling of electric vehicles in an intelligent parking lot using stochastic optimization ⋮ Learning when to use a decomposition ⋮ Experiments with conflict analysis in mixed integer programming ⋮ A first look at picking dual variables for maximizing reduced cost fixing ⋮ Exploring relaxation induced neighborhoods to improve MIP solutions ⋮ Information-based branching schemes for binary linear mixed integer problems ⋮ Faster MIP solutions via new node selection rules ⋮ Generating hard instances for robust combinatorial optimization ⋮ Tailoring parallel alternating criteria search for domain specific MIPs: application to maritime inventory routing ⋮ Pivot-and-reduce cuts: an approach for improving Gomory mixed-integer cuts ⋮ 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 ⋮ Orbital shrinking: theory and applications ⋮ The (not so) trivial lifting in two dimensions ⋮ QPLIB: a library of quadratic programming instances ⋮ An enhanced branch-and-bound algorithm for bilevel integer linear programming ⋮ Polyhedral approximation of ellipsoidal uncertainty sets via extended formulations: a computational case study ⋮ HMS: a hybrid multi-start algorithm for solving binary linear programs ⋮ Optimal decision trees for feature based parameter tuning: integer programming model and VNS heuristic ⋮ Improving strong branching by domain propagation ⋮ Random sampling and machine learning to understand good decompositions ⋮ Automatic Dantzig-Wolfe reformulation of mixed integer programs ⋮ The strength of multi-row models ⋮ On the use of intersection cuts for bilevel optimization ⋮ The confined primal integral: a measure to benchmark heuristic MINLP solvers against global MINLP solvers ⋮ Structure-driven fix-and-propagate heuristics for mixed integer programming ⋮ Computational experience with parallel mixed integer programming in a distributed environment ⋮ On identifying dominant cliques. ⋮ Learn to relax: integrating \(0-1\) integer linear programming with pseudo-Boolean conflict-driven search ⋮ Worst-case analysis of clique MIPs ⋮ An exact projection-based algorithm for bilevel mixed-integer problems with nonlinearities ⋮ Hierarchical solution of non-convex optimal control problems with application to autonomous driving ⋮ Political districting to minimize cut edges ⋮ On mathematical programming with indicator constraints ⋮ Cutting to the chase. ⋮ An algorithm-independent measure of progress for linear constraint propagation ⋮ 2DPackLib: a two-dimensional cutting and packing library
This page was built for software: MIPLIB
